Designing Low-Complexity Heavy-Traffic Delay-Optimal Load Balancing Schemes
Lists
Only you see this
Abstract
We establish a unified analytical framework for designing load balancing algorithms that can simultaneously achieve low latency, low complexity, and low communication overhead. We first propose a general class ¶ of load balancing policies and prove that they are both throughput optimal and heavy-traffic delay optimal. This class ¶ includes popular policies such as join-shortest-queue (JSQ) and power-of- d as special cases, but not the recently proposed join-idle-queue (JIQ) policy. In fact, we show that JIQ is not heavy-traffic delay optimal even for homogeneous servers. By exploiting the flexibility offered by the class ¶, we design a new load balancing policy called join-below-threshold (JBT-d), in which the arrival jobs are preferentially assigned to queues that are no greater than a threshold, and the threshold is updated infrequently. JBT-d has several benefits: (i) JBT-d belongs to the class ¶i and hence is throughput optimal and heavy-traffic delay optimal. (ii) JBT-d has zero dispatching delay, like JIQ and other pull-based policies, and low message overhead due to infrequent threshold updates. (iii) Extensive simulations show that JBT-d has good delay performance, comparable to the JSQ policy in various system settings.
BibTeX
@article{zhou2019designing,
author = {Xingyu Zhou and Fei Wu and Jian Tan and Yin Sun and Ness B. Shroff},
title = {{Designing Low-Complexity Heavy-Traffic Delay-Optimal Load Balancing Schemes}},
journal = {ACM SIGMETRICS Performance Evaluation Review},
year = {2019},
doi = {10.1145/3308809.3308875},
}Loading related content...