Small-world peer-to-peer for resource discovery

Abstract

Small-world phenomenon is potentially useful to improve the performance of resource discovery in decentralized peer-to-peer (P2P) networks. The theory of small-world networks can be adopted in the design of P2P networks: each peer node is connected to some neighbouring nodes, and a group of peer nodes keep a small number of long links to randomly chosen distant peer nodes. However, current unstructured search algorithms have difficulty distinguishing among these random long-range shortcuts and efficiently finding a set of proper long-range links located in itself or its local group for a specific resource search. This paper presents a semi-structured P2P model to efficiently create and find long-range shortcuts toward remote peer groups. © 2008 Springer Berlin Heidelberg.