A lightweight, robust p2p system to handle flash crowds

DMCA

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

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Angelos Stavrou , Dan Rubenstein , Sambit Sahu

Citations:

109 - 4 self

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}
}

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

Keyphrases

flash crowd robust p2p system internet flash crowd flash crowd symptom analytical modeling client join prototype experimentation p2p network proof robustness unpredicted increase present proof overlay construction heavy demand hot spot condition hot spot on-line object popularity web object randomized approach limited-participation environment

DMCA