Small-World Peer-to-Peer for Resource Discovery

  • Lu Liu
  • Nick Antonopoulos
  • Stephen Mackin
Conference paper

DOI: 10.1007/978-3-540-89524-4_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5200)
Cite this paper as:
Liu L., Antonopoulos N., Mackin S. (2008) Small-World Peer-to-Peer for Resource Discovery. In: Vazão T., Freire M.M., Chong I. (eds) Information Networking. Towards Ubiquitous Networking and Services. ICOIN 2007. Lecture Notes in Computer Science, vol 5200. Springer, Berlin, Heidelberg


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.


Peer-to-peer Small World Information Search 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Lu Liu
    • 1
  • Nick Antonopoulos
    • 2
  • Stephen Mackin
    • 3
  1. 1.Surrey Space CentreUniversity of SurreySurreyU.K.
  2. 2.Computing DepartmentUniversity of SurreySurreyU.K.
  3. 3.Surrey Satellite Technology LimitedSurrey Research ParkSurreyU.K.

Personalised recommendations