A generic approach to make structured peer-to-peer systems topology-aware

Authors:
Tongqing Qiu;Fan Wu;Guihai Chen
Affiliations:
State Key Laboratory of Novel Software Technology, Nanjing University, China;State Key Laboratory of Novel Software Technology, Nanjing University, China;State Key Laboratory of Novel Software Technology, Nanjing University, China
Venue:
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Year:
2005

Citing 7
Cited 2

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
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Routing Algorithms for DHTs: Some Open Questions

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
Building Topology-Aware Overlays Using Global Soft-State

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Random Landmarking in Mobile, Topology-Aware Peer-to-Peer Networks

FTDCS '04 Proceedings of the 10th IEEE International Workshop on Future Trends of Distributed Computing Systems
How to model an internetwork

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2

Peer-exchange schemes to handle mismatch in peer-to-peer systems

The Journal of Supercomputing
Exploiting the heterogeneity in structured peer-to-peer systems

GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the help of distributed hash tables, the structured peer-to-peer system has a short routing path and good extensibility. However, the mismatch between the overlay and physical network is the barrier to build an effective peer-to-peer system in the large-scale environment. In this paper, we propose a generic approach to solve this problem, which is quite different from other protocol-dependent methods. We reserve the structure of system and break the coupling between the node and its identifier by swap operations. We also propose several policies to reduce the traffic overhead. The policies include adaptive probing and shadow scheme. The experiment shows that our approach can greatly reduce the average latency of overlay networks and the overhead is controllable.