A lightweight, robust P2P system to handle flash crowds

IEEE Journal on Selected Areas in Communications

Volumn 22, Issue 1, 2004, Pages 6-17

  Stavrou, Angelos ^a   Rubenstein, Dan ^a   Sahu, Sambit ^b  

^a Columbia University ^*  (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Flash crowds; Hot spots; Peer to peer (P2P) networks; World wide web (WWW)

Indexed keywords

CLIENT SERVER COMPUTER SYSTEMS; COMPUTER SIMULATION; ONLINE SYSTEMS; RANDOM PROCESSES; WORLD WIDE WEB;

FLASH CROWDS; PEER-TO-PEER NETWORKS; RANDOMIZED OVERLAYS;

TELECOMMUNICATION TRAFFIC;

EID: 0742286702     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2003.818778     Document Type: Article

References (26)

1. V. Padmanabhan and K. Sripanidkulchai, "The case for cooperative networking," presented at the IPTPS'02, Cambridge, MA, Mar. 2002.
2. V. Padmanabhan, H. Wang, P. Chou, and K. Sripanidkulchai, "Distributing streaming media content using cooperative networking," presented at the NOSSDAV'02, Miami Beach, FL, May 2002.
3. D. Rubenstein and S. Sahu, "An analysis of a simple P2P protocol for flash crowd document retrieval," Columbia Univ., New York, NY, Tech. Rep., Nov. 2001.
4. K. Kong and D. Ghosal, "Mitigating server-side congestion in the internet through pseudoserving," Trans. Networking, vol. 7, pp. 530-544, Aug. 1999.
5. M. Reiter and A. Rubin, "Crowds: Anonymity for web transactions," ACM Trans. Inform. Syst. Security, vol. 1, no. 1, pp. 66-92, 1998.
6. A. R. M. Waldman and L. Cranor, "Publius: A robust, tamper-evident, censorship-resistant, web publishing system," presented at the 9th USENIX Security Symp., Denver, CO, Aug. 2000.
7. M. Papadopouli and H. Schulzrinne, "Effects of power conservation, wireless coverage, and cooperation on data dissemination among mobile devices," presented at the 7th Annu. Int. Conf. Mobile Computing and Networking (ACM SIGMOBILE), Rome, Italy, July 2001.
8. ____, "Design and implementation of a peer-to-peer data dissemination and prefetching tool for mobile users," presented at the 1st NY Metro Area Networking Workshop, New York, NY, Mar. 2001.
9. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," presented at the ACM SIGCOMM'01, San Diego, CA, Aug. 2001.
10. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications," presented at the ACM SIGCOMM'01, San Diego, CA, Aug. 2001.
11. F. Dabek, F. Kaashoek, R. Morris, D. Karger, and I. Stoica, "Wide-area cooperative storage with CFS," presented at the ACM SOSP'01, Banff, AB, Canada, Oct. 2001.
12. A. Rowstron and P. Druschel, "Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility," presented at the ACM SOSP'01, Banff, AB, Canada, Oct. 2001.
13. B. Zhao, J. Kubiatowicz, and A. Joseph, "Tapestry: An Infrastructure for fault-tolerant wide-area location and routing," Univ. California, Berkeley, CA, Tech. Rep., Apr. 2001.
14. T. Stading, P. Maniatis, and M. Baker, "Peer-to-peer caching schemes to address flash crowds," presented at the IPTPS'02, Cambridge, MA, Mar. 2002.
15. S. Deering and D. Cheriton, "Multicasting routing in datagram internet-works and extended LANs," ACM Trans. Comp. Syst., vol. 8, no. 2, pp. 85-110, May 1990.
16. E. Zegura, M. Ammar, Z. Fei, and S. Bhattacharjee, "Application-layer anycasting: A server selection architecture and use in a replicated web service," Trans. Networking, vol. 8, pp. 455-466, Aug. 2000.
17. D. Katabi and J. Wroclawski, "A framework for scalable global IP-anycast (GIA)," presented at the ACM SIGCOMM'00, Stockholm, Sweden, Sept. 2000.
18. J. Bernabeu-Auban, M. Ammad, and A. Ammar, "Resource finding in store and forward networks," Acta Informatica, vol. 28, 1991.
19. D. Kempe, J. Kleinberg, and A. Demers, "Spatial gossip and resource location protocols," presented at the 33rd Annu. ACM Symp. Theory of Computing (STOC), Crete, Greece, July 2001.
20. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry, "Epidemic algorithms for replicated database maintenance," presented at the 6th Annu. ACM Symp. Principles Distributed Computing, 1987.
21. R. Karp, S. Shenker, C. Schindelhauer, and B. Vocking, "Randomized rumor spreading," presented at the 41st Symp. Foundation Computer Science (FOCS'00), Redondo Beach, CA, Nov. 2000.
22. G. Pandurangan, P. Raghavan, and E. Upfal, "Building low-diameter P2P networks," presented at the 42nd Symp. Foundation Computer Science (FOCS'01), Las Vegas, NV, Oct. 2001.
23. S. Saroiu, P. Gummadi, and S. Gribble, "A measurement study of peer-to-peer file sharing systems," Univ. Washington, Seattle, WA, Tech. Rep. UW-CSE-01-06-02, July 2001.
24. M. Ripeanu and I. Foster, "Peer-to-peer architecture case study: Gnutella network," Univ. Chicago, Chicago, IL, Tech. Rep. TR-2001-26, July 2001.
25. J. Ritter. (2001, Feb.) Why Gnutella can't scale. No, really. [Online]. Available: http://www.monkey-org/~dugsong/mirror/gnutella.html
26. E. Cohen and S. Shenker, "Replication strategies in unstructured peer-to-peer networks," presented at the ACM SIGCOMM'02, Pittsburgh, PA, Aug. 2002.