Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
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).
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.
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).
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).
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stading, T., Maniatis, P., Baker, M. (2002). Peer-to-Peer Caching Schemes to Address Flash Crowds. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds) Peer-to-Peer Systems. IPTPS 2002. Lecture Notes in Computer Science, vol 2429. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45748-8_19
Download citation
DOI: https://doi.org/10.1007/3-540-45748-8_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44179-3
Online ISBN: 978-3-540-45748-0
eBook Packages: Springer Book Archive