Chapman and Hall/CRC
Performance Analysis of Queuing and Computer Networks develops simple models and analytical methods from first principles to evaluate performance metrics of various configurations of computer systems and networks. It presents many concepts and results of probability theory and stochastic processes.
After an introduction to queues in computer networks, this self-contained book covers important random variables, such as Pareto and Poisson, that constitute models for arrival and service disciplines. It then deals with the equilibrium M/M/1/∞queue, which is the simplest queue that is amenable for analysis. Subsequent chapters explore applications of continuous time, state-dependent single Markovian queues, the M/G/1 system, and discrete time queues in computer networks. The author then proceeds to study networks of queues with exponential servers and Poisson external arrivals as well as the G/M/1 queue and Pareto interarrival times in a G/M/1 queue. The last two chapters analyze bursty, self-similar traffic, and fluid flow models and their effects on queues.
Introduction.Characterization of Data Traffic.The M/M/1/∞ Queue.State-Dependent Markovian Queues.The M/G/1 Queue.Discrete Time Queues. Continuous Time Queuing Networks.The G/M/1 Queue. Queues with Bursty, MMPP, and Self-Similar Traffic.Analysis of Fluid Flow Models. Appendix. Index.