Library of Math
New and Used Math Books at Great Low Prices
Subscribe to the Library of Math Feed

Analysis of Queueing Networks with Blocking (International Series in Operations Research and Management Science Volume 31) (International Series in Operations Research & Management Science)

Analysis of Queueing Networks with Blocking (International Series in Operations Research and Management Science Volume 31) (International Series in Operations Research & Management Science)

enlarge enlarge 
Authors: Simonetta Balsamo, Vittoria De Nitto Persone, Raif Onvural
Publisher: Springer
Category: EBooks

List Price: $168.00
Buy New: $134.40
You Save: $33.60 (20%)

Buy

Sales Rank: 84339

Format: Kindle Book
Media: Kindle Edition
Edition: 1
Pages: 272
Number Of Items: 1

Dewey Decimal Number: 658.4034

Publication Date: November 30, 2000
Availability: Usually ships in 24 hours

Editorial Reviews:

Product Description
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.

 
about us contact us privacy policy terms of use mision statement lom help
The Library of Math - Online Math Organized by Subject Into Topics. © 2005 - 2009 www.LibraryOfMath.com All rights reserved. math rss