## Decentralized algorithms using both local and random probes for p2p load balancing (2005)

### Cached

### Download Links

- [theory.stanford.edu]
- [www-db.stanford.edu]
- [infolab.stanford.edu]
- [www.ic.unicamp.br]
- DBLP

### Other Repositories/Bibliography

Venue: | In Seventeenth ACM Symposium on Parallelism in Algorithms and Architectures (SPAA |

Citations: | 11 - 0 self |

### BibTeX

@INPROCEEDINGS{Kenthapadi05decentralizedalgorithms,

author = {Krishnaram Kenthapadi and Gurmeet Singh Manku},

title = {Decentralized algorithms using both local and random probes for p2p load balancing},

booktitle = {In Seventeenth ACM Symposium on Parallelism in Algorithms and Architectures (SPAA},

year = {2005},

pages = {135--144}

}

### OpenURL

### Abstract

We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (which is oblivious of its index in the sequence) choose its position on the circle by learning the positions of as few existing nodes as possible. At the same time, we desire that that the variation in arc-lengths be small. To this end, we propose a new algorithm that works as follows: The k th node chooses r random points on the circle, inspects the sizes of v arcs in the vicinity of each random point, and places itself at the mid-point of the largest arc encountered. We show that for any combination of r and v satisfying rv ≥ c log k, where c is a small constant, the ratio of the largest to the smallest arc-length is at most eight w.h.p., for an arbitrarily long