Scheduling and Control of Queueing Networks
$115.00 (C)
Part of Institute of Mathematical Statistics Textbooks
- Author: Gideon Weiss, University of Haifa, Israel
- Date Published: October 2021
- availability: Available
- format: Hardback
- isbn: 9781108415323
$
115.00
(C)
Hardback
Other available formats:
Paperback, eBook
Looking for an examination copy?
If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact [email protected] providing details of the course you are teaching.
-
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.
Read more- 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
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: October 2021
- format: Hardback
- isbn: 9781108415323
- length: 200 pages
- dimensions: 235 x 158 x 30 mm
- weight: 0.8kg
- 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.-
Resources for
Scheduling and Control of Queueing Networks
Gideon Weiss
General Resources
Find resources associated with this title
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 instructors whose faculty status has been verified. To gain access to locked resources, instructors 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 instructors 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. Instructors 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 [email protected].
Related Books
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×