Introduction to Queueing Networks

The book examines the performance and optimization of systems where queueing and congestion are important constructs. Both finite and infinite queueing systems are examined. Many examples and case studies are utilized to indicate the breadth and depth of the queueing systems and their range of applicability. Blocking of these processes is very important and the book shows how to deal with this problem in an effective way and not only compute the performance measures of throughput, cycle times, and WIP but also to optimize the resources within these systems.

The book is aimed at advanced undergraduate, graduate, and professionals and academics interested in network design, queueing performance models and their optimization. It assumes that the audience is fairly sophisticated in their mathematical understanding, although the explanations of the topics within the book are fairly detailed.

Inhalt
Introduction G(V,E).- Problem Overview (G(V,E)).- Mathematical Models and Properties of Queues G(V).- Transportation and Loss Queues G(E).- Open Queueing Network Algorithms f(G(V,E)).- Closed Queueing Network Performance Models f(G(V,E,N)).- Optimal Resource Allocation Problems (ORAP) G(V) in TND.- Optimal Routing Problems (ORTE) *G(E) in TND.- Optimal Topology Problems (OTOP) G(V,E) in TND.- Final Coda.