Peer-to-Peer Caching Schemes to Address Flash Crowds

  • Tyron Stading
  • Petros Maniatis
  • Mary Baker
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2429)


Flash crowds can cripple a webs ite’s performance. Since they are infrequent and unpredictable, these floods do not justify the cost of traditional commercial solutions. We describe Backslash, a collaborative webmirroring system run by a collective of websites that wish to protect themselves from flash crowds. Backslash is built on a distributed hash table overlay and uses the structure of the overlay to cache aggressively a resource that experiences an uncharacteristically high request load. By redirecting requests for that resource uniformly to the created caches, Backslash helps alleviate the effects of flash crowds. We explore cache diffusion techniques for use in such a system and find that probabilistic forwarding improves load distribution albeit not dramatically.


Distribute Hash Table Request Rate Cache Scheme Probabilistic Forwarding Flash Crowd 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [3]
    Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., and Zhao, B. OceanStore: An Architecture for Global-Scale Persistent Storage. In Proceedings of ASPLOS 2000 (Cambridge, MA, USA, Nov. 2000), pp. 190–201.Google Scholar
  2. [4]
    Padmanabhan, V., Sripanidkulchai, K. The Case for Cooperative Networking. In 1st International Workshop on Peer-to-Peer Systems (IPTPS 2002) 2002 (Cambridge, MA, USA, March 2002).Google Scholar
  3. [5]
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Shenker, S. A Scalable Content-Addressable Network. In Proceedings of SIGCOMM 2001 (San Diego, CA, U.S.A., Aug. 2001), ACM SIGCOMM, pp. 161–172.Google Scholar
  4. [6]
    Rowstron, A., and Druschel, P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of IFIP/ACM Middleware 2001 (Heidelberg, Germany, Nov. 2001).Google Scholar
  5. [7]
    Rubenstein, R. and Sahu, S. An Analysis of a Simple P2P Protocol for Flash Crowd Document Retrieval. Available as Columbia University Technical Report EE011109-1 (Columbia University, New York, NY, USA, Nov. 2001).Google Scholar
  6. [8]
    Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., and Balakrishnan, H. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of SIGCOMM 2001 (San Diego, CA, U.S.A., Aug. 2001), ACM SIGCOMM, pp. 149–160.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Tyron Stading
    • 1
  • Petros Maniatis
    • 1
  • Mary Baker
    • 1
  1. 1.Computer Science DepartmentStanford UniversityStanfordUSA

Personalised recommendations