Difference between revisions of "Kademlia"
From AMule Project FAQ
m (link to -de in header added) |
m (typo) |
||
Line 5: | Line 5: | ||
It is based on the Kademlia algorithm by [http://www.scs.cs.nyu.edu/~petar Petar Maymounkov] and [http://www.scs.cs.nyu.edu/~dm David Mazières] ([http://www.nyu.edu New York University], 2002). | It is based on the Kademlia algorithm by [http://www.scs.cs.nyu.edu/~petar Petar Maymounkov] and [http://www.scs.cs.nyu.edu/~dm David Mazières] ([http://www.nyu.edu New York University], 2002). | ||
− | It is not a | + | It is not a completely independent network as many people think. It still uses the [[eD2k]] network, but provides a [[server]]-less way to find other [[client]]s and [[file]]s. |
For information about it you can either read the [[FAQ_eD2k-Kademlia#What_is_Kademlia?|ED2K-Kademlia FAQ]] or see [http://emule-project.net/home/perl/help.cgi?l=1&rm=show_topic&topic_id=232 eMule's support page]. | For information about it you can either read the [[FAQ_eD2k-Kademlia#What_is_Kademlia?|ED2K-Kademlia FAQ]] or see [http://emule-project.net/home/perl/help.cgi?l=1&rm=show_topic&topic_id=232 eMule's support page]. |
Revision as of 23:46, 10 March 2006
Kademlia is a serverless network for the *Mule clients.
It is based on the Kademlia algorithm by Petar Maymounkov and David Mazières (New York University, 2002).
It is not a completely independent network as many people think. It still uses the eD2k network, but provides a server-less way to find other clients and files.
For information about it you can either read the ED2K-Kademlia FAQ or see eMule's support page.