Skip to main content

Models and Simulations of Queueing Systems

  • Conference paper
  • First Online:
Recent Advances in Soft Computing (ICSC-MENDEL 2016)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 576))

Included in the following conference series:

Abstract

In the queueing theory, it is assumed that requirement arrivals correspond to the Poisson process and the service time has the exponential distribution. Using these assumptions, the behaviour of the queueing system can be described by means of the Markov chains and it is possible to derive characteristics of the system. In the paper, these theoretical approaches are presented and focused on systems with several service lines and the FIFO queue when the number of requirements exceeds the number of lines. Finally, it is also shown how to compute the characteristics in a situation when these assumptions are not satisfied.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

References

  1. Bolch, G., Greiner, S., Meer, H., Trivedi, K.S.: Queueing Networks and Markov Chains. Wiley, New York (2006)

    Book  MATH  Google Scholar 

  2. Bose, S.K.: An Introduction to Queueing Systems. Springer-Verlag, Berlin (2001)

    Google Scholar 

  3. Cooper, R.B.: Introduction to Queueing Theory. North Holland, New York (1981)

    MATH  Google Scholar 

  4. Gross, D., Shortle, J.F., Thompson, J.M., Harris, C.M.: Fundamentals of Queueing Theory. Wiley, New York (2008)

    Book  MATH  Google Scholar 

  5. Horký, M.: Models of Queueing Systems. Diploma Thesis, Brno University of Technology, Brno (2015)

    Google Scholar 

  6. Hrubina, K., Jadlovská, A., Hrehová, S.: Optimisation Algorithms Using Programme Systems. Lecture Notes. Technical University in Košice, Prešov-Košice (2005)

    Google Scholar 

  7. Šeda, M.: Models of queueing systems. Acta Logistica Moravica 1, 16–33 (2011)

    Google Scholar 

  8. Virtamo, J.: Queueing Theory. Lecture Notes. Helsinki University of Technology, Espoo (2005)

    Google Scholar 

  9. Willig, A.: A Short Introduction to Queueing Theory. Lecture Notes. Technical University, Berlin (1999). 42 pp.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Miloš Šeda .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Šeda, M., Šedová, J., Horký, M. (2017). Models and Simulations of Queueing Systems. In: Matoušek, R. (eds) Recent Advances in Soft Computing. ICSC-MENDEL 2016. Advances in Intelligent Systems and Computing, vol 576. Springer, Cham. https://doi.org/10.1007/978-3-319-58088-3_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-58088-3_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-58087-6

  • Online ISBN: 978-3-319-58088-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics