Research of routing algorithm in hierarchy-adaptive P2P systems

Authors:
Xiao-Ming Zhang;Yi-Jie Wang;ZhouJun Li
Affiliations:
National Key Laboratory for Parallel and Distributed Processing, Institute of Computer, National University of Defense Technology, Changsha, China;National Key Laboratory for Parallel and Distributed Processing, Institute of Computer, National University of Defense Technology, Changsha, China;School of Computer Science and Engineering, Beihang University, Beijing, China
Venue:
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Year:
2007

Citing 8
Cited 1

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
Brocade: Landmark Routing on Overlay Networks

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems

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
BRITE: An Approach to Universal Topology Generation

MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and

Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
A Robust Protocol for Building Superpeer Overlay Topologies

P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing

Internet-based Virtual Computing Environment: Beyond the data center as a computer

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently superpeers are introduced to improve the performance of P2P systems. A superpeer is a node in a P2P system that operates as a server for a set of clients. By exploiting heterogeneity, the superpeer paradigm allows P2P systems to run more efficiently. This paper proposes a hierarchy-adaptive P2P topology DAHP2P and a hierarchical routing algorithm Hroute. Peers are grouped into clusters according to proximity and super peers form the upperlevel overlay, the number of hierarchy is self-adaptively changed according to the number of nodes in the system, a hierarchical routing algorithm is designed to reduce the routing hops. Simulation results show that Hroute can significantly reduce the expected number of hops and latency of message routing, and loads of peers at different layers are relatively balanceable.