The Community for Technology Leaders
Green Image
Issue No. 07 - July (2011 vol. 22)
ISSN: 1045-9219
pp: 1120-1134
Elizeu Santos-Neto , University of British Columbia, Vancouver
Ian Foster , University of Chicago, Chicago
Adriana Iamnitchi , University of South Florida, Tampa
Matei Ripeanu , University of British Columbia, Vancouver
ABSTRACT
Web caches, content distribution networks, peer-to-peer file-sharing networks, distributed file systems, and data grids all have in common that they involve a community of users who use shared data. In each case, overall system performance can be improved significantly by first identifying and then exploiting the structure of community's data access patterns. We propose a novel perspective for analyzing data access workloads that considers the implicit relationships that form among users based on the data they access. We propose a new structure—the interest-sharing graph—that captures common user interests in data and justify its utility with studies on four data-sharing systems: a high-energy physics collaboration, the Web, the Kazaa peer-to-peer network, and a BitTorrent file-sharing community. We find small-world patterns in the interest-sharing graphs of all four communities. We investigate analytically and experimentally some of the potential causes that lead to this pattern and conclude that user preferences play a major role. The significance of small-world patterns is twofold: it provides a rigorous support to intuition and it suggests the potential to exploit these naturally emerging patterns. As a proof of concept, we design and evaluate an information dissemination system that exploits the small-world interest-sharing graphs by building an interest-aware network overlay. We show that this approach leads to improved information dissemination performance.
INDEX TERMS
File sharing, workload characterization, small-world graphs, self-organization, peer-to-peer systems.
CITATION
Elizeu Santos-Neto, Ian Foster, Adriana Iamnitchi, Matei Ripeanu, "The Small World of File Sharing", IEEE Transactions on Parallel & Distributed Systems, vol. 22, no. , pp. 1120-1134, July 2011, doi:10.1109/TPDS.2010.170
97 ms
(Ver )