Open AccessProceedings Article
Democratizing content publication with coral
Michael J. Freedman,Eric Freudenthal,David Mazières +2 more
- 29 Mar 2004
- pp 18-18
TL;DR: CoralCDN is a peer-to-peer content distribution network that allows a user to run a web site that offers high performance and meets huge demand, all for the price of a cheap broadband Internet connection.
read more
Abstract: CoralCDN is a peer-to-peer content distribution network that allows a user to run a web site that offers high performance and meets huge demand, all for the price of a cheap broadband Internet connection Volunteer sites that run CoralCDN automatically replicate content as a side effect of users accessing it Publishing through CoralCDN is as simple as making a small change to the hostname in an object's URL; a peer-to-peer DNS layer transparently redirects browsers to nearby participating cache nodes, which in turn cooperate to minimize load on the origin web server One of the system's key goals is to avoid creating hot spots that might dissuade volunteers and hurt performance It achieves this through Coral, a latency-optimized hierarchical indexing infrastructure based on a novel abstraction called a distributed sloppy hash table, or DSHT
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Real-time query systems for complex data sources
Matt Welsh,Ian Rose +1 more
- 01 Jan 2011
TL;DR: By including the data acquisition process in the overall system design, it is possible to build scalable, real-time stream processing systems for complex data sources, and allowing queries to provide feedback to the collection process.
3
Reliable on-demand management operations for large-scale distributed applications
TL;DR: The MON (Management Overlay Networks) approach is presented, which uses a novel concept called on-demand overlays, in order to support instant commands such as queries and software pushes, and a series of promising open problems in this direction.
3
Mechanism design for Data Replica Placement (DRP) problem in strategic settings
Minzhe Guo,Prabir Bhattacharya +1 more
TL;DR: This work analyzes both the economic and computational properties of DRPMECH, validates the properties using experiments, and compares its performance against related game-theoretical solutions.
3
Turning flash crowds into smart mobs with real-time stochastic detection and adaptive cooperative caching
Jay A. Patel,Charles M. Yang,Indranil Gupta +2 more
- 23 Oct 2005
TL;DR: In this article, a real-time stochastic detector of flash-crowds, running at the server, is proposed to detect a flash crowd while the event is happening.
References
Chord: A scalable peer-to-peer lookup service for internet applications
Ion Stoica,Robert Morris,David R. Karger,M. Frans Kaashoek,Hari Balakrishnan +4 more
- 27 Aug 2001
TL;DR: Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
11.2K
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Antony Rowstron,Peter Druschel +1 more
TL;DR: Pastry as mentioned in this paper is a scalable, distributed object location and routing substrate for wide-area peer-to-peer ap- plications, which performs application-level routing and object location in a po- tentially very large overlay network of nodes connected via the Internet.
A scalable content-addressable network
Sylvia Ratnasamy,Paul Francis,Mark Handley,Richard M. Karp,Scott Shenker +4 more
- 27 Aug 2001
TL;DR: The concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales is introduced and its scalability, robustness and low-latency properties are demonstrated through simulation.
7.2K
Chord: a scalable peer-to-peer lookup protocol for Internet applications
Ion Stoica,Robert Morris,David Liben-Nowell,David R. Karger,M. Frans Kaashoek,Frank Dabek,Hari Balakrishnan +6 more
TL;DR: Results from theoretical analysis and simulations show that Chord is scalable: Communication cost and the state maintained by each node scale logarithmically with the number of Chord nodes.
OceanStore: an architecture for global-scale persistent storage
John Kubiatowicz,David Bindel,Yan Chen,Steven E. Czerwinski,Patrick Eaton,Dennis Geels,Ramakrishna Gummadi,Sean Rhea,Hakim Weatherspoon,Westley Weimer,Chris Wells,Ben Y. Zhao +11 more
- 12 Nov 2000
TL;DR: OceanStore monitoring of usage patterns allows adaptation to regional outages and denial of service attacks; monitoring also enhances performance through pro-active movement of data.