Interest-aware information dissemination in small-world communities

Proceedings of the IEEE International Symposium on High Performance Distributed Computing

Volumn , Issue , 2005, Pages 167-175

  Iamnitchi, Adriana ^a   Foster, Ian ^b  

^a Duke University   (United States)

^b THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SHARING COMMUNITIES; INFORMATION DISSEMATION;

CLASSIFICATION (OF INFORMATION); COMPUTER NETWORKS; DISTRIBUTED COMPUTER SYSTEMS; PROBLEM SOLVING;

INFORMATION DISSEMINATION;

EID: 27644535015     PISSN: 10828907     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (41)

1. M. Allen and R. Wolski. The Livny and Plank-Beck problems: Studies in data movement on the computational grid. In Supercomputing, 2003.
2. B. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.
3. Boeing proxy logs, ftp://researchsmp2.cc.vt.edu/pub/boeing/boeing.990301- 05.notes.
4. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web caching and Zipf-like distributions: Evidence and implications. In InfoCom, New York, NY, 1999. IEEE Press.
5. A. Chervenak, E. Deelman, I. Foster, L. Guy, W. Hoschek, A. Iamnitchi, C. Kesselman, P. Kunszt, M. Ripeanu, B. Schwartzkopf, H. Stockinger, K. Stockinger, and B. Tierney. Giggle: A framework for constructing scalable replica location services. In Supercomputing, 2002.
6. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: A distributed anonymous information storage and retrieval system. In International Workshop on Designing Privacy Enhancing Technologies, volume 44-66, Berkeley, CA, 2000. Springer-Verlag.
7. E. Cohen, A. Fiat, and H. Kaplan. Associative search in peer to peer networks: Harnessing latent semantics. In Infocom, San Fancisco, CA, 2003.
8. K. Czajkowski, S. Fitzgerald, I. Foster, and C. Kesselman. Grid information services for distributed resource sharing. In 10th IEEE International Symposium on High Performance Distributed Computing (HPDC-10), pages 181-184. IEEE Press, 2001.
9. The DZero Experiment., http://www-d0.fnal.gov.
10. F. Dabek, E. Brunskill, M. F. Kaashoek, D. Karger, R. Morris, I. Stoica, and H. Balakrishnan. Building peer-to-peer systems with Chord, a distributed lookup service. In Proceedings of 8th Workshop on Hot Topics in Operating Systems (HotOS-VIII). Elmau/Oberbayern, Germany, 2001.
11. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01), Chateau Lake Louise, Banff, Canada, Oct. 2001.
12. G. W. Flake, S. Lawrence, and C. L. Giles. Efficient identification of web communities. In 6th ACM SIGKDD, pages 150-160, 2000.
13. G. W. Flake, S. Lawrence, C. L. Giles, and F. M. Coetzee. Self-organization of the web and identification of communities. IEEE Computer, 35(3):66-71, 2002.
14. A. Ganesh, A. Kermarrec, and L. Massoulie. Peer-to-peer membership management for gossip-based protocols. IEEE Transactions on Computers, 52, February 2003.
15. M. Girvan and M. Newman. Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA, 99:8271-8276, 2002.
16. R. A. Golding. Weak-consistency group communication and membership. PhD thesis, University of California at Santa Cruz, 1992.
17. R. A. Golding and K. Taylor. Group membership in the epidemic style. Technical Report UCSC-CRL-92-13, University of California, Santa Cruz, Jack Baskin School of Engineering, March 1992 1992.
18. I. Gupta, K. Birman, P. Linga, A. Demers, and R. van Renesse. Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IFTPS '03), 2003.
19. A. Iamnitchi. Resource Discovery in Large Resource-Sharing Environments. PhD thesis, University of Chicago, 2003.
20. A. Iamnitchi and I. Foster. On fully decentralized resource discovery in grid environments. In International Workshop on Grid Computing, Denver, Colorado, 2001. IEEE.
21. A. Iamnitchi and M. Ripeanu. Myth and reality: Usage behavior in a large data-intensive physics project. Technical Report TR2003-4, GriPhyN, 2003.
22. A. Iamnitchi, M. Ripeanu, and I. Foster. Small-world file-sharing communities. In Infocom, Hong Kong, China, 2004.
23. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review. ACM Computing Surveys, 31(3):264-323, 1999.
24. A.-M. Kermarrec, L. Massoulie, and A. Ganesh. Probabilistic reliable dissemination in large-scale systems. IEEE Transactions on Parallel and Distributed Systems, 14(3), March 2003.
25. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the Web for emerging cyber-communities. Computer Networks (Amsterdam, Netherlands: 1999), 31(11-16):1481-1493, 1999.
26. N. Leibowitz, M. Ripeanu, and A. Wierzbicki. Deconstructing the Kazaa network. In Workshop on Internet Applications, San Francisco, CA, 2003.
27. G. Linden, B. Smith, and J. York. Amazon.com recommendations: Item-to-item collaborative filtering. IEEE Internet Computing, 7(1):76-80, January/February 2003.
28. L. Loebel-Carpenter, 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. In Computing in High-Energy and Nuclear Physics, Beijing, China, 2001.
29. M. L. Massie, B. N. Chun, and D. E. Culler. The Ganglia distributed monitoring system: design, implementation, and experience. Parallel Computing, 30(5-6):817-840, 2004.
30. E. J. Otoo, D. Rotem, and A. Romosan. Optimal file-bundle caching algorithms for data-grids. In Supercomputing, 2004.
31. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In SIGCOMM. ACM, 2001.
32. M. Ripeanu and I. Foster. A decentralized, adaptive, replica location service. In Proceedings of the 11th IEEE International Symposium on High Performance Distributed Compuing (HPDC-11). IEEE, July 2002.
33. M. Ripeanu, A. Iamnitchi, and I. Foster. Mapping the Gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. Internet Computing, 6(1):50-57, 2002.
34. http://www.slyck.com.
35. K. Sripanidkulchai, B. Maggs, and H. Zhang. Efficient content location using interest-based locality in peer-to-peer systems. In INFOCOM, San Francisco, 2003.
36. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In SIGCOMM, San Diego, USA, 2001.
37. S. van Dongen. Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht, May 2000.
38. S. van Dongen. MCL - a cluster algorithm for graphs, http://micans.org/ mcl/.
39. W. Vogels, R. van Renesse, and K. Birman. Using epidemic techniques for building ultra-scalable reliable communication systems. In Workshop on New Visions for Large-Scale Networks: Research and Applications, Vienna, VA, 2001.
40. D. Watts and S. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393, 1998.
41. H. Zhang, A. Goel, and R. Govindan. Using the small-world model to improve freenet performance. In Infocom. 2002.