ABSTRACT
This chapter presents the basic queueing theory encompassing the simple M/M/1 queue to the intermediate M/G/1 queue. The M/M/1 queue is particularly useful because its analysis can be extended to product-form networks. The M/G/1 queue is also fairly useful for networking problems because the service time can be general and the Pollaczek-Khinchin formulas allow straightforward analysis. Unfortunately, the assumption of Poisson arrivals limits the applicability of these models. Simpler models such as the stochastic fluid buffer have been successful alternatives to queueing models because they are more tractable, even though they appear at first to be more abstract. Advanced queueing theory also covers a variety of complications such as service scheduling algorithms, service preemption, multiple queues, and buffer management or selective discarding algorithms. The literature on queueing theory and its applications to networking problems is vast due to the many possible variations of the basic queueing models.
