Please use this identifier to cite or link to this item: https://doi.org/10.1109/CCGRID.2003.1199373
Title: Explore the "small world phenomena" in pure P2P information sharing systems
Authors: Ren, Y.
Sha, C.
Qian, W.
Zhou, A.
Ooi, B.C. 
Tan, K.-L. 
Issue Date: 2003
Citation: Ren, Y., Sha, C., Qian, W., Zhou, A., Ooi, B.C., Tan, K.-L. (2003). Explore the "small world phenomena" in pure P2P information sharing systems. Proceedings - CCGrid 2003: 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid : 232-239. ScholarBank@NUS Repository. https://doi.org/10.1109/CCGRID.2003.1199373
Abstract: Pure Peer-to-peer architecture is becoming an important model for information sharing among dynamic groups of users with its low cost of entry and its natural model for resource scaling with the community size. Recent studies on several pure P2P information-sharing systems have posed new questions and challenges in this area. By identifying two key factors in such an environment, we propose a new heuristic search algorithm to make better use of the "small world phenomena" among the peers in order to find the "six degrees of separation" more efficiently. We show by experiment that our heuristic algorithm out-performs the traditional BFS algorithm with an over 10% performance-increase when querying related information, and a 20% increase when a shift of interest lakes place. The heuristic algorithm also has a better control over the number of node-to-visit using our Node-Count feature than the existing TTL mechanism. © 2003 IEEE.
Source Title: Proceedings - CCGrid 2003: 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid
URI: http://scholarbank.nus.edu.sg/handle/10635/78136
ISBN: 0769519199
DOI: 10.1109/CCGRID.2003.1199373
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

12
checked on Dec 11, 2018

Page view(s)

31
checked on Nov 16, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.