Query-load balancing in structured overlays

Authors:
Anwitaman Datta;Roman Schmidt;Karl Aberer
Affiliations:
Nanyang Technological University;Ecole Polytechnique Federale de Lausanne (EPFL, Switzerland);Ecole Polytechnique Federale de Lausanne (EPFL, Switzerland)
Venue:
CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
Year:
2007

Citing 0
Cited 5

Community-driven data grids

Proceedings of the VLDB Endowment
Fair load balancing under skewed popularity patterns in heterogeneous DHT-based P2P systems

PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Frequency-aware reconstruction of forwarding tables in name-based routing

Proceedings of the 5th International Conference on Future Internet Technologies
A dynamic load balancing strategy with the push and pull approaches in DHT networks

Computers and Electrical Engineering
A dynamic load balancing scheme with incentive mechanism in heterogeneous structured P2P networks

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

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