Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Query-load balancing in structured overlays Anwitaman Datta
 

Summary: Query-load balancing in structured overlays
Anwitaman Datta
School of Computer Engineering
Nanyang Technological University (NTU, Singapore)
anwitaman@ntu.edu.sg
Roman Schmidt, Karl Aberer
School of Computer and Communication Sciences (I&C)
Ecole Polytechnique F´ed´erale de Lausanne (EPFL, Switzerland)
roman.schmidt@epfl.ch, karl.aberer@epfl.ch
Abstract
Query-load (forwarding and answering) balancing in
structured overlays is one of the most critical and least stud-
ied problems. It has been assumed that caching heuristics
can take care of it. We expose that caching, while neces-
sary, 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: Query-load balancing, Structured overlays

  

Source: Aberer, Karl - Faculté Informatique et Communications, Ecole Polytechnique Fédérale de Lausanne

 

Collections: Computer Technologies and Information Sciences