Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Social Network Analysis and Mining pp 1994–2005Cite as

Queueing Theory

  • Reference work entry
  • First Online:

  • 45 Accesses

Synonyms

Service systems; Waiting time models

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, and 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:
...

This is a preview of subscription content, 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   2,500.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   549.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

References

  • Alfa A (2010) Queueing theory for telecommunications. Springer, New York

    Book  MATH  Google Scholar 

  • Bolch G, Greiner S, de Meer H, Trivedi KS (2006) Queueing networks and markov chains, 2nd edn. Wiley-Interscience, Hoboken

    Book  MATH  Google Scholar 

  • Brill PH (1975) System point theory in exponential queues. PhD thesis, Industrial Engineering, University of Toronto

    Google Scholar 

  • Brill P (2017) Level crossing methods in stochastic processes, 2nd edn. Springer, New York

    Book  MATH  Google Scholar 

  • Cohen JW (1957) Basic problems of telephone traffic theory and the influence of repeated calls. Philips Telecommun Rev 18:49–100

    Google Scholar 

  • Cooper R, Murray G (1969) Queues served in cyclic order. Bell Syst Tech J 48:675–689

    Article  MathSciNet  MATH  Google Scholar 

  • Cox DR (1955) The analysis of non-Markovian stochastic processes by the inclusion of supplementary variables. Proc Camb Philos Soc 51:433–441

    Article  MathSciNet  MATH  Google Scholar 

  • Cox DR, Smith WL (1961) Queues. Methuen, London

    Google Scholar 

  • Crommelin CD (1932) Delay probability formulae when the holding times are constant. Post Off Electr Eng J 25:41–50

    Google Scholar 

  • Engset T (1918) Die wahrscheinlichkeitsrechnung zur bestimmung der wahleranzahl in automatischen fernsprechamtern. Elektrotech Z 31:304–306

    Google Scholar 

  • Erlang AK (1909) The theory of probability and telephone conversations. NytTidsskrift for Matematik B 20:33–39. (in Danish)

    Google Scholar 

  • Fry T (1928) Probability and its engineering uses. Van Nostrand, New York

    MATH  Google Scholar 

  • Gautam N (2012) Analysis of queues: methods and applications. CRC, Boca Raton

    MATH  Google Scholar 

  • Gaver DP (1968) Diffusion approximations and models for certain congestion problems. J Appl Probab 5:607–623

    Article  MathSciNet  MATH  Google Scholar 

  • Gelembe E (1991) Product form queueing networks with negative and positive customers. J Appl Probab 28:656–663

    Article  MathSciNet  Google Scholar 

  • Grassmann WK, Taksar M, Heyman DP (1985) Regenerative analysis and steady state distributions for Markov chains. Oper Res 33:1107–1117

    Article  MathSciNet  MATH  Google Scholar 

  • Gross D, Harris CM (1974) Fundamentals of queueing theory. Wiley, New York

    MATH  Google Scholar 

  • Gross D, Shortle JF, Thompson JM, Harris CM (2008) Fundamentals of queueing theory, 4th edn. Wiley, Hoboken

    Book  MATH  Google Scholar 

  • Haight FA (1957) Queuing with balking. Biometrika 44:360–369

    Article  MathSciNet  MATH  Google Scholar 

  • Haight FA (1959) Queueing with reneging. Metrika 2:186–197

    Article  MathSciNet  MATH  Google Scholar 

  • Hlynka M (2017) Queueing theory web site http://web2.uwindsor.ca/math/hlynka/queue.html. Accessed 15 September 2017

    Google Scholar 

  • Jackson RRP (1954) Queuing systems with phase type service. Oper Res Q 5:109–120

    Article  Google Scholar 

  • Jackson RRP (1956) Random queuing processes with phase type service. J R Stat Soc B 18:129–132

    MATH  Google Scholar 

  • Jackson JR (1957) Networks of waiting lines. Oper Res 5:518–521

    Article  MathSciNet  Google Scholar 

  • Jackson JR (1963) Jobshop-like queuing systems. Manag Sci 10:131–142

    Article  Google Scholar 

  • 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

    Article  MathSciNet  MATH  Google Scholar 

  • Khinchin A (1932) Mathematisches uber die Erwartung vor einem offentlichen Schalter. Matematicheskii Sbornik 39:73–84

    MATH  Google Scholar 

  • Kleinrock L (1975, 1976) Queueing systems. vols 1, 2. Wiley, New York

    Google Scholar 

  • Kolmogorov AN (1931) Sur le probleme d’attente. Matematicheskii Sbornik 38:101–106

    MATH  Google Scholar 

  • Larson RC (1990) The queue inference machine. Manag Sci 36:586–601

    Article  MATH  Google Scholar 

  • Latouche G, Ramaswami V (1999) Introduction to matrix analytic methods in stochastic modeling. SIAM, Philadelphia

    Book  MATH  Google Scholar 

  • Lee AM (1966) Applied queueing theory. Macmillan, London

    Book  MATH  Google Scholar 

  • Lindley DV (1952) The theory of queues with a single server. Math Proc Camb Philos Soc 48:277–289

    Article  MathSciNet  MATH  Google Scholar 

  • Little JDC (1961) A proof of the queuing formula L = λW. Oper Res 9:383–387

    Article  MathSciNet  Google Scholar 

  • Mandelbaum M, Avi-Itzhak B (1968) Introduction to queueing with splitting and matching. Isr J Technol 6:288–298

    MATH  Google Scholar 

  • Molina EC (1922) The theory of probabilities applied to telephone trunking problems. Bell Syst Tech J 1:69–81

    Article  Google Scholar 

  • Morse PM (1958) Queues, inventories, and maintenance. Wiley, New York

    Google Scholar 

  • Neuts MF (1981) Matrix-geometric solutions in stochastic models. Johns Hopkins University Press, Baltimore

    MATH  Google Scholar 

  • Newell GF (1968) Queues with time-dependent arrival rates. Appl Probab 5:436–451

    Article  MATH  Google Scholar 

  • O’Dell GF (1920) Theoretical principles of the traffic capacity of automatic switches. Post Off Electical Eng J 13:209

    Google Scholar 

  • Palm C (1936) Calcul exact de la perte dans les groupes de circuits echelonnes. Ericsson Tech 3:41–71

    Google Scholar 

  • Palm C (1937) Etudes des delais d’attente. Ericsson Tech 2:39–56

    Google Scholar 

  • Pollaczek F (1930) Uber eine Aufgabe der Wahrschein-lichkeitstheorie. Math Z 32:64–100

    Article  MathSciNet  MATH  Google Scholar 

  • Prabhu NU (1965) Queues and inventories. Wiley, New York

    MATH  Google Scholar 

  • Riordan J (1962) Stochastic service systems. Wiley, New York

    MATH  Google Scholar 

  • Saaty T (1961) Elements of queueing theory. McGraw-Hill, New York

    MATH  Google Scholar 

  • Stewart WJ (2009) Probability, markov chains, queues, and simulation. Princeton University Press, Princeton

    MATH  Google Scholar 

  • Takacs L (1962) Introduction to the theory of queues. Oxford University Press, Oxford

    MATH  Google Scholar 

  • White H, Christie LS (1958) Queuing with preemptive priorities or with breakdown. Oper Res 6:79–95

    Article  MathSciNet  Google Scholar 

  • Wolff RW (1982) Poisson arrivals see time averages. Oper Res 30:223–231

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, University of Windsor, Windsor, ON, Canada

    Myron Hlynka

Authors
  1. Myron Hlynka
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Myron Hlynka .

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, Calgary, AB, Canada

    Reda Alhajj

  2. Department of Computer Science, University of Calgary, Calgary, AB, Canada

    Jon Rokne

Section Editor information

  1. American University of Sharjah, Sharjah, United Arab Emirates

    Suheil Khoury

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Hlynka, M. (2018). 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-4939-7131-2_160

Download citation

Publish with us

Policies and ethics

Search

Navigation