Localized Client-Server Load Balancing without Global Information

We consider distributed algorithms for maximizing throughput in a network of clients and servers, modeled as a bipartite graph. We 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 problem...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on computing Jg. 37; H. 4; S. 1259 - 1279
Hauptverfasser:	Awerbuch, Baruch, Hajiaghayi, Mohammad T., Kleinberg, Robert, Leighton, Tom
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2007
Schlagworte:	Algorithms Applied mathematics Competition Computer science Decision making Laboratories Scholarships & fellowships Servers
ISSN:	0097-5397, 1095-7111
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!