Routing algorithm using skipnet and small-world for peer-to-peer system

Authors:
Xiaoqin Huang;Lin Chen;Linpeng Huang;Minglu Li
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai
Venue:
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Year:
2005

Citing 9
Cited 0

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
Skip graphs

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Skip Lists: A Probabilistic Alternative to Balanced Trees

WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
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
Improving Search in Peer-to-Peer Networks

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
The Small-World Phenomenon: An Algorithmic Perspective

The Small-World Phenomenon: An Algorithmic Perspective
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and

Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
SkipNet: a scalable overlay network with practical locality properties

USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we design a new routing algorithm using SkipNet and Small-World for peer-to-peer system. The algorithm divides the routing space into two layers, SkipNet layer and Small-World layer. In the SkipNet layer, the routing method using numeric ID is discussed. In the Small-World layer, the routing method using small-world theoretical results is discussed. We also consider the dynamic circumstance-the node’s join and departure. The comparison of our algorithm with other algorithms is presented. Our algorithm supports content and path locality, it is very important for security consideration. In our algorithm, a few shortcuts to distant peers are inserted with some probabilities and the average path length is reduced. The preliminary simulation results show that our algorithm is efficient.