Aurelia: building locality-preserving overlay network over heterogeneous P2P environments

Authors:
Di Wu;Ye Tian;Kam-Wing Ng
Affiliations:
Department of Computer Science & Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong;Department of Computer Science & Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong;Department of Computer Science & Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong
Venue:
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Year:
2005

Citing 8
Cited 0

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
MAAN: A Multi-Attribute Addressable Network for Grid Information Services

GRID '03 Proceedings of the 4th International Workshop on Grid Computing
Brief announcement: prefix hash tree

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Enabling Flexible Queries with Guarantees in P2P Systems

IEEE Internet Computing
Measurement and analysis of internet content delivery systems

Measurement and analysis of internet content delivery systems
SkipNet: a scalable overlay network with practical locality properties

USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
SmartBoa: constructing p2p overlay network in the heterogeneous internet using irregular routing tables

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditional DHT-based overlays destroy data locality and make it hard to support complex queries (e.g., range query, similarity query, etc) in P2P systems. Additionally, the node heterogeneity is widely ignored in most existing overlay designs. In this paper, we propose a locality-preserving overlay design, called Aurelia, which can adapt to the heterogeneous P2P environment and exploit node heterogeneity to realize efficient routing and robust indexing. Aurelia preserves the data locality by abandoning the use of hashing for data placement and each peer is responsible for a continuous range of value. In Aurelia, the routing table size and index range are proportional to the node capacity, and multicasting is adopted for scalable routing table maintenance.