E-raamat: Performance Analysis of Queuing and Computer Networks

This text/reference for students and engineers develops simple models and analytical methods for evaluating performance metrics of computer systems and networks. Concepts and results of probability theory and stochastic processes are developed with the help of queues as applications. After an introduction to queues in computer networks, the book covers important random variables, such as Pareto and Poisson, which constitute models for arrival and service disciplines. Subsequent chapters explore the equilibrium M/M/1/infinity queue, Markovian queues, the M/G/1 system, discrete time queues, and fluid flow models and their effects on queues. Mathematical derivations are part of the material; however, focus is maintained by splitting a sequence of results into smaller tasks and discussing the role of the results in the big picture at every step. Readers should have background in college mathematics, including differential and integral calculus, elementary matrix theory (but not linear algebra), and a course on elementary probability theory. Principles of stochastic processes and advanced matrices are not assumed. An appendix provides a brief yet rigorous review of elementary probability theory. Dattatreya is affiliated with the University of Texas-Dallas. Annotation ©2008 Book News, Inc., Portland, OR (booknews.com)

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/8queue, 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.