Analysis of Queueing Networks with Blocking / Edition 1

by Simonetta Balsamo, Vittoria de Nitto Persone, Raif Onvural

Overview

Queueing network models have been widely applied as a powerful tool for modelling, performance evaluation, and prediction of discrete flow systems, such as computer systems, communication networks, production lines, and manufacturing systems. Queueing network models with finite capacity queues and blocking have been introduced and applied as even more realistic models of systems with finite capacity resources and with population constraints. In recent years, research in this field has grown rapidly. Analysis of Queueing Networks with Blocking introduces queueing network models with finite capacity and various types of blocking mechanisms. It gives a comprehensive definition of the analytical model underlying these blocking queueing networks. It surveys exact and approximate analytical solution methods and algorithms and their relevant properties. It also presents various application examples of queueing networks to model computer systems and communication networks.
This book is organized in three parts. Part I introduces queueing networks with blocking and various application examples. Part II deals with exact and approximate analysis of queueing networks with blocking and the condition under which the various techniques can be applied. Part III presents a review of various properties of networks with blocking, describing several equivalence properties both between networks with and without blocking and between different blocking types. Approximate solution methods for the buffer allocation problem are presented.

Product Details

ISBN-13:	9780792379966
Publisher:	Springer US
Publication date:	11/30/2000
Series:	International Series in Operations Research & Management Science , #31
Edition description:	2001
Pages:	255
Product dimensions:	6.10(w) x 9.25(h) x 0.36(d)

Table of Contents

I Queueing Network Models with Blocking and Applications.- 1. Introduction.- 2. Queueing networks with blocking.- 3. Application examples of queueing networks with blocking.- II Analysis of Queueing Networks with Blocking.- 4. Exact analysis of Markovian networks.- 5. Exact analysis of special networks.- 6. Approximate and bound analysis.- III Properties of Networks with Blocking.- 7. Equivalence, insensitivity and monotonicity properties.- 8. Buffer allocation in queueing networks with finite capacities.- References.- Table of Symbols.

Editorial Reviews

Queuing network models derived from queuing theory are a powerful tool for realistic modeling, performance evaluation, and prediction of systems with capacity and population constraints, e.g., computer systems, communication networks, production lines, and manufacturing systems. With application examples, Part I introduces such networks with blocking. Topics include definitions, the main results and solution techniques to derive performance metrics, and the relation between models with blocking and state dependent routing. Part II treats exact and approximate analysis, and the condition under which various techniques can be applied. The final section reviews network properties, including equivalence properties between networks with and without blocking. Balsamo is based at the U. di. Venezia. Co-editors are with the U. di Roma Tor Vergata, and IBM, respectively. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Booknews