DocumentCode
2663065
Title
Query-load balancing in structured overlays
Author
Datta, Anwitaman ; Schmidt, Roman ; Aberer, Karl
Author_Institution
Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore
fYear
2007
fDate
14-17 May 2007
Firstpage
453
Lastpage
460
Abstract
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.
Keywords
cache storage; fault tolerance; peer-to-peer computing; query processing; resource allocation; telecommunication network routing; cache heuristics; fault-tolerance; load-aware variant; peer-to-peer computing; query-load balancing; standard greedy routing; structured overlay; Fault tolerance; Frequency; Grid computing; Internet; Partitioning algorithms; Redundancy; Robustness; Routing; Topology; Wide area networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Cluster Computing and the Grid, 2007. CCGRID 2007. Seventh IEEE International Symposium on
Conference_Location
Rio De Janeiro
Print_ISBN
0-7695-2833-3
Type
conf
DOI
10.1109/CCGRID.2007.90
Filename
4215411
Link To Document