Paper Info
Title
Hieras: A Dht Based Hierarchical P2p Routing Algorithm
Abstract
Routing algorithm has great influence on system overall performance in Peer-to-Peer (P2P) applications. In current DHT based routing algorithms, routing tasks are distributed across all system peers. However a routing hop could happen between two widely separated peers with high network link latency which greatly increases system routing overheads.In this paper we propose a new P2P routing algorithm - HIERAS to relieve this problem, it keeps scalability properly of current DHT algorithms and improves system routing performance by the introduction of hierarchical structure. In HIERAS, we create several lower level P2P rings besides the highest level P2P ring. A P2P ring is a subset of the overall P2P overlay network We create P2P rings in such a strategy that the average link latency between two peers in lower level rings is much smaller than higher level rings. Routing tasks are first executed in lower level rings before they go up to higher level rings, a large portion of routing hops previously executed in the global P2P ring are now replaced by hops in lower level rings, thus routing overheads can be reduced. The simulation results show HIERAS routing algorithm can significantly improve P2P system routing performance.
Year
DOI
Venue
2003
10.1109/ICPP.2003.1240580
2003 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, PROCEEDINGS
Keywords
Field
DocType
distributed algorithms,p2p,overlay network,distributed hash table
Link-state routing protocol,Equal-cost multi-path routing,Multipath routing,Dynamic Source Routing,Static routing,Computer science,Hierarchical routing,Destination-Sequenced Distance Vector routing,Computer network,Distributed computing,Zone Routing Protocol
Conference
Citations 
PageRank 
References 
54
2.28
12
Authors
3
Name
Order
Citations
PageRank
Zhiyong Xu1955.52
Rui Min21477.01
Yiming Hu363944.91