Cited By
View all- Hyytia ERighter R(2020)STAR and RATS: Multi-level Dispatching Policies2020 32nd International Teletraffic Congress (ITC 32)10.1109/ITC3249928.2020.00018(81-89)Online publication date: Sep-2020
The power of partial power of two choices
Pages 46 - 48
Abstract
It is well known that the expected waiting time for customers routed to several parallel queues decreases dramatically when customers are routed to the shortest of two randomly chosen queues, rather than being arbitrarily assigned to one of the queues, and that the further improvement when there are three queues to choose from is much less than the improvement when moving from one to two queues (the power of two [5]). We consider the power of two effect when a subset of customers are flexible, and can choose the shortest of two queues, while the remainder are dedicated, and have no routing choice. We show that the stationary expected waiting time is decreasing and convex in the proportion of flexible customers. Our results show that having a small proportion of flexible customers has nearly as much benefit as having full power of two choices.
References
[1]
O. T. Akgun, R. Righter, and R. Wolff. Multiple server system with flexible arrivals. Adv. Appl. Probab., to appear.
[2]
O. T. Akgun, R. Righter, and R. Wolff. Understanding the marginal impact of customer flexibility. Queueing Syst., to appear.
[3]
D. J. Daley and T. Rolski. Finiteness of waiting-time moments in general stationary single server queues. Ann. Appl. Probab., 2:987--1008, 1992.
[4]
Y. T. He and D. Down. On accommodating customer flexibility in service systems. INFOR., 47:289--295, 2009.
[5]
M. Mitzenmacher. The power of two choices in randomized load balancing. IEEE Trans. Parallel and Distrib. Syst., 12:1094--1104, 2001.
Index Terms
- The power of partial power of two choices
Recommendations
Understanding the marginal impact of customer flexibility
We study the marginal impact of customer flexibility in service systems. We consider a queueing system with multiple parallel servers, in which a proportion of customers are flexible and can go to any server, while the remainder require service at a ...
Insensitivity for PS server farms with JSQ routing
Join-the-Shortest-Queue (JSQ) is a very old and popular routing policy for server farms. Figure 1 shows two examples of server farm architectures employing JSQ routing. In both cases, each incoming job is immediately dispatched, via a front-end router, ...
The Power of Two Choices in Randomized Load Balancing
We consider the following natural model: Customers arrive as a Poisson stream of rate \lambda n, \lambda < 1, at a collection of n servers. Each customer chooses some constant d servers independently and uniformly at random from the n servers and waits ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 2011 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 21 December 2011
Published in SIGMETRICS Volume 39, Issue 3
Check for updates
Author Tags
Qualifiers
- Short-paper
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 69Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Reflects downloads up to 12 Nov 2024
Other Metrics
Citations
Cited By
View all- Hyytia ERighter R(2020)STAR and RATS: Multi-level Dispatching Policies2020 32nd International Teletraffic Congress (ITC 32)10.1109/ITC3249928.2020.00018(81-89)Online publication date: Sep-2020
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in