Using the linking model to understand the performance of DHT routing algorithms

Authors:
Futai Zou;Shudong Cheng;Fanyuan Ma;Liang Zhang;Junjun Tang
Affiliations:
Department of Computer Science and Engineering Shanghai Jiao Tong University, Shanghai, China;Department of Computer Science and Engineering Shanghai Jiao Tong University, Shanghai, China;Department of Computer Science and Engineering Shanghai Jiao Tong University, Shanghai, China;Department of Computer Science and Engineering Shanghai Jiao Tong University, Shanghai, China;Department of Computer Science and Engineering Shanghai Jiao Tong University, Shanghai, China
Venue:
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Year:
2004

Citing 4
Cited 1

Randomized algorithms

Randomized algorithms
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
The Small-World Phenomenon: An Algorithmic Perspective

The Small-World Phenomenon: An Algorithmic Perspective

Implementing a graph neuron array for pattern recognition within unstructured wireless sensor networks

EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The various proposed DHT routing algorithms embody different underlying routing geometries such as ring, hypercube etc. The routing performance depends on the geometry. In this paper, we anatomize the construction of the geometry and propose the linking model for the geometry to understand the performance of DHT routing algorithms. The effect of the different types of links on the performance is analyzed. Especially, randomized long link is considered as a new approach to optimize the performance. Our experiments show that the routing performance is greatly affected by the links, and the performance of CAN is improved with additional links.