Distributed algorithms for QoS load balancing

DOI10.1007/S00446-010-0125-1zbMath1231.68062OpenAlexW2090026441MaRDI QIDQ658665

Martin Hoefer, Heiner Ackermann, Marcel Schöngens, Simon Fischer

Publication date: 6 February 2012

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-010-0125-1

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (2)

Concurrent imitation dynamics in congestion games ⋮ Distributed algorithms for QoS load balancing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Worst-case equilibria
• Distributed algorithms for QoS load balancing
• Atomic congestion games: fast, myopic and concurrent
• Distributed Selfish Load Balancing
• Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks
• Convergence time to Nash equilibrium in load balancing
• Hitting-time and occupation-time bounds implied by drift analysis with applications
• The capacity of wireless networks
• Load balancing without regret in the bulletin board model
• Concurrent imitation dynamics in congestion games
• Discrete load balancing is (almost) as easy as continuous load balancing
• Distributing Unit Size Workload Packages in Heterogeneous Networks
• Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game

This page was built for publication: Distributed algorithms for QoS load balancing