From the Publisher
Presents and develops methods from queueing theory in mathematical language and in sufficient depth so that the student may apply the methods to many modern engineering problems and conduct creative research. Step-by-step development of results with careful explanation, and lists of important results make it useful as a handbook and a text.
From the Inside Flap
Queueing Systems Volume 2: Computer Applications By Leonard Kleinrock In the early 60s queueing theory was found to be an effective tool for studying several performance parameters of computer systems. Since then, much of the queueing theory and computer applications literature has included analytical models for computer systems and computer networks. At present, queueing analysis of resource allocation and job flow through computer systems is one of the few tools available to computer scientists who wish to understand the behavior of the complex interconnections of their systems. It is chiefly for these reasons that this second volume of Queueing Systems uses the most recent and successful applications of queueing theory to show how theoretical tools must be modified to describe the reality of physical systems. For students who used the first volume as a textbook on queueing theory, Volume 2 provides the material for a second course on applications. For any professional in information processing and computer systems analysis it will prove to be an indispensable reference, since much of this material has never appeared in book form before. The author has taken particular care to organize the material for the smoothest possible transition from theory to application. Chapter 1 provides a queueing theory primer. For those who have not read the first volume or who have not had a previous course in queueing systems, this primer will be crucial to an adequate understanding of the book. To pass from queueing theory to applied results, Chapter 2 examines bounds, inequalities and approximations to capture the essential behavior of queueing systems, including transient and non-stationary behavior. Chapter 3 lays the groundwork for time-sharing studies by presenting basic notions of priority queueing systems. In Chapter 4, computer-time sharing and multiaccess systems are treated. Particular emphasis is placed on processorsharing algorithms, since they are singularly suited to queueing analysis and pave the way for more difficult and more complex algorithms used in scheduling problems. The new multiple resource models using queueing networks is also presented in Chapter 4. Chapter 5 focuses on the analysis and design of computer-communication networks using previous queueing theory results and additional network flow and optimization tools. A specific network, the Arpanet, is used throughout as an example to guide the reader through motivation and evaluation of the various techniques developed. Also treated are newer packetswitching concepts in satellite and ground radio communications. Chapter 6 continues the study of computer communication networks and focuses on simulation, measurement and Arpanet traps. Queueing Systems, Volume 2: Computer Applications is the second volume of a 2-volume set which constitutes a significant tool for solving many of today's information processing problems. See the back of this jacket for more information about Queueing Systems, Volume 1: Theory.