Make it fresh, make it quick: searching a network of personal webservers
WWW '03 Proceedings of the 12th international conference on World Wide Web
Can unstructured P2P protocols survive flash crowds?
IEEE/ACM Transactions on Networking (TON)
Towards a scalable and robust DHT
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Small-world overlay P2P networks: construction, management and handling of dynamic flash crowds
Computer Networks: The International Journal of Computer and Telecommunications Networking
Democratizing content publication with coral
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Improving web availability for clients with MONET
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Botz-4-sale: surviving organized DDoS attacks that mimic flash crowds
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Proceedings of the 16th international symposium on High performance distributed computing
Flower-CDN: a hybrid P2P overlay for efficient query processing in CDN
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
A DoS-resilient information system for dynamic data management
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
IgorResource allocation over grid computing military networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Proof of service in a hybrid p2p environment
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
An adaptive probabilistic replication method for unstructured p2p networks
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
The scalability of swarming peer-to-peer content delivery
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
On leveraging social relationships for decentralized privacy-preserving group communication
Proceedings of the Fifth Workshop on Social Network Systems
A denial-of-service resistant DHT
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Maygh: building a CDN from client web browsers
Proceedings of the 8th ACM European Conference on Computer Systems
IRIS: a robust information system against insider dos-attacks
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
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 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.