Performance Analysis of Queuing and Computer Networks

G.R. Dattatreya

June 9, 2008 by Chapman and Hall/CRC
Reference - 472 Pages - 80 B/W Illustrations
ISBN 9781584889861 - CAT# C9861
Series: Chapman & Hall/CRC Computer and Information Science Series


Add to Wish List
FREE Standard Shipping!


  • Includes simple, analytically tractable models, such as optimization of saturated CSMA/CD and CSMA/CA LANs
  • Presents models for complex systems as analyzable modifications and/or interconnections of simple models
  • Discusses in detail timing and synchronization in the analysis of discrete time (slotted) networks
  • Contains a wide variety of queuing models, including bursty, MMPP, approximate self-similar traffic, and fluid flow
  • Introduces queuing theory from the fundamental principles of Poisson and exponential distributions
  • Provides a brief yet rigorous, self-contained review of elementary probability theory in the appendix
  • Summary

    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.