Coral is an open source, peer-to-peer content distribution network designed to mirror web content. Coral is designed to use the bandwidth of volunteers to reduce the load on websites and other providers of web content. To use coral, simply add .nyud.net:8090 to the hostname in a URL. So, for, example, http://en.wikipedia.org/wiki/Main_Page becomes http://en.wikipedia.org.nyud.net:8090/encyclopedia/Main_Page. The latter is known as a coralized link. Open source refers to projects that are open to the public and which draw on other projects that are freely available to the general public. ... A peer-to-peer (or P2P) computer network is a network that relies on the computing power and bandwidth of the participants in the network rather than concentrating it in a relatively few servers. ... A computer network is a system for communication between computers. ... Graphic representation of the World Wide Web around Wikipedia The World Wide Web (WWW, W3, or simply Web) is an information space in which the items of interest, referred to as resources, are identified by global identifiers called Uniform Resource Identifiers (URIs). ... Bandwidth is a measure of frequency range. ... The front page of the English Wikipedia Web site. ... A Uniform Resource Locator, URL (spelled out as an acronym, not pronounced as earl), or Web address, is a standardized address name layout for resources (such as documents or images) on the Internet (or elsewhere). ...
One of Coral's key goals is to avoid ever creating hot spots that might dissuade volunteers from running the software for fear of load spikes. It achieves this through a novel indexing abstraction called a distributed sloppy hash table (DSHT), and it creates self-organizing clusters of nodes that fetch information from each other to avoid communicating with more distant or heavily-loaded servers. Distributed hash tables (DHTs) are a class of decentralized distributed systems that partition ownership of a set of keys among participating nodes, and can efficiently route messages to the unique owner of any given key. ...
The project has been in an open beta testing phase since March 2004. During beta testing the Coral node network will be hosted on PlanetLab, a large scale distributed research network of 400 servers, instead of third party volunteer systems. Of those 400 servers, about 275 are currently running Coral. The source code is freely available under the terms of the GNU GPL. 2004 : January - February - March - April - May - June - July - August - September - October - November - December Deaths • 08 Abu Abbas • 20 Queen Juliana • 28 Peter Ustinov • 30 Alistair Cooke More March 2004 deaths Ongoing events EU Enlargement Exploration of Mars: Rovers Haiti Rebellion Israeli-Palestinian conflict Occupation of Iraq Same-sex marriage in... In a two-party system a third party is a party other than the two dominant ones. ... Source code (commonly just source or code) is any series of statements written in some human-readable computer programming language. ... GPL redirects here. ...
Distributed hash tables (DHTs) are a class of decentralized, distributed systems and algorithms being developed to provide a scalable, self-configuring infrastructure with a clean programming interface.
A DHT provides an efficient lookup algorithm (or network routing method) that allows one participating node to quickly determine which other machine is responsible for a given piece of data.
Nodes in a DHT are organized in an network overlay with a particular topology (such as a circle or a hypercube) over some space (such as the real interval [0,1)).
Distributed hash tables (DHTs) are a class of decentralized distributed systems that partition ownership of a set of keys among participating nodes, and can efficiently route messages to the unique owner of any given key.
Finally, Freenet was also fully distributed, but employed a heuristic key based routing in which each file was associated with a key, and files with similar keys tended to cluster on a similar set of nodes.
Neighbors are picked in a structured way -- called the network's topology -- so that the number of hops in any route (the dilation of the network) and the number of neighbors per node (the degree) will both be low.
Feeds |
Contact