Explore the "Small World Phenomena" in Pure P2P Information Sharing Systems

  • Authors:
  • Yi Ren;Chaofeng Sha;Weining Qian;Aoying Zhou;Beng Chin Ooi;Kian-Lee Tan

  • Affiliations:
  • -;-;-;-;-;-

  • Venue:
  • CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Pure Peer-to-peer architecture is becoming an importantmodel for information sharing among dynamic groups ofusers with its low cost of entry and its natural model forresource scaling with the community size. Recent studieson several pure P2P information-sharing systems haveposed new questions and challenges in this area. By identifyingtwo key factors in such an environment, we proposea new heuristic search algorithm to make better useof the "small world phenomena" among the peers in orderto find the "six degrees of separation" more efficiently.We show by experiment that our heuristic algorithmout-performs the traditional BFS algorithm with anover 10% performance-increase when querying relatedinformation, and a 20% increase when a shift of interesttakes place. The heuristic algorithm also has a better controlover the number of node-to-visit using our Node-Countfeature than the existing TTL mechanism.