Many efforts have been made to model small world phenomenon. Kleinberg’s recent research models the construction of small world in a grid and shows the possibility to build an efficient search network with a distributed algorithm. However, it needs to use the global information to form the small world structure, which is unpractical for large-scale and dynamic topologies such as the peer-to-peer systems. In this paper, a novel approach is proposed to form the small world structure with only local information. This approach is proved both in theory and simulation. The experimental results show it is more nature and scalable, and can be applied to effectively improve the performance of a class of structured P2P systems.
[1]
Gurmeet Singh Manku,et al.
Routing networks for distributed hash tables
,
2003,
PODC '03.
[2]
Moni Naor,et al.
Viceroy: a scalable and dynamic emulation of the butterfly
,
2002,
PODC '02.
[3]
Jon M. Kleinberg,et al.
The small-world phenomenon: an algorithmic perspective
,
2000,
STOC '00.
[4]
Mark Handley,et al.
A scalable content-addressable network
,
2001,
SIGCOMM 2001.