On Computing an Optimal Semi-matching

Galčík, František; Katrenič, Ján; Semanišin, Gabriel

doi:10.1007/s00453-016-0182-3

Cited by 2 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A different line of work studies load balancing in client-server networks: here, servers communicate with the clients, in order to assign clients to servers in a balanced way. While the scenario in our work is modeled by an arbitrary communication network, load balancing in client-server networks is modeled using bipartite graphs, and admits very different algorithmic results, both in the centralized setting [9,19,22,25,28] and in the distributed setting [1,8,12,24].…”

Section: Related Workmentioning

confidence: 99%

On the Complexity of Load Balancing in Dynamic Networks

Gilbert¹,

Meir²,

Paz³

et al. 2021

Preprint

View full text Add to dashboard Cite

In the load balancing problem, each node in a network is assigned a load, and the goal is to equally distribute the loads among the nodes, by preforming local load exchanges. While load balancing was extensively studied in static networks, only recently a load balancing algorithm for dynamic networks with a bounded convergence time was presented. In this paper, we further study the time complexity of load balancing in the context of dynamic networks.First, we show that randomness is not necessary, and present a deterministic algorithm which slightly improves the running time of the previous algorithm, at the price of not being matching-based. Then, we consider integral loads, i.e., loads that cannot be split indefinitely, and prove that no matching-based algorithm can have a bounded convergence time for this case.To circumvent both this impossibility result, and a known one for the non-integral case, we apply the method of smoothed analysis, where random perturbations are made over the worst-case choices of network topologies. We show both impossibility results do not hold under this kind of analysis, suggesting that load-balancing in real world systems might be faster than the lower bounds suggest.

show abstract