|
Published Articles >> Table of Contents >> Abstract
Third IEEE International Symposium on Cluster Computing and the Grid (CCGrid'03)
p. 232
Explore the "Small World Phenomena" in Pure P2P Information Sharing Systems
Yi Ren, Fudan University
Chaofeng Sha, Fudan University
Weining Qian, Fudan University
Aoying Zhou, Fudan University
Beng Chin Ooi, National University of Singapore
Kian-Lee Tan, National University of Singapore
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CCGRID.2003.1199373
Send link to a friend
| 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
takes 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.
|
 Additional Information
|
Citation:
Yi Ren, Chaofeng Sha, Weining Qian, Aoying Zhou, Beng Chin Ooi, Kian-Lee Tan,
"Explore the "Small World Phenomena" in Pure P2P Information Sharing Systems,"
ccgrid,
p. 232,
Third IEEE International Symposium on Cluster Computing and the Grid (CCGrid'03),
2003
|
|
