Skip to main content

Product forms as a solution base for queueing systems

  • Conference paper
DGOR / ÖGOR

Part of the book series: Operations Research Proceedings 1992 ((ORP,volume 1992))

Abstract

A class of queueing networks has a product-form solution. It is interesting to investigate which queueing systems have solutions in the form of linear combinations of product forms. In this paper it is investigated when the equilibrium distribution of one or two-dimensional Markovian queueing systems can be written as linear combination of products of powers. Also some cases with extra supplementary variables are investigated.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adan, I.J.B.F., Wessels, J., and Zijm, W.H.M., “Analysis of the symmetric shortest queue problem,” Stochastic Models, vol. 6, pp. 691–713, 1990.

    Article  Google Scholar 

  2. Adan, I.J.B.F., Wessels, J., AND Zum, W.H.M., Analysis of the asymmetric shortest queue problem,Queueing Systems, vol. 8, pp. 1–58, 1991.

    Google Scholar 

  3. Adan, I.J.B.F., wessels, J., and Zum, W.H.M., “A compensation approach for two-dimensional Markov processes,” Adv. Appl. Prob., 1992 (to appear).

    Google Scholar 

  4. Adan, I.J.B.F., Wessels, J., and Zum, W.H.M., 4 4A note on 4 The effect of varying routing proba-bility in two parallel queues with dynamic routing under a threshold-type scheduling, IEICE Transactions, 1992 (to appear).

    Google Scholar 

  5. Adan, I.J.B.F., Houtum, G.J. van, Wessels, J., and Zijm, W.H.M., “A compensation procedure for multiprogramming queues,” Memorandum COSOR 91–13, Eindhoven University of Technology, Dep. of Math, and Comp. Sci., 1991 (submitted for publication).

    Google Scholar 

  6. Adan, I.J.B.F., waarsenburg, w. A. van de, and wessels, j., “Analysing Ek|Er|c queues,” Memorandum COSOR 92–27, Eindhoven University of Technology, Dep. of Math, and Comp. Sci., 1992 (submitted for publication).

    Google Scholar 

  7. Baskett, F., Chandy, K.M., Muntz, R.R., and Palacios, F.G., “Open, closed and mixed networks of queues with different classes of customers,” J ACM, vol. 22, pp. 248–260, 1975.

    Article  Google Scholar 

  8. Bertsimas, D., 44An analytic approach to a general class of G\G\s queueing systems, Opns. Res., vol. 38, pp. 139–155, 1990.

    Article  Google Scholar 

  9. Boxma, O.J. AND Houtum, G.J. Van, “The compensation approach applied to a 2x2 switch,” Memorandum COSOR 92–28, Eindhoven University of Technology, Dep. of Math, and Comp. Sci., 1992 (submitted for publication).

    Google Scholar 

  10. fayolle, G. and Iasnogorodski, R., “Two coupled processors: the reduction to a Riemann- Hilbert problem,” Z. Wahrsch. Verw. Gebiete, vol. 47, pp. 325–351, 1979.

    Google Scholar 

  11. Heffer, J.C, “Steady-state solution of the M | Ek | c (∞, FIFO) queueing system,” INFOR, vol. 7, pp. 16–30, 1969.

    Google Scholar 

  12. Houtum, G.J. Van, Adan, I.J.B.F., Wessels, J., AND Zijm, W.H.M., “The compensation approach for 3-dimensional Markov processes,” in Operations Research Proceedings 1992, Springer-Verlag, Berlin, 1993. Appears in this volume.

    Google Scholar 

  13. Kojima, T.,, M. Nakamura,, I. Sasase, and Mori, S., “The effect of varying routing probability in two parallel queues with dynamic routing under a threshold-type scheduling,” IEICE Transactions, vol. E 74, pp. 2772–2778, 1991.

    Google Scholar 

  14. Konheim, A.G., Meiluson, I., and Melkman, A., 44Processor-sharing of two parallel lines, J. Appl. Prob., vol. 18, pp. 952–956, 1981.

    Article  Google Scholar 

  15. Mayhugh, J.O. and Mccormick, R.E., “Steady state solution of the queue M |Ek|r,” mgmt. Sci., vol. 14, pp. 692–712, 1968.

    Google Scholar 

  16. Poyntz, C.D. and Jackson, R.R.P., “The steady-state solution for the queueing process Ek\Em\r,” O. R. Quart., vol. 24, pp. 615–625, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Heidelberg

About this paper

Cite this paper

Adan, I.J.B.F., Wessels, J. (1993). Product forms as a solution base for queueing systems. In: Hansmann, KW., Bachem, A., Jarke, M., Katzenberger, W.E., Marusev, A. (eds) DGOR / ÖGOR. Operations Research Proceedings 1992, vol 1992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78196-4_99

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-78196-4_99

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56642-7

  • Online ISBN: 978-3-642-78196-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics