Skip to main content
Log in

State-dependent Coupling of Quasireversible Nodes

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

The seminal paper of Jackson began a chain of research on queueing networks with product-form stationary distributions which continues strongly to this day. Hard on the heels of the early results on queueing networks followed a series of papers which discussed the relationship between product-form stationary distributions and the quasireversibility of network nodes. More recently, the definition of quasireversibility and the coupling mechanism between nodes have been extended so that they apply to some of the later product-form queueing networks incorporating negative customers, signals, and batch movements.

In parallel with this research, it has been shown that some special queueing networks can have arrival and service parameters which depend upon the network state, rather than just the node state, and still retain a generalised product-form stationary distribution.

In this paper we begin by offering an alternative proof of a product-form result of Chao and Miyazawa and then build on this proof by postulating a state-dependent coupling mechanism for a quasireversible network. Our main theorem is that the resultant network has a generalised product form stationary distribution. We conclude the paper with some examples.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. K. Aarssen and N.M. van Dijk, A note on Jackson networks with state-dependent rejection probabilities, Oper. Res. Lett. 16 (1994) 177–181.

    Google Scholar 

  2. R.J. Boucherie and N.M. van Dijk, Product forms for queueing networks with state-dependent multiple job transitions, Adv. in Appl. Probab. 23 (1991) 152–187.

    Google Scholar 

  3. X. Chao, A note on queueing networks with signals and random triggering times, Probab. Engrg. Inform. Sci. 8 (1994) 213–219.

    Google Scholar 

  4. X. Chao, Networks of queues with customers, signals and arbitrary service time distributions, Oper. Res. 43 (1995) 537–544.

    Google Scholar 

  5. X. Chao and M. Pinedo, On generalized networks of queues with positive and negative arrivals, Probab. Engrg. Inform. Sci. 7 (1993) 301–334.

    Google Scholar 

  6. X. Chao, M. Pinedo and D. Shaw, Networks of queues with batch services and customer coalescence, J. Appl. Probab. 33 (1996) 858–869.

    Google Scholar 

  7. X. Chao and M. Miyazawa, A probabilistic decomposition approach to quasi-reversibility and its application in coupling of queues, Personal communication (1996).

  8. X. Chao and M. Miyazawa, Queueing networks with instantaneous movements: A coupling approach by quasi-reversibility, Personal communication (1996).

  9. X. Chao, M. Miyazawa and M. Pinedo, Queueing Networks: Customers, Signals and Product Form Solutions (Wiley, 1999).

  10. X. Chao, M. Miyazawa, R.F. Serfozo and H. Takada, Markov network processes with product-form stationary distributions, Queueing Systems 28 (1998) 377–402.

    Google Scholar 

  11. X. Chao and S. Zheng, A result on networks of queues with customer coalescence and state-dependent signaling, J. Appl. Probab. (1996), to appear.

  12. E. Gelenbe, Product-form networks with negative and positive customers, J. Appl. Probab. 28 (1991) 656–663.

    Google Scholar 

  13. E. Gelenbe and R. Schassberger, Stability of product form G-networks, Probab. Engrg. Inform. Sci. 6 (1992) 271–276.

    Google Scholar 

  14. E. Gelenbe, G-networks with triggered customer movement, J. Appl. Probab. 30 (1993) 931–942.

    Google Scholar 

  15. E. Gelenbe, G-networks with signals and batch removals, Probab. Engrg. Inform. Sci. 7 (1993) 335–342.

    Google Scholar 

  16. W. Henderson, Queueing networks with negative customers and negative queue lengths, J. Appl. Probab. 30 (1993) 931–942.

    Google Scholar 

  17. W. Henderson, B. Northcote and P.G. Taylor, Geometric equilibrium distributions for networks of queues with interactive batch departures, Ann. Oper. Res. 48(1) (1993) 493–511.

    Google Scholar 

  18. W. Henderson, B. Northcote and P.G. Taylor, State-dependent signalling in queueing networks, Adv. in Appl. Probab. 26 (1994) 436–455.

    Google Scholar 

  19. W. Henderson, B. Northcote and P.G. Taylor, Triggered batch movement in queueing networks, Queueing Systems 21 (1995) 125–141.

    Google Scholar 

  20. W. Henderson, C.E.M. Pearce, P.K. Pollett and P.G. Taylor, Connecting internally-balanced quasireversible Markov processes, Adv. in Appl. Probab. 24 (1992) 934–959.

    Google Scholar 

  21. W. Henderson, C.E.M. Pearce, P.G. Taylor and N. van Dijk, Closed queueing networks with batch services, Queueing Systems 6 (1990) 59–70.

    Google Scholar 

  22. W. Henderson and P.G. Taylor, Product form in networks of queues with batch arrivals and batch services, Queueing Systems 6 (1990) 71–88.

    Google Scholar 

  23. J.R. Jackson, Networks of waiting lines, Oper. Res. 5 (1957) 518–521.

    Google Scholar 

  24. F.P. Kelly, Markov processes and Markov random fields, Bull. Inst. Int. Statist. 46 (1975) 397–404.

    Google Scholar 

  25. F.P. Kelly, Reversibility and Stochastic Networks (Wiley, London, 1979).

    Google Scholar 

  26. F.P. Kelly, Networks of quasireversible nodes, applied probability-computer science, the interface, in: Proc. of the ORSA-TIMS Boca Raton Symposium, ed. R. Disney (Birkhäuser, Boston, 1981).

    Google Scholar 

  27. J.F.C. Kingman, Markov population processes, J. Appl. Probab. 6 (1969) 1–18.

    Google Scholar 

  28. W.A. Massey, Stochastic orderings for Markov processes on partially ordered spaces, Math. Oper. Res. 12 (1987) 350–367.

    Google Scholar 

  29. M. Miyazawa and X. Chao, Generating a queueing network with signals and state dependent local transitions from a quasi-reversible network, Preprint.

  30. M. Miyazawa and H. Takada, Traffic flows and product form solutions in stochastic transfer networks, Preprint (1999).

  31. M. Miyazawa and P.G. Taylor, A geometric product-form distribution for a queueing network with nonstandard batch arrivals and batch transfers, Adv. in Appl. Probab. 29 (1997) 523–544.

    Google Scholar 

  32. M. Miyazawa and R. Wolff, Symmetric queues with batch departures and their networks, Adv. in Appl. Probab. 28 (1996) 308–326.

    Google Scholar 

  33. B.S. Northcote, Signalling in product form queueing networks, Ph.D. thesis, University of Adelaide (1993).

  34. P.K. Pollett, Connecting reversible processes, Adv. in Appl. Probab. 18 (1986) 880–900.

    Google Scholar 

  35. P.K. Pollett, Preserving partial balance in continuous-time Markov chains, Adv. in Appl. Probab. 18 (1987) 431–453.

    Google Scholar 

  36. R.F. Serfozo,Markovian network processes: Congestion-dependent routing and processing, Queueing Systems 5 (1989) 5–36.

    Google Scholar 

  37. R.F. Serfozo and B. Yang, Markov network processes with string transitions, Ann. Appl. Probab. 8 (1996) 793–821.

    Google Scholar 

  38. P.G. Taylor, Quasi-reversibility and networks of queues with non-standard batch movements, in: Proc. of the Second Australia-Japan Workshop on Stochastic Models, Gold Coast (July 1996).

  39. N.M. van Dijk, On Jackson's product form with jump over blocking, Oper. Res. Lett. 7(5) (1992) 233–235.

    Google Scholar 

  40. J. Walrand, An Introduction to Queueing Networks (Prentice-Hall, Englewood Cliffs, NJ, 1988).

    Google Scholar 

  41. J. Walrand and P. Varaiya, Interconnections of Markov chains and quasireversible queueing networks, Stoch. Proc. Appl. 10 (1980) 209–219.

    Google Scholar 

  42. P. Whittle, Systems in Stochastic Equilibrium (Wiley, London, 1986).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Henderson, W., Taylor, P. State-dependent Coupling of Quasireversible Nodes. Queueing Systems 37, 163–197 (2001). https://doi.org/10.1023/A:1011048418603

Download citation

  • Issue Date:

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

Navigation