Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

CCGRID
2007
IEEE

favoriteEmaildiscussreport

92views Distributed And Parallel Com...» more CCGRID 2007»

Query-load balancing in structured overlays

13 years 10 months ago

Query-load balancing in structured overlays

Download lsirpeople.epfl.ch

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 sufﬁcient. 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.

Anwitaman Datta, Roman Schmidt, Karl Aberer

Real-time Traffic

CCGRID 2007 | Cluster Computing | Effective Load-aware Variants | Standard Greedy Routing | Structured Overlays |

claim paper

Related Content

» SRing a structured non dht p2p overlay supporting string range queries

» Range Queries in TrieStructured Overlays

» Storage Management and Caching in PAST A Largescale Persistent Peertopeer Storage Utility

» Range queries and load balancing in a hierarchically structured P2P system

» Exploiting the Heterogeneity in Structured PeertoPeer Systems

» HRing A Structured P2P Overlay Based on Harmonic Series

» Distributed Hashtable on Prestructured Overlay Networks

» Efficient Skyline Query Processing on PeertoPeer Networks

» SOMO SelfOrganized Metadata Overlay for Resource Management in P2P DHT

Post Info
More Details (n/a)

Added	02 Jun 2010
Updated	02 Jun 2010
Type	Conference
Year	2007
Where	CCGRID
Authors	Anwitaman Datta, Roman Schmidt, Karl Aberer

Comments (0)