
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Adriana Iamnitchi, Matei Ripeanu, Elizeu SantosNeto, Ian Foster, "The Small World of File Sharing," IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 7, pp. 11201134, July, 2011.  
BibTex  x  
@article{ 10.1109/TPDS.2010.170, author = {Adriana Iamnitchi and Matei Ripeanu and Elizeu SantosNeto and Ian Foster}, title = {The Small World of File Sharing}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {22}, number = {7}, issn = {10459219}, year = {2011}, pages = {11201134}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2010.170}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  The Small World of File Sharing IS  7 SN  10459219 SP1120 EP1134 EPD  11201134 A1  Adriana Iamnitchi, A1  Matei Ripeanu, A1  Elizeu SantosNeto, A1  Ian Foster, PY  2011 KW  File sharing KW  workload characterization KW  smallworld graphs KW  selforganization KW  peertopeer systems. VL  22 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] J. Abello, P. Pardalos, and M. Resende, "On Maximum Clique Problems in Very Large Graphs," External Memory Algorithms, vol. 50, pp. 119130, Am. Math. Soc./DIMACS, 1999.
[2] E. Adar and B.A. Huberman, "Free Riding on Gnutella," First Monday, vol. 5, no. 10, 2000.
[3] W. Aiello, F. Chung, and L. Lu, "A Random Graph Model for Massive Graphs," Proc. 32nd Ann. ACM Symp. Theory of Computing, pp. 171180, citeseer.nj.nec.com/articleaiello00random.html , 2000.
[4] R. Albert and A.L. Barabási, "Statistical Mechanics of Complex Networks," Rev. Modern Physics, vol. 74, pp. 4797, 2002.
[5] S. Arora, S. Rao, and U. Vazirani, "Expander Flows, Geometric Embeddings and Graph Partitioning," Proc. 36th Ann. ACM Symp. Theory of Computing (STOC '04), pp. 222231, 2004.
[6] A.L. Barabási, Linked: The New Science of Networks. Perseus Publishing, 2002.
[7] A.L. Barabási, R. Albert, and H. Jeong, "ScaleFree Characteristics of Random Networks: The Topology of the World Wide Web," Physica A, vol. 286, pp. 6977, 2000.
[8] P. Barford, A. Bestavros, A. Bradley, and M. Crovella, "Changes in Web Client Access Patterns Characteristics and Caching Implications," Technical Report BUCSTR1998023, Boston Univ., 1998.
[9] "Bittorrent Community," BitSoup, http:/www.bitsoup.org, 2007.
[10] BitTorrent, http:/www.bittorrent.com, 2010.
[11] B. Bloom, "Space/Time TradeOffs in Hash Coding with Allowable Errors," Comm. ACM, vol. 13, no. 7, pp. 422426, 1970.
[12] "Boeing Proxy Logs," ftp://researchsmp2.cc.vt.edu/pub/ boeing boeing.99030105.notes, 2009.
[13] L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, "Web Caching ZipfLike Distributions: Evidence and Implications," Proc. IEEE INFOCOM, 1999.
[14] C. Briquet, X. Dalem, S. Jodogne, and P.A. de Marneffe, "Scheduling DataIntensive Bags of Tasks in P2P Grids with BittorrentEnabled Data Distribution," Proc. Second Workshop Use of P2P, GRID and Agents for the Development of Content Networks (UPGRADE '07), pp. 3948, 2007.
[15] A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener, "Graph Structure in the Web," Computer Networks, vol. 33, nos. 16, 2000.
[16] R.F. Cancho and R.V. Solè, "The Small World of Human Language," Proc. Royal Soc. B, vol. 268, pp. 22612266, 2001.
[17] X. Cheng and J. Liu, "Nettube: Exploring Social Networks for PeertoPeer Short Video Sharing," Proc. IEEE INFOCOM '09, Apr. 2009.
[18] E. Cohen, A. Fiat, and H. Kaplan, "Associative Search in Peer to Peer Networks: Harnessing Latent Semantics," Proc. IEEE INFOCOM, 2003.
[19] "The DZero Experiment," http:/wwwd0.fnal.gov, 2010.
[20] S. Doraimani and A. Iamnitchi, "File Grouping for Scientific Data Management: Lessons from Experimenting with Real Traces," Proc. 17th ACM Symp. High Performance Distributed Computing (HPDC '08), June 2008.
[21] S. Dorogovtsev and J. Mendes, "Evolution of Networks," Advances in Physics, vol. 51, no. 4, pp. 10791187, 2002.
[22] E. Tardos, "Technical Perspective: New Developments in Graph Partitioning," Comm. ACM, vol. 51, no. 10, p. 95, 2008.
[23] M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On PowerLaw Relationships of the Internet Topology," Proc. ACM SIGCOMM, pp. 251262, citeseer.nj.nec.comfaloutsos99powerlaw.html , 1999.
[24] A. Fast, D. Jensen, and B.N. Levine, "Creating Social Networks to Improve PeertoPeer Networking," Proc. 11th ACM SIGKDD Int'l Conf. Knowledge Discovery in Data Mining (KDD '05), pp. 568573, 2005.
[25] F.L. Fessant, S.H. amd AnneMarie Kermarrec, and L. Massoulie, "Clustering in PeertoPeer File Sharing Workloads," Proc. Third Int'l Workshop PeertoPeer Systems (IPTPS), Feb. 2004.
[26] A. Ganesh, A. Kermarrec, and L. Massoulie, "PeertoPeer Membership Management for GossipBased Protocols," IEEE Trans. Computers, vol. 52, no. 2, pp. 139149, Feb. 2003.
[27] M. Girvan and M. Newman, "Community Structure in Social and Biological Networks," Proc. Nat'l Academy of Sciences, vol. 99, pp. 82718276, 2002.
[28] L. Guo, E. Tan, S. Chen, Z. Xiao, and X. Zhang, "Does Internet Media Traffic Really Follow ZipfLike Distribution?" ACM SIGMETRICS Performance Evaluation Rev., vol. 35, no. 1, pp. 359360, 2007.
[29] L. Guo, E. Tan, S. Chen, Z. Xiao, and X. Zhang, "The Stretched Exponential Distribution of Internet Media Access Patterns," Proc. 27th ACM Symp. Principles of Distributed Computing (PODC '08), pp. 283294, 2008.
[30] A. Iamnitchi, "Resource Discovery in Large ResourceSharing Environments," PhD dissertation, Univ. of Chicago, 2003.
[31] A. Iamnitchi, S. Doraimani, and G. Garzoglio, "Filecules in HighEnergy Physics: Characteristics and Impact on Resource Management," Proc. 15th IEEE Int'l Symp. High Performance Distributed Computing (HPDC), pp. 6980, June 2006.
[32] A. Iamnitchi, S. Doraimani, and G. Garzoglio, "Workload Characterization in a HighEnergy Data Grid and Impact on Resource Management," Cluster Computing, vol. 12, pp. 153173, 2009.
[33] A. Iamnitchi and I. Foster, "InterestAware Information Dissemination in SmallWorld Communities," 14th IEEE Int'l Symp. High Performance Distributed Computing (HPDC), July 2005.
[34] P. Jaccard, "The Distribution of the Flora in the Alpine Zone," The New Phytologist, vol. 11, no. 2, pp. 3750, http://www.jstor.org/stable2427226, 1912.
[35] H. Kautz, B. Selman, and M. Shah, "Referralweb: Combining the Social Networks and Collaborative Filtering," Comm. ACM, vol. 40, no. 3, pp. 6365, 1997.
[36] A.M. Kermarrec, L. Massoulie, and A. Ganesh, "Probabilistic Reliable Dissemination in LargeScale Systems," IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 3, pp. 248258, Mar. 2003.
[37] M. Khambatti, K.D. Ryu, and P. Dasgupta, "Structuring PeertoPeer Networks Using InterestBased Communities," Proc. First Int'l Workshop Databases, Information Systems, and PeertoPeer Computing (DBISP2P), pp. 4863, 2003.
[38] S. Khan and L. Tokarchuk, "InterestBased Self Organization in GroupStructured P2P Networks," Proc. Sixth IEEE Consumer Comm. and Networking Conf. (CCNC '09), pp. 15, Jan. 2009.
[39] N. Leibowitz, M. Ripeanu, and A. Wierzbicki, "Deconstructing the Kazaa Network," Proc. IEEE Workshop Internet Applications, 2003.
[40] M. Li, W.C. Lee, and A. Sivasubramaniam, "Semantic Small World: An Overlay Network for PeertoPeer Search," Proc. 12th IEEE Int'l Conf. Network Protocols, (ICNP '04), pp. 228238, 2004.
[41] L. LoebelCarpenter, L. Lueking, C. Moore, R. Pordes, J. Trumbo, S. Veseli, I. Terekhov, M. Vranicar, S. White, and V. White, "SAM and the Particle Physics Data Grid," Proc. Computing in HighEnergy and Nuclear Physics, 2001.
[42] K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim, "A Survey and Comparison of PeertoPeer Overlay Network Schemes," IEEE Comm. Surveys and Tutorials, vol. 7, no. 2, pp. 7293, Apr.June 2005.
[43] M. Newman, "Scientific Collaboration Networks: I. Network Construction and Fundamental Results," Physical Rev. E, vol. 64, no. 1, 2001.
[44] M. Newman, "Scientific Collaboration Networks: II. Shortest Paths, Weighted Networks, and Centrality," Physical Rev. E, vol. 64, 2001.
[45] M. Newman, "The Structure of Scientific Collaboration Networks," Proc. Nat'l Academy of Sciences of the USA, vol. 98, pp. 404409, 2001.
[46] M. Newman, "The Structure and Function of Complex Networks," SIAM Rev., vol. 45, no. 2, pp. 167256, 2003.
[47] M. Newman, S. Forrest, and J. Balthrop, "Email Networks and the Spread of Computer Viruses," Physical Rev. E, vol. 66, no. 035101, 2002.
[48] M. Newman, S. Strogatz, and D. Watts, "Random Graphs with Arbitrary Degree Distribution and Their Applications," Physical Rev. E, vol. 64, no. 026118, 2001.
[49] M. Newman, D. Watts, and S. Strogatz, "Random Graph Models of Social Networks," Proc. Nat'l Academy of Sciences of the USA, vol. 99, pp. 25662572, 2002.
[50] E. Otoo, D. Rotem, and A. Romosan, "Optimal FileBundle Caching Algorithms for DataGrids," Proc. ACM/IEEE Conf. Supercomputing (SC '04), p. 6, 2004.
[51] M.K. Ramanathan, V. Kalogeraki, and J. Pruyne, "Finding Good Peers in PeertoPeer Networks," Proc. 16th IEEE Int'l Symp. Parallel and Distributed Processing (IPDPS '02), pp. 2431, 2002.
[52] A. Rapoport, "Spread of Information through a Population with SocioStructural Basis: I. Assumption of Transitivity," Bull. Math. Biophysics, vol. 15, pp. 523543, Dec. 1953.
[53] S. Redner, "How Popular Is Your Paper? An Empirical Study of the Citation Distribution," European Physical J. B, vol. 4, pp. 131134, 1998.
[54] M. Ripeanu, A. Iamnitchi, and I. Foster, "Mapping the Gnutella Network: Properties of LargeScale PeertoPeer Systems and Implications for System Design," IEEE Internet Computing, vol. 6, no. 1, pp. 5057, Jan./Feb. 2002.
[55] Y. Saito, C. Karamanolis, M. Karlsson, and M. Mahalingam, "Taming Aggressive Replication in the Pangaea WideArea File System," Proc. Fifth Symp. Operating Systems Design and Implementation (OSDI '02), 2002.
[56] E. SantosNeto, W. Cirne, F. Brasileiro, and A. Lima, "Exploiting Replication and Data Reuse to Efficiently Schedule DataIntensive Applications on Grids," Proc. Int'l Workshop Job Scheduling Strategies for Parallel Processing, pp. 210232, June 2004.
[57] E. SantosNeto, M. Ripeanu, and A. Iamnitchi, "Tracking User Attention in Collaborative Tagging Communities," Proc. Int'l ACM/IEEE Workshop Contextualized Attention Metadata: Personalized Access to Digital Resources, June 2007.
[58] S. Saroiu, P.K. Gummadi, R. Dunn, S.D. Gribble, and H. Levy, "An Analysis of Internet Content Delivery Systems," Proc. Fifth Symp. Operating Systems Design and Implementation (OSDI '02), 2002.
[59] S. Saroiu, P.K. Gummadi, and S.D. Gribble, "A Measurement Study of PeertoPeer File Sharing Systems," Proc. Multimedia Computing and Networking (MMCN), 2002.
[60] K. Sripanidkulchai, B. Maggs, and H. Zhang, "Efficient Content Location Using InterestBased Locality in PeertoPeer Systems," Proc. IEEE INFOCOM, 2003.
[61] D. Stutzbach, R. Rejaie, and S. Sen, "Characterizing Unstructured Overlay Topologies in Modern P2P FileSharing Systems," IEEE/ACM Trans. Networking, vol. 16, no. 2, pp. 267280, Apr. 2008.
[62] D. Stutzbach and R. Rejaie, "Understanding Churn in PeertoPeer Networks," Proc. Sixth ACM SIGCOMM Internet Measurement Conf. (IMC '06), pp. 189202, 2006.
[63] D. Watts and S. Strogatz, "Collective Dynamics of 'SmallWorld' Networks," Nature, vol. 393, pp. 440442, June 1998.
[64] D.J. Watts, Small Worlds: The Dynamics of Networks between Order and Randomness. Princeton Univ. Press, 1999.
[65] W. Willinger, D. Alderson, and J.C. Doyle, "Mathematics and the Internet: A Source of Enormous Confusion and Great Potential," Notices of the Am. Math. Soc., vol. 56, no. 5,http://www.ams.org/notices/200905rtx090500586p.pdf , May 2009.