Skip to main content
SpringerLink
Log in

Laws of Conservation in the Queueing Theory

  • Conference paper
Multiple Access Communications (MACOM 2010)

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

Included in the following conference series:

Abstract

The history of laws of preservation of the queuing theory is considered. Additional formulations, their consequences and use at the calculation of complex queueing systems and networks are discussed. It is offered to use more actively conservation laws at training at the universities and at research work.

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

Access this chapter

Log in via an institution
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. Krakowski, M.: Conservation Methods in Queuing Theory. Revue Française d’Automatique, Informatique et R écherhe Op érationnelle 1, 63–84 (1973)

    MathSciNet  Google Scholar 

  2. Kleinrock, L.: Queuing Systems. In: Computer Applications, vol. 2, Wiley, New York (1976)

    Google Scholar 

  3. Ryzhikov, Y.I.: Machine Methods of Queuing Systems Calculation, p. 177. Military Cosmic academy under A.F.Mozhajsky, Leningrad (1979) (in Russian)

    Google Scholar 

  4. Stepanov, S.N.: Numerical Methods of the Calculation of Systems with Repeated Calls. Science, 229 (1983) (in Russian)

    Google Scholar 

  5. 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(2), 147–157 (1976)

    MATH  MathSciNet  Google Scholar 

  6. Ryzhikov, Y.I.: Algorithm of Calculation of Multi-Channel System with Erlangian Service. Automatics and Telemecvhanics 5, 30–37 (1980) (in Russian)

    MathSciNet  Google Scholar 

  7. Ryzhikov, Y.I., Khomonenko, A.D.: Iterative Method of Calculation of Multi-Channel systems with General Service Time Distribution. Problems of Control and Information Theory 3, 32–38 (1980)

    Google Scholar 

  8. Matveev, V.F., Ushakov, V.G.: Queuing Systems: Manual on a special course “Applied mathematics”, p. 239. Moscow State University (1984) (in Russian)

    Google Scholar 

  9. Robertazzi, T.G.: Computer Networks and Systems: Queueing Theory and Performance Evaluation, p. 306. Springer, New York (1990)

    MATH  Google Scholar 

  10. Brumelle, S.L.: A Generalization of L = λW to Moments of Queue Length and Waiting Times. Operat. Res. 20(6), 1127–1136 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  11. Bocharov, P.P., Pechinkin, A.V.: Queueing Theory: The textbook, p. 529. University under P.Lumumba (1995) (in Russian)

    Google Scholar 

  12. Ryzhikov, Y.I., Khomonenko, A.D.: Computation of the Opened Queueing Networks with Flows Transformation. Automatics and Computer Technics 3, 15–24 (1989) (in Russian)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of computer science and automation of the Russian Academy of Sciences, Saint-Petersburg, Russia

    Yuri Ryzhikov

Authors
  1. Yuri Ryzhikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Russian Academy of Sciences (SPIIRAS), Saint-Petersburg Institute for Informatics and Automation, 199178, St. Petersburg, Russia

    Alexey Vinel

  2. Department of Information and Communication Technologies, Universitat Pompeu Fabra, Roc Boronat 138, 08018, Barcelona, Spain

    Boris Bellalta  & Miquel Oliver  & 

  3. Department of Information Engineering and Computer Science (DISI), University of Trento, Via Sommarive 14, 38050, Povo (Trento), Italy

    Claudio Sacchi

  4. Institute for Information Transmission Problems, RAS, Bolshoy Karetny per., 127994, Moscow, Russia

    Andrey Lyakhov

  5. Department of Telecommunications, Budapest University of Technology and Economics, P.O. Box 91, 1521, Budapest, Hungary

    Miklós Telek

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ryzhikov, Y. (2010). Laws of Conservation in the Queueing Theory. In: Vinel, A., Bellalta, B., Sacchi, C., Lyakhov, A., Telek, M., Oliver, M. (eds) Multiple Access Communications. MACOM 2010. Lecture Notes in Computer Science, vol 6235. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15428-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15428-7_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15427-0

  • Online ISBN: 978-3-642-15428-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation