WebSOS: an overlay-based system for protecting web servers from denial of service attacks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web security
FCAN: Flash Crowds Alleviation Network
Proceedings of the 2006 ACM symposium on Applied computing
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
ACM Transactions on Computer Systems (TOCS)
A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks
Computer Networks: The International Journal of Computer and Telecommunications Networking
From content distribution networks to content networks - issues and challenges
Computer Communications
Counter-based reliability optimization for gossip-based broadcasting
Computer Communications
WebSOS: an overlay-based system for protecting web servers from denial of service attacks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web security
Exploiting adaptive window techniques to reduce TCP congestion in mobile peer networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Autonomic multi-server distribution in flash crowds alleviation network
EUC'07 Proceedings of the 2007 conference on Emerging direction in embedded and ubiquitous computing
HELP: // hypertext in-emergency leveraging protocol
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A case for virtualization of content delivery networks
Proceedings of the Winter Simulation Conference
| Hi-index | 0.07 |
An Internet flash crowd (also known as hot spots) is a phenomenon that results from a sudden, unpredicted increase in an on-line object's popularity. Currently, there is no efficient means within the Internet to deliver Web objects scalably under hot spot conditions to all clients that desire the object. We present peer-to-peer (P2P) randomized overlays to obviate flash-crowd symptoms (PROOFS), a simple, lightweight, P2P approach that uses randomized overlay construction and randomized, scoped searches to locate and deliver objects efficiently 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 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.