Computer Networks and Systems

This text, intended for a first course in performance evaluation, is a self-contained treatment covering all aspects of queuing theory. It starts by introducing readers to the terminology and usefulness of queueing theory and continues by considering Markovian queues in equilibrium, Little's law, reversibility, transient analysis, and computation, and the M/G/1 queuing system. A subsequent chapter covers networks of queues including the presentation of a recent and clear topological explanation for the existence of the product form solution. The final chapters explain techniques for numerical solutions, such as the convolution algorithm and mean-value analysis; discuss the PANACEA technique, discrete time queueing systems and simulation; and describe the new area of stochastic Petri networks. Case studies of distributed queueing networks arising in industrial applications are included. An appendix reviews probability theory. The second edition is thoroughly revised and brought up to date. It includes new material on the MVA algorithm, discrete time queues, queues with negative customers and Petri networks. The second edition also contains more than twice as many student homework problems as the first edition.