Applications of queueing network models have multiplied in the last generation, including scheduling of large manufacturing systems, control of patient flow in health systems, load balancing in cloud computing, and matching in ride sharing. These problems are too large and complex for exact solution, but their scale allows approximation. This book is the first comprehensive treatment of fluid scaling, diffusion scaling, and many-server scaling in a single text presented at a level suitable for graduate students. Fluid scaling is used to verify stability, in particular treating max weight policies, and to study optimal control of transient queueing networks. Diffusion scaling is used to control systems in balanced heavy traffic, by solving for optimal scheduling, admission control, and routing in Brownian networks. Many-server scaling is studied in the quality and efficiency driven Halfin–Whitt regime and applied to load balancing in the supermarket model and to bipartite matching in ride-sharing applications.
- 80 figures and more than 300 challenging exercises
- Extensive solutions manual for most exercises
- Consolidates current research in the field and an overview of three key approaches in one text
Read more
Customer reviews

Not yet reviewed
Be the first to review

Log in to review

Review was not posted due to profanity
×

, create a review

(If you're not , sign out)

Please enter the right captcha value

Please enter a star rating.

Your review must be a minimum of 12 words.

How do you rate this item?

Reviews must contain at least 12 words about the product.

×

Product details
- Date Published: October 2021
- format: Paperback
- isbn: 9781108401173
- length: 200 pages
- dimensions: 229 x 151 x 22 mm
- weight: 0.65kg
- availability: Available
Table of Contents
Notation
Introduction
Part I. The Single Queue:
1. Queues and their simulations, birth and death queues
2. The M/G/1 queue
3. Scheduling
Part II. Approximations of the Single Queue:
4. The G/G/1 queue
5. The basic probability functional limit theorems
6. Scaling of G/G/1 and G/G/∞
7. Diffusions and Brownian processes
Part III. Queueing Networks:
8. Product form queueing networks
9. Generalized Jackson networks
Part IV. Fluid Models of Multi-Class Queueing Networks:
10. Multi-class queueing networks, instability and Markov representations
11. Stability of MCQN via fluid limits
12. Processing networks and maximum pressure policies
13. Processing networks with infinite virtual queues
14. Optimal control of transient networks
Part V. Diffusion-Scaled Balanced Heavy Traffic:
15. Join the shortest queue in parallel servers
16. Control in balanced heavy traffic
17. MCQN with discretionary routing
Part VI. Many-Server Systems:
18. Infinite servers revisited
19. Asymptotics under Halfin–Whitt regime
20. Many servers with abandonment
21. Load balancing in the supermarket model
22. Parallel servers with skill-based routing
References
Index.
Look Inside

General Resources

Solutions

Find resources associated with this title

Back to resources home

Type	Name	Unlocked *	Format	Size

Showing of

This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers should sign in to or register for a Cambridge user account.

Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other lecturers may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.

Supplementary resources are subject to copyright. Lecturers are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.

If you are having problems accessing these resources please contact lecturers@cambridge.org.

Author
Gideon Weiss, University of Haifa, Israel
Gideon Weiss is Professor Emeritus in the Department of Statistics at the University of Haifa, Israel. He has previously held tenured positions at Tel Aviv University and at Georgia Tech Industrial and Systems Engineering and visiting positions at Berkeley, MIT, Stanford, NYU, and NUS. He is author of some 90 research papers and served on the editorial boards of leading journals on operations research and applied probability. His work includes significant contributions to the fields of time series, stochastic scheduling, bandit problems, fluid analysis of queueing networks, continuous linear programming, and matching problems.

This title is available for institutional purchase via Cambridge Core

Related Books

Processing Networks

Fluid Models and Stability

Reversibility and Stochastic Networks

Stochastic Networks

Modelling of Computer and Communication Systems

related journals

International Journal of Microwave and Wireless Technologies

The prime objective of the International Journal of Microwave and Wireless Technologies is to enhance the communication…

Products and services

About us

Careers

Unlocking potential with the best learning and research solutions

Scheduling and Control of Queueing Networks