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

Full description

Saved in:

Bibliographic Details
Published in:	SIAM journal on computing Vol. 37; no. 4; pp. 1259 - 1279
Main Authors:	Awerbuch, Baruch, Hajiaghayi, Mohammad T., Kleinberg, Robert, Leighton, Tom
Format:	Journal Article
Language:	English
Published:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2007
Subjects:	Algorithms Applied mathematics Competition Computer science Decision making Laboratories Scholarships & fellowships Servers
ISSN:	0097-5397, 1095-7111
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!