Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Online Client-Server Load Balancing Without Global Information Baruch Awerbuch
 

Summary: Online Client-Server Load Balancing Without Global Information
Baruch Awerbuch
Mohammad T. Hajiaghayi
Robert D. Kleinberg§
Tom Leighton
Abstract
We consider distributed online algorithms for maximizing through-
put in a network of clients and servers, modeled as a bipartite graph.
Unlike most prior work on online load balancing, we do not as-
sume centralized control and seek algorithms and lower bounds for
decentralized algorithms in which each participant has only local
knowledge about the state of itself and its neighbors. Our prob-
lem can be seen as analogous to the recent work on oblivious rout-
ing in [8, 14, 19], but with the objective of maximizing through-
put rather than minimizing congestion. In contrast to that work,
we prove a strong lower bound (polynomial in n, the size of the
graph) on the competitive ratio of any oblivious algorithm. This is
accompanied by simple algorithms achieving upper bounds which
are tight in terms of k, the maximum throughput achievable by an
omniscient algorithm. Finally, we examine a restricted model in

  

Source: Awerbuch, Baruch - Department of Computer Science, Johns Hopkins University

 

Collections: Computer Technologies and Information Sciences