Synonyms
Glossary
- Bottleneck:
-
A location in a queueing network where the delay is especially long, perhaps due to a reduction in service at that location
- Busy period:
-
For a single server system, the busy period is the time between the arrival of a customer to an empty system until the server has no customers remaining to be served
- Call center:
-
A telephone service center manned by numerous servers in which “customers” can phone for information or service
- Customer:
-
A person or object that must receive service. Examples could be people, cars, computer commands
- Double ended queue:
-
A system with a line of customers or a line of servers and the interaction between them (such as taxis and passengers)
- First in first out (FIFO)/First come first serve:
-
The procedure of customers joining the queue and being served in order corresponding to the arrival time
- Interarrival time:
-
The time between two consecutive arrivals to the system
- Jockeying:
-
The procedure of a...
References
Alfa A (2010) Queueing theory for telecommunications. Springer, New York, MATH
Bolch G, Greiner S, de Meer H, Trivedi KS (2006) Queueing networks and markov chains, 2nd edn. Wiley-Interscience, Hoboken, MATH
Brill PH (1975) System point theory in exponential queues. PhD thesis, Industrial Engineering, University of Toronto
Brill P (2008) Level crossing methods in stochastic processes. Springer, New York
Cohen JW (1957) Basic problems of telephone traffic theory and the influence of repeated calls. Philips Telecommun Rev 18:49–100
Cooper R, Murray G (1969) Queues served in cyclic order. Bell Syst Tech J 48:675–689, MATHMathSciNet
Cox DR (1955) The analysis of non-Markovian stochastic processes by the inclusion of supplementary variables. Proc Camb Philos Soc 51:433–441, MATH
Cox DR, Smith WL (1961) Queues. Methuen, London
Crommelin CD (1932) Delay probability formulae when the holding times are constant. Post Off Electr Eng J 25:41–50
Engset T (1918) Die wahrscheinlichkeitsrechnung zur bestimmung der wahleranzahl in automatischen fernsprechamtern. Elektrotech Z 31:304–306
Erlang AK (1909) The theory of probability and telephone conversations. NytTidsskrift for Matematik B 20:33–39, MATH (in Danish)
Fry T (1928) Probability and its engineering uses. Van Nostrand, New York, MATH
Gautam N (2012) Analysis of queues: methods and applications. CRC, Boca Raton
Gaver DP (1968) Diffusion approximations and models for certain congestion problems. J Appl Probab 5:607–623, MATHMathSciNet
Gelembe E (1991) Product form queueing networks with negative and positive customers. J Appl Probab 28:656–663, MathSciNet
Grassmann WK, Taksar M, Heyman DP (1985) Regenerative analysis and steady state distributions for Markov chains. Oper Res 33:1107–1117, MATHMathSciNet
Gross D, Harris CM (1974) Fundamentals of queueing theory. Wiley, New York, MATH
Gross D, Shortle JF, Thompson JM, Harris CM (2008) Fundamentals of queueing theory, 4th edn. Wiley, Hoboken
Haight FA (1957) Queuing with balking. Biometrika 44:360–369, MATHMathSciNet
Haight FA (1959) Queueing with reneging. Metríka 2:186–197, MATHMathSciNet
Hlynka M (2013) Queueing theory web site. http://web2.uwindsor.ca/math/hlynka/queue.html. Accessed 15 May 2013
Jackson RRP (1954) Queuing systems with phase type service. Oper Res Quart 5:109–120
Jackson RRP (1956) Random queuing processes with phase type service. J R Stat Soc B 18:129–132, MATH
Jackson JR (1957) Networks of waiting lines. Oper Res 5:518–521
Jackson JR (1963) Jobshop-like queuing systems. Manag Sci 10:131–142
Kendall DG (1953) Stochastic processes occurring in the theory of queues and their analysis by the method of imbedded Markov chains. Ann Math Stat 24:338–354, MATHMathSciNet
Khinchin A (1932) Mathematisches uber die Erwartung vor einem offentlichen Schalter. Matematicheskii Sbornik 39:73–84, MATH
Kleinrock L (1975, 1976) Queueing systems. vols 1, 2. Wiley, New York
Kolmogorov AN (1931) Sur le probleme d’attente. Matematicheskii Sbornik 38:101–106, MATH
Larson RC (1990) The queue inference machine. Manag Sci 36:586–601, MATH
Latouche G, Ramaswami V (1999) Introduction to matrix analytic methods in stochastic modeling. SIAM, Philadelphia, MATH
Lee AM (1966) Applied queueing theory. Macmillan, London, MATH
Lindley DV (1952) The theory of queues with a single server. Math Proc Camb Philos Soc 48:277–289, MathSciNet
Little JDC (1961) A proof of the queuing formula L = λW. Oper Res 9:383–387, MATHMathSciNet
Mandelbaum M, Avi-Itzhak B (1968) Introduction to queueing with splitting and matching. Isr J Technol 6:288–298
Molina EC (1922) The theory of probabilities applied to telephone trunking problems. Bell Syst Tech J 1:69–81
Morse PM (1958) Queues, inventories, and maintenance. Wiley, New York
Neuts MF (1981) Matrix-geometric solutions in stochastic models. Johns Hopkins University Press, Baltimore, MATH
Newell GF (1968) Queues with time-dependent arrival rates. Appl Probab 5:436–451, MATHMathSciNet
O’Dell GF (1920) Theoretical principles of the traffic capacity of automatic switches. Post Off Electical Eng J 13:209
Palm C (1936) Calcul exact de la perte dans les groupes de circuits echelonnes. Ericsson Tech 3:41–71
Palm C (1937) Etudes des delais d’attente. Ericsson Tech 2:39–56
Pollaczek F (1930) Uber eine Aufgabe der Wahrschein-lichkeitstheorie. Mathematische Zeitschrift 32:64–100, MATHMathSciNet
Prabhu NU (1965) Queues and inventories. Wiley, New York, MATH
Riordan J (1962) Stochastic service systems. Wiley, New York, MATH
Saaty T (1961) Elements of queueing theory. McGraw-Hill, New York, MATH
Stewart WJ (2009) Probability, markov chains, queues, and simulation. Princeton University Press, Princeton, MATH
Takacs L (1962) Introduction to the theory of queues. Oxford University Press, Oxford, MATH
White H, Christie LS (1958) Queuing with preemptive priorities or with breakdown. Oper Res 6:79–95, MathSciNet
Wolff RW (1982) Poisson arrivals see time averages. Oper Res 30:223–231, MATHMathSciNet
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media LLC
About this entry
Cite this entry
Hlynka, M. (2016). Queueing Theory. In: Alhajj, R., Rokne, J. (eds) Encyclopedia of Social Network Analysis and Mining. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7163-9_160-1
Download citation
DOI: https://doi.org/10.1007/978-1-4614-7163-9_160-1
Received:
Accepted:
Published:
Publisher Name: Springer, New York, NY
Online ISBN: 978-1-4614-7163-9
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering
Publish with us
Chapter history
-
Latest
Queueing Theory- Published:
- 19 September 2017
DOI: https://doi.org/10.1007/978-1-4614-7163-9_160-2
-
Original
Queueing Theory- Published:
- 30 December 2016
DOI: https://doi.org/10.1007/978-1-4614-7163-9_160-1