Journal    Photos    Links

November 24, 2002

Efficient P2P searching

Some guys at Microsoft (in a paper arguing that file sharing is unstoppable) believe that some guys at MIT have engineered a efficient and highly scalable way of searching a P2P network where node connectivity is intermittent in what they call CHORD (google Chord peer).

The abstract from a CHORD whitepaper:

"A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto a node. Data location can be easily implemented on top of Chord by associating a key with each data item, and storing the key/data item pair at the node to which the key maps. Chord adapts efficiently as nodes join and leave the system, and can answer queries even if the system is continuously changing. 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."

Sounds kind of similar to what Freenet is doing.

Posted by tbailen at November 24, 2002 09:45 PM
Comments
Post a comment