Skip to main content
SpringerLink
Log in

Queueing Networks with Dynamic Routing and Dynamic Stochastic Bypass of Nodes

  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

We consider open exponential networks with routing matrices that depend on a network state. A customer entering a node is either independently of other customers queued with probability that depends on the network state or instantly bypasses the node with complementary probability. After bypassing a node, customers are routed according to a stochastic matrix that depends on the network state and may differ from the routing matrix. Under certain restrictions on parameters of the model, we establish a sufficient ergodicity condition and find the final stationary distribution.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Pittel, B., Closed Exponential Networks of Queues with Saturation: the Jackson-Type Stationary Distribution and Its Asymptotic Analysis, Math. Oper. Res., 1979, vol. 4,no. 4, pp. 357-378.

    Google Scholar 

  2. Abyshkin, V.A. and Samuilov, K.E., A Method of Performance Estimation for a Queueing Network with Transition Probability Matrix Depending on a Network State, Trudy XII Vsesoyuznogo seminara po vychislitel'nym setyam (Proc. XII All-Union Semin. on Comput. Networks), Odessa, 1987, pp. 227-231.

  3. Basharin, G.P. and Chumaev, A.V., Partial and Detailed Balance Conditions for a Model of Flexible Manufacturing System, Avtomat. Telemekh., 1989, no. 4, pp. 109-115.

  4. Malinkovskii, Yu.V., Queueing Networks with Bypasses of Nodes by Customers, Avtomat. Telemekh., 1991, no. 2, pp. 102-110.

  5. Malinkovskii, Yu.V., Output Flows in Modified Jackson Networks, Avtomat. Telemekh., 1992, no. 9, pp. 134-138.

  6. Malinkovskii, Yu.V. and Yakubovich, O.V., Queueing Networks with Instantly Served Customers: I. Models with One Customer Type, Avtomat. Telemekh., 1998, no. 1, pp. 92-106.

  7. Krylenko, A.V. and Malinkovskii, Yu.V., Queueing Networks with Instantly Served Customers: II. Models with Several Customer Types, Avtomat. Telemekh., 1998, no. 2, pp. 62-71.

  8. Malinkovskii, Yu.V. and Yakubovich, O.V., Closed Queueing Networks with Bypasses of Nodes by Customers, Vestsi Akad. Navuk Belarusi, Ser. Fiz.-Mat. Navuk, 1999, no. 1, pp. 119-124.

  9. Malinkovskii, Yu.V., Invariance of the Stationary Distribution of States of Modified Jackson and Gordon-Newell Networks, Avtomat. Telemekh., 1998, no. 9, pp. 29-36.

  10. Krylenko, A.V., Queueing Networks with Several Demand Types, Immediate Service, and Node By-passing by Demands, Probl. Peredachi Inf., 1997, vol. 33,no. 3, pp. 91-101 [Probl. Inf. Trans. (Engl. Transl.), 1997, vol. 33, no. 3, pp. 268–276].

    Google Scholar 

  11. Malinkovskii, Yu.V. and Nikitenko, O.A., Stationary State Distribution for Networks with Bypasses and “Negative” Customers, Avtomat. Telemekh., 2000, vol. 61,no. 8, pp. 79-85.

    Google Scholar 

  12. Henderson, W., Pearce, C.E., Pollett, P.K., and Taylor, P.G., Connecting Internally Balanced Quasireversible Markov Processes, Adv. Appl. Probab., 1992, vol. 24,no. 4, pp. 934-959.

    Google Scholar 

  13. Miyazawa, M. and Taylor, P.G., A Geometric Product-Form Distribution for a Queueing Network with Nonstandard Batch Arrivals and Batch Transfers, Adv. Appl. Probab., 1997, vol. 29,no. 2, pp. 520-544.

    Google Scholar 

  14. Kelly, F.P., Reversibility and Stochastic Networks, New York: Wiley, 1979.

    Google Scholar 

  15. Foster, F.G., On Stochastic Matrices Associated with Certain Queueing Process, Ann. Math. Statist., 1953, vol. 24,no. 2, pp. 355-360.

    Google Scholar 

Download references

Authors
  1. V. E. Evdokimovich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu. V. Malinkovskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Evdokimovich, V.E., Malinkovskii, Y.V. Queueing Networks with Dynamic Routing and Dynamic Stochastic Bypass of Nodes. Problems of Information Transmission 37, 236–247 (2001). https://doi.org/10.1023/A:1013830124344

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1013830124344

Keywords

Search

Navigation