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...

Celý popis

Podrobná bibliografia

Vydané v:	SIAM journal on computing Ročník 37; číslo 4; s. 1259 - 1279
Hlavní autori:	Awerbuch, Baruch, Hajiaghayi, Mohammad T., Kleinberg, Robert, Leighton, Tom
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2007
Predmet:	Algorithms Applied mathematics Competition Computer science Decision making Laboratories Scholarships & fellowships Servers
ISSN:	0097-5397, 1095-7111
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!