Queueing Systems, Volume 2: Computer Applications

Queueing Systems Volume 1: Theory Leonard Kleinrock This book presents and develops methods from queueing theory in sufficient depth so that students and professionals may apply these methods to many modern engineering problems, as well as conduct creative research in the field. It provides a long–needed alternative both to highly mathematical texts and to those which are simplistic or limited in approach. Written in mathematical language, it avoids the "theorem–proof" technique: instead, it guides the reader through a step–by–step, intuitively motivated yet precise development leading to a natural discovery of results. Queueing Systems, Volume I covers material ranging from a refresher on transform and probability theory through the treatment of advanced queueing systems. It is divided into four sections: 1) preliminaries; 2) elementary queueing theory; 3) intermediate queueing theory; and 4) advanced material. Important features of Queueing Systems, Volume 1: Theory include–
∗ techniques of duality, collective marks
∗ queueing networks
∗ complete appendix on z–transforms and Laplace transforms
∗ an entire appendix on probability theory, providing the notation and main results needed throughout the text
∗ definition and use of a new and convenient graphical notation for describing the arrival and departure of customers to a queueing system
∗ a Venn diagram classification of many common stochastic processes
1975 (0 471–49110–1) 417 pp. Fundamentals of Queueing Theory Second Edition Donald Gross and Carl M. Harris This graduated, meticulous look at queueing fundamentals developed from the authors′ lecture notes presents all aspects of the methodology–including Simple Markovian birth–death queueing models; advanced Markovian models; networks, series, and cyclic queues; models with general arrival or service patterns; bounds, approximations, and n umerical techniques; and simulation–in a style suitable to courses of study of widely varying depth and duration. This Second Edition features new expansions and abridgements which enhance pedagogical use: new material on numerical solution techniques for both steady–state and transient solutions; changes in simulation language and new results in statistical analysis; and more. Complete with a solutions manual, here is a comprehensive, rigorous introduction to the basics of the discipline. 1985 (0 471–89067–7) 640 pp.

Spis treści:
A Queueing Theory Primer.
Bounds.
Inequalities and Approximations.
Priority Queueing.
Computer Time–Sharing and Multiaccess Systems.
Computer–Communication Networks: Analysis and Design.
Computer–Communication Networks: Measurement, Flow Control, and ARPANET Traps.

Nota biograficzna:
LEONARD KLEINROCK is Professor of Computer Science at the University of California, Los Angeles. He received his Ph.D. in Electrical Engineering from Massachusetts institute of Technology. He has been at the Lincoln Laboratory, M.I.T., and has lectured extensively throughout the world. He serves as consultant for many domestic and foreign corporations and governments. He is the author of Communication Nets: Stochastic Message Flow and Delay, has published over 70 articles, and has contributed to several books in his field. He is a Guggenheim Fellow and an IEEE Fellow. At UCLA, he directed a large group in advanced teleprocessing systems and computer network research.

Okładka tylna:
Queueing Systems Volume 1: Theory Leonard Kleinrock This book presents and develops methods from queueing theory in sufficient depth so that students and professionals may apply these methods to many modern engineering problems, as well as conduct creative research in the field. It provides a long–needed alternative both to highly mathematical texts and to those which are simplistic or limited in approach. Written in mathematical language, it avoids the "theorem–proof" technique: instead, it guides the reader through a step–by–step, intuitively motivated yet precise development leading to a natural discovery of results. Queueing Systems, Volume I covers material ranging from a refresher on transform and probability theory through the treatment of advanced queueing systems. It is divided into four sections: 1) preliminaries; 2) elementary queueing theory; 3) intermediate queueing theory; and 4) advanced material. Important features of Queueing Systems, Volume 1: Theory include–
∗ techniques of duality, collective marks
∗ queueing networks
∗ complete appendix on z–transforms and Laplace transforms
∗ an entire appendix on probability theory, providing the notation and main results needed throughout the text
∗ definition and use of a new and convenient graphical notation for describing the arrival and departure of customers to a queueing system
∗ a Venn diagram classification of many common stochastic processes
1975 (0 471–49110–1) 417 pp. Fundamentals of Queueing Theory Second Edition Donald Gross and Carl M. Harris This graduated, meticulous look at queueing fundamentals developed from the authors′ lecture notes presents all aspects of the methodology–including Simple Markovian birth–death queueing models; advanced Markovian models; networks, series, and cyclic queues; models with general arrival or service patterns; bounds, approximations, and numerical techniques; and simulation–in a style suitable to courses of study of widely varying depth and duration. This Second Edition features new expansions and abridgements which enhance pedagogical use: new material on numerical solution techniques for both steady–state and transient solutions; changes in simulation language and new results in stat istical analysis; and more. Complete with a solutions manual, here is a comprehensive, rigorous introduction to the basics of the discipline. 1985 (0 471–89067–7) 640 pp.