Advertisement

Queueing

  • Mario Lefebvre
Chapter
Part of the Springer Undergraduate Texts in Mathematics and Technology book series (SUMAT)

Abstract

An important application of probability theory is the field known as queueing theory. This field studies the behavior of waiting lines or queues. Telecommunication engineers and computer scientists are particularly interested in queueing theory to solve problems concerned with the efficient allocation and use of resources in wireless and computer networks, for instance. In general, the models considered in this chapter are such that the arrivals in the queueing system and the departures from this system both constitute Poisson processes, which were defined in Chapter 3 (p. 69). Poisson processes are actually particular continuous-time Markov chains, which are the subject of the first section of the present chapter. Next, the case when there is a single server in the queueing system and that when the number of servers is greater than or equal to two is studied separately.

Keywords

Balance Equation Service Time Arrival Rate Poisson Process System Capacity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York 2008

Authors and Affiliations

  1. 1.Département de Mathématiques et de génie industrielÉcole Polytechnique de Montréal, QuébecMontréalCanada

Personalised recommendations