Adding structure to unstructured peer-to-peer networks: the use of small-world graphs

  • Authors:

  • Shashidhar Merugu;Sridhar Srinivasan;Ellen Zegura

  • Affiliations:

  • College of Computing, Georgia Institute of Technology, 801 Atlantic Drive, Atlanta, GA 30332, USA;College of Computing, Georgia Institute of Technology, 801 Atlantic Drive, Atlanta, GA 30332, USA;College of Computing, Georgia Institute of Technology, 801 Atlantic Drive, Atlanta, GA 30332, USA

  • Venue:
  • Journal of Parallel and Distributed Computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The ''small-world'' graph structure is pervasive and is observed to arise ''without-design'' or ''naturally'' in many practical systems such as the World Wide Web. In contrast to natural systems, overlay networks provide an opportunity to design structure. We seek the advantages of designing overlay topologies with small-world properties to support file sharing in peer-to-peer networks. We focus on two metrics of performance: (a) search protocol performance, a local gain perceived directly by peer-to-peer network users and (b) network utilization, a global property that is of interest to network service providers. We propose a class of overlay topologies and show, by simulation, that a particular topology instance of this class where every node has many close neighbors and few random neighbors (i.e., a small-world graph) exhibits very good properties. In this overlay topology, the chances of locating files are high, and the nodes where these files are found are, on average, close to the query source. This improvement in search protocol performance is achieved while decreasing the traffic load on the links in the underlying network. We propose a simple greedy algorithm to construct such overlay topologies where each node operates independently and in a decentralized manner to select its neighbors.