SWS: Small World Based Search in Structured Peer-to-Peer Systems

The maintenance of overlay topologies in structured P2P (DHTs) will lead to great message overhead because of the sharp dynamic of the peers. And the DHTs are less usable because the strategy of DHT discards the useful application-specific information. Here we present a usable and easy to maintain search algorithm for structured P2P systems, Small World based Search (SWS). In SWS, the structure of semantic tree is introduced to organize the peers. The semantic distance of two peers is formed according to their relative position in semantic tree. The different distance between two peers will result in different connection probability, which lead to the sense of routing orientation. The mechanisms of "lazily-maintained" and "passively-modified" are used to decrease the overhead of overlay maintenance. The final simulation experiment shows, SWS can improve the usability if given the ontology definition of the semantic tree, and remarkably decrease the cost of the topology maintenance

[1]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[2]  Ben Y. Zhao,et al.  Distributed Object Location in a Dynamic Network , 2004, Theory of Computing Systems.

[3]  Anand Sivasubramaniam,et al.  Semantic small world: an overlay network for peer-to-peer search , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..

[4]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[5]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[6]  Hai Jin,et al.  Semantic Peer-to-Peer Overlay for Efficient Content Locating , 2006, APWeb Workshops.

[7]  Jon M. Kleinberg,et al.  Small-World Phenomena and the Dynamics of Information , 2001, NIPS.

[8]  M E J Newman,et al.  Identity and Search in Social Networks , 2002, Science.

[9]  Chen Daoxu,et al.  Small World Based Adaptive Probabilistic Search (SWAPS) for Unstructured Peer-to-Peer File Systems , 2006 .

[10]  Bruce M. Maggs,et al.  Efficient content location using interest-based locality in peer-to-peer systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[11]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[12]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[13]  Gurmeet Singh Manku,et al.  Symphony: Distributed Hashing in a Small World , 2003, USENIX Symposium on Internet Technologies and Systems.

[14]  Ian T. Foster,et al.  Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations , 2002, IPTPS.

[15]  Bobby Bhattacharjee,et al.  Are Virtualized Overlay Networks Too Much of a Good Thing? , 2002, IPTPS.