Reducing Maintenance Overhead in DHT Based Peer-to-Peer Algorithms

Authors:
Zhiyong Xu;Rui Min;Yiming Hu
Affiliations:
-;-;-
Venue:
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Year:
2003

Citing 0
Cited 3

Chord2: A two-layer Chord for reducing maintenance overhead via heterogeneity

Computer Networks: The International Journal of Computer and Telecommunications Networking
Stealth distributed hash table: a robust and flexible super-peered DHT

CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Dynamic nodeID based heterogeneity aware p2p system

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

DHT based Peer-to-Peer (P2P) algorithms are very promising for their efficient routing performance. However, most commercial P2P systems donot adapt DHT algorithms and still use central facilities or broadcasting based routing mechanisms. One reason impeding the DHT algorithm popularity is the routing information maintenance overhead in DHT algorithms, it generates considerable network traffic and increases P2P system complexity, especially in a highly dynamic environment. In this paper, we discuss its effects on DHT routing performance and propose our solution to reduce this overhead.