Query-load balancing in structured overlays

Query-load (forwarding and answering) balancing in structured overlays is one of the most critical and least studied problems. It has been assumed that caching heuristics can take care of it. We expose that caching, while necessary, is not in itself sufficient. We then provide simple and effective load-aware variants of the standard greedy routing used in overlays exploiting routing redundancy (originally needed for fault- tolerance) to achieve very good query load-balancing.


Published in:
Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGRID'07)
Presented at:
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGRID'07), Rio de Janeiro, Brazil, May 14-17, 2007
Year:
2007
Keywords:
Laboratories:




 Record created 2007-02-09, last modified 2018-03-17

n/a:
Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)