Fundamentals of queueing networks: performance, asymptotics and optimization by Hong Chen and David D. Yao

International Journal of Stochastic Analysis, Aug 2018

H. M. Srivastava

A PDF file should load here. If you do not see its contents the file may be temporarily unavailable at the journal website or you do not have a PDF plug-in installed and enabled in your browser.

Alternatively, you can download the file locally and open with any standalone PDF reader:

http://downloads.hindawi.com/journals/ijsa/2002/202984.pdf

Fundamentals of queueing networks: performance, asymptotics and optimization by Hong Chen and David D. Yao

Journal of Applied Mathematics and Stochastic Analysis FUNDAMENTALS OF QUEUEING NETWORKS: PERFORMANCE, ASYMPTOTICS AND OPTIMIZATION by Hong Chen and David D. Yao A BOOK REVIEW 0 1 H.M. SRIVASTAVA 0 1 0 Department of Mathematics and Statistics Victoria , British Columbia V8W 3P4 , Canada 1 University of Victoria This book has stemmed essentially from the lecture notes which were accumulated over many years of teaching of graduate-level courses on stochastic networks by the authors at the University of British Columbia (Vancouver, Canada) and Columbia University (New York, USA), respectively. Its main objective is to collect, in one single volume, the essentials of stochastic networks, right from the classical product-form theory to such more recent developments as diffusion and fluid limits, stochastic comparisons, stability, control (dynamic scheduling), and optimization. The book consists of three parts. The first part, Chapters 1 through 4, covers (continuoustime) Markov-chain models, including the classical Jackson and Kelly networks, the notion of quasi-reversible queues, and stochastic comparisons. The second part, Chapters 5 through 10, focuses on Brownian models, including limit theorems for generalized Jackson networks and multiclass feedforward networks, an in-depth examination of stability in a KumarSeidman network, and Brownian approximations for general multiclass networks with a mixture of priority and first-in-first-out disciplines. The third part, Chapters 11 and 12, discusses scheduling in both queueing (stochastic) and fluid (deterministic) networks, along with topics such as conservation laws, polymatroid optimization, and linear programming. Although as remarked by the authors themselves, the selection of materials for this book inevitably is a reflection upon their own bias and preference, the book under review is also driven largely by their desire to provide a graduate-level text, that is well balanced in breadth and depth, suitable for the classroom. In light of the wide-ranging applications of stochastic networks in recent years, from supply chains to telecommunications, this book is intended also to serve as a useful reference for teachers, researchers, and students alike in many of these diverse fields. Advances in ns Research Hindawi Publishing Corporation ht p:/ www.hindawi.com Advances in Journal of bability and Statistics Hindawi Publishing Corporation ht p:/ www.hindawi.com Hindawi Publishing Corporation ht p:/ www.hindawi.com The Scientiifc World Journal Hindawi Publishing Corporation ht p:/ www.hindawi.com Combinatorics Hindawi Publishing Corporation ht p:/ www.hindawi.com Submit your manuscr ipts http://www.hindawi.com Differential Equatio Journal of Complex Analysis Hindawi Publishing Corporation ht p:/ www.hindawi.com Journal of Mathematics Hindawi Publishing Corporation ht p:/ www.hindawi.com En Hindawi Publishing Corporation ht p:/ www.hindawi.com Sciences Journal of Discrete Mathematics ht p:/ w w.hindawi.com Journal of Function Spaces Journal of


This is a preview of a remote PDF: http://downloads.hindawi.com/journals/ijsa/2002/202984.pdf

H. M. Srivastava. Fundamentals of queueing networks: performance, asymptotics and optimization by Hong Chen and David D. Yao, International Journal of Stochastic Analysis, DOI: 10.1155/S104895330200031X