• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

A lightweight, robust p2p system to handle flash crowds (2002)

Cached

  • Download as a PDF

Download Links

  • [www.comp.nus.edu.sg]
  • [www.cs.columbia.edu]
  • [www.cs.columbia.edu]
  • [www.cs.columbia.edu]
  • [www.cs.columbia.edu]
  • [www1.cs.columbia.edu]
  • [www1.cs.columbia.edu]
  • [www1.cs.columbia.edu]
  • [www.cs.columbia.edu]
  • [www1.cs.columbia.edu]
  • [cs.gmu.edu]
  • [cs.gmu.edu]
  • [www1.cs.columbia.edu]
  • [www.cs.columbia.edu]
  • [www1.cs.columbia.edu]
  • [cs.gmu.edu]
  • [cs.gmu.edu]
  • [www1.cs.columbia.edu]
  • [www.cs.columbia.edu]
  • [www1.cs.columbia.edu]
  • [www1.cs.columbia.edu]
  • [cs.gmu.edu]
  • [cs.gmu.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Angelos Stavrou , Dan Rubenstein , Sambit Sahu
Citations:77 - 4 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Stavrou02alightweight,,
    author = {Angelos Stavrou and Dan Rubenstein and Sambit Sahu},
    title = {A lightweight, robust p2p system to handle flash crowds},
    booktitle = {},
    year = {2002},
    pages = {6--17}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Internet flash crowds (a.k.a. hot spots) are a phenomenon that result from a sudden, unpredicted increase in an on-line object’s popularity. Currently, there is no efficient means within the Internet to scalably deliver web objects under hot spot conditions to all clients that desire the object. We present PROOFS: a simple, lightweight, peer-to-peer (P2P) approach that uses randomized overlay construction and randomized, scoped searches to efficiently locate and deliver objects under heavy demand to all users that desire them. We evaluate PROOFS ’ robustness in environments in which clients join and leave the P2P network as well as in environments in which clients are not always fully cooperative. Through a mix of analytical modeling, simulation, and prototype experimentation in the Internet, we show that randomized approaches like PROOFS should effectively relieve flash crowd symptoms in dynamic, limited-participation environments. 1

Citations

3028 Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications - Stoica, Morris, et al. - 2001
2353 A scalable content-addressable network - Ratnasamy, Francis, et al. - 2001
928 Tapestry: An infrastructure for fault-tolerant wide-area location and routing - Zhao, Kubiatowicz, et al. - 2001
919 Multicast Routing in Datagram Internetworks and Extended LANs - Deering, Cheriton - 1990
914 A measurement study of peer-to-peer file sharing systems - Saroiu, Gummadi, et al. - 2002
777 Wide-area cooperative storage with CFS - Dabek, Kaashoek, et al. - 2001
607 Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility - Rowstron, Druschel - 2001
593 Epidemic algorithms for replicated database maintenance - Demers, Greene, et al. - 1988
565 Crowds: Anonymity for web transactions - Reiter, Rubin - 1998
294 Distributing streaming media content using cooperative networking - Padmanabhan, Wang, et al. - 2002
202 Replication Strategies in Unstructured Peer-to-Peer Networks - Cohen, Shenker - 2002
186 Peer-to-peer architecture case study: Gnutella network - Ripeanu - 2001
175 Publius: A robust, tamper-evident, censorship-resistant and source-anonymous web publishing system - Waldman, Rubin, et al.
166 Randomized rumor spreading - Karp, Schindelhauer, et al.
110 Spatial gossip and resource location protocols - Kempe, Kleinberg, et al. - 2001
100 Building lowdiameter P2P networks - Pandurangan, Raghavan, et al.
90 Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices - Papadopouli, Schulzrinne - 2001
88 The case for cooperative networking - Padmanabhan, Sripanidkulchai - 2002
81 A Framework for Scalable Global IPAnycast (GIA - Katabi, Wroclawski - 2000
80 Peer-to-peer caching schemes to address flash crowds,” in Peer-to-Peer Systems, ser - Stading, Maniatis, et al. - 2002
60 Application-layer anycasting: a server selection architecture and use in a replicated web service - Zegura, Ammar, et al. - 2000
18 Mitigating Server-Side Congestion in the Internet through - Kong, Ghosal - 1999
8 An Analysis of a Simple P2P Protocol for Flash Crowd Document Retrieval - Rubenstein, Sahu - 2001
4 A measurement study of peerto -peer file sharing systems - Saroiu, Gummadi, et al. - 2002
4 Publius: A Robust, Tamper-evident - Waldman, Rubin, et al. - 2000
3 Resource Finding in Store and Forward Networks - Bernabeu-Auban, Ammad, et al. - 1991
3 Why Gnutella Can't Scale. No, Really," February 2001, available from http://www.monkey.org/dugsong/mirror/gnutella.html - Ritter
3 Why Gnutella Can’t Scale. No, Really,” February 2001, available from http://www.monkey.org/�dugsong/mirror/gnutella.html - Ritter
1 Implementation of a Peer-to-Peer Data Dissemination and Prefetching Tool for Mobile Users - “Design - 2001
1 Resource Finding in - Bernabeu-Auban, Ammad, et al. - 1991
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University