Designing Low-Complexity Heavy-Traffic Delay-Optimal Load Balancing Schemes
نویسندگان
چکیده
منابع مشابه
Optimal and Alternating-Direction Load Balancing Schemes
We discuss iterative nearest neighbor load balancing schemes on processor networks which are represented by a cartesian product of graphs like e.g. tori or hypercubes. By the use of the Alternating-Direction Loadbalancing scheme, the number of load balance iterations decreases by a factor of 2 for this type of graphs. The resulting ow is analyzed theoretically and it can be very high for certai...
متن کاملTraffic Load Balancing in Low Earth Orbit Satellite Networks
One of the unique traffic features of low earth orbit (LEO) satellite networks is time-variant and nonuniform load distribution. This feature results in a locally biased congestion problem for the LEO satellite systems. In this paper, we propose a traJjcic load balancing scheme to resolve the congestion problem in such traffic scenarios. The proposing scheme makes use of near-neighbor residual ...
متن کاملLocally Optimal Load Balancing
This work studies distributed algorithms for locally optimal load-balancing : We are given a graph of maximum degree ∆, and each node has up to L units of load. The task is to distribute the load more evenly so that the loads of adjacent nodes differ by at most 1. If the graph is a path (∆ = 2), it is easy to solve the fractional version of the problem in O(L) communication rounds, independentl...
متن کاملOptimal Load-Balancing (Infocom 2005)
This paper is about load-balancing packets across multiple paths inside a switch, or across a network. It is motivated by the recent interest in load-balanced switches. Load-balanced switches provide an appealing alternative to crossbars with centralized schedulers. A load-balanced switch has no scheduler, is particularly amenable to optics, and – most relevant here – guarantees 100% throughput...
متن کاملTowards Optimal Load Balancing Topologies
Many load balancing algorithms balance the load according to a topology. Its choice can significantly influence the performance of the algorithm. We consider the two phase balancing model. The first phase calculates a balancing flow with respect to this topology by a diffusion scheme. Its time requirement depends on the maximum node degree and on the number of eigenvalues of the network. The se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2019
ISSN: 0163-5999
DOI: 10.1145/3292040.3219670