 |


|
 |
Item Details
Title:
|
ANALYSIS OF QUEUEING NETWORKS WITH BLOCKING
|
By: |
Simonetta Balsamo, Vittoria De Nitto Persone, Raif O. Onvural |
Format: |
Paperback |

List price:
|
£129.99 |
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
ISBN 10: |
1441950141 |
ISBN 13: |
9781441950147 |
Publisher: |
SPRINGER-VERLAG NEW YORK INC. |
Pub. date: |
8 December, 2010 |
Edition: |
Softcover reprint of hardcover 1st ed. 2001 |
Series: |
International Series in Operations Research & Management Science 31 |
Pages: |
255 |
Synopsis: |
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. |
Illustrations: |
X, 255 p. |
Publication: |
US |
Imprint: |
Springer-Verlag New York Inc. |
Returns: |
Returnable |
|
|
|
 |


|

|

|

|

|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.

|

|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.

|

|
|
 |