Systems with Queueing and their Simulation
Abstract:In the queueing theory, it is assumed that customer
arrivals correspond to a Poisson process and service time has the
exponential distribution. Using these assumptions, the behaviour of
the queueing system can be described by means of Markov chains
and it is possible to derive the characteristics of the system. In the
paper, these theoretical approaches are presented on several types of
systems and it is also shown how to compute the characteristics in a
situation when these assumptions are not satisfied
 G. Bolch, S. Greiner, H. Meer and K.S. Trivedi, Queueing Networks and
Markov Chains. John Wiley & Sons, New York, 2006.
 S.K. Bose, An Introduction to Queueing Systems. Springer-Verlag,
 R.B. Cooper, Introduction to Queueing Theory. North Holland, New
 D. Gross, J.F. Shortle, J.M. Thompson and C.M. Harris, Fundamentals
of Queueing Theory. John Wiley & Sons, New York, 2008.
 K. Hrubina, A. Jadlovsk├í, S. Hrehov├í., Optimisation Algorithms Using
Programme Systems. Technical University in Ko┼íice, Pre┼íov-Ko┼íice,
 J. Klvaňa, Modelling. Czech Technical University Prague, 2005.
 I. Rukovansk├¢, "Evolution of Complex Systems," in Proceedings of the
8th Joint Conference on Information Sciences, Salt Lake City, Utah,
 J. Virtamo, Queueing Theory. Lecture Notes. Helsinki University of
 A. Willig, A Short Introduction to Queueing Theory. Lecture Notes.
Technical University Berlin, 1999, 42 pp.