Skip to main content

Realization of a Method of Matrix-Geometric Progression

  • Conference paper
Smart Spaces and Next Generation Wired/Wireless Networking (ruSMART 2010, NEW2AN 2010)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 6294))

  • 831 Accesses

Abstract

Ways of calculation of a denominator of a matrix-geometrical progression and initial vectors of probabilities of microstates are examined and compared at calculation of multi-phase multichannel queuing systems.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Ryzhikov, Y.I.: Theory of Queues and Inventory Control, p. 384. St-Petersburg, Peter (2001) (in Russia)

    Google Scholar 

  2. Takahashi, Y., Takami, Y.: A Numerical Method for the Steady–State Probabilities of a GI/G/c Queuing System in a General Class. J. of the Operat. Res. Soc. of Japan 19, 147–157 (1976)

    Article  MATH  Google Scholar 

  3. Ryzhikov, Y.I., Khomonenko, A.D.: The Iterative Method of the Calculation of Multichannel Systems with any Distribution of Service Time. Problems of Control and Information Theory (3), 32–38 (1980)

    Google Scholar 

  4. Evans, R.D.: Geometric Distribution in Some Two Dimensional Queuing Systems. Operat. Res. 15, 830–846 (1967)

    Article  Google Scholar 

  5. Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: an Algorithmic Approach. J. Hopkins Univ. press, Baltimore (1981)

    MATH  Google Scholar 

  6. Bocharov, P.P., Pechinkin, A.V.: Theory of Queuing: the Textbook, p. 529. University under P.Lumumba, Moscow (1995) (in Russia)

    Google Scholar 

  7. Latouche, G., Ramaswami, V.: A Logarithmic Reduction Algorithm for Quasi-Birth-and-Death Process. J. Appl. Prob. 30, 650–674 (1993)

    Article  MATH  Google Scholar 

  8. Daigle, J.N.: Queuing Theory with demands to Packet Telecommunication, p. 326. Springer, Boston (2005)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ryzhikov, Y. (2010). Realization of a Method of Matrix-Geometric Progression. In: Balandin, S., Dunaytsev, R., Koucheryavy, Y. (eds) Smart Spaces and Next Generation Wired/Wireless Networking. ruSMART NEW2AN 2010 2010. Lecture Notes in Computer Science, vol 6294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14891-0_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14891-0_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14890-3

  • Online ISBN: 978-3-642-14891-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics