|
| |
Kademlia-Netzwerk
kademlia.scs.cs.nyu.edu.
Infrastruktur :
Netzwerke : Virtuell
: Kademlia-Netzwerk : Übersicht
21-May-2002/14-Jan-07
Übersicht
Petar Maymounkov und David Mazières:
"KADEMLIA is a novel routing algorithm for peer-to-peer
networks based on the XOR metric. The KADEMLIA project is a research
effort to implement a full-featured peer-to-peer system based on the
XOR metric routing. Topics of interest are efficient data storage
and query; anonimity; network, content and user security and
authentication" (aus der Projektdarstellung,
kademlia.scs.cs.nyu.edu;
Zugriff: 21-May-2002).
Ein Client für das Kademlia-Netzwerk ist
VarVar;
der Kademlia-Algorithmus wird ebenfalls genutzt im eDonkey-Nachfolger
Flock
von Jed
McCaleb.
Vorteile der Kademlia-Architektur
"The uniform design of KADEMLIA's routing table (a binary tree
of contact buckets, see Springer- Verlag LNCS paper for more details)
allows to naturally accommodate even temporarily used contacts. More
specifically, in the process of a lookup a node gets to use some helper
contacts that don't really belong to its routing table since they will,
on average, be far from the node's ID. However, KADEMLIA's routoing
table can still accommodate them temporarily in the appropriate branch
of its binary tree (expanding the tree a bit if necessary) and so make
them accessible to other concurrent lookups that might benefit from
them. In a situation, when a the system is busy and there are a number
of simultaneously happening lookups, this can shorten the number of hops
per lookup substantially. The above enhancment cannot be implemented in
a natural way in any of the well-known DHTs (distributed hash tables)
such as Chord, Pastry, Tapestry, etc. since the design of their routing
tables allows for no such flexibility, and hence they would require
additional data structures to accommodate temporary contacts".
Quelle:
kademlia.scs.cs.nyu.edu/better.html; Zugriff: 21-May-2002.
Siehe auch
Weiterführende Informationen
Papers.
Petar Maymounkov and David Mazières. Kademlia: A
Peer-to-peer Information System Based on the XOR Metric. In
Proceedings of the
1st
International Workshop on Peer-to-Peer Systems (IPTPS'02), March
7-8, 2002, MIT.
Workshop paper,
kademlia.scs.cs.nyu.edu/kpos_iptps.ps (PostScript),
kademlia.scs.cs.nyu.edu/kpos_iptps.pdf (PDF)
Neue LNCS-Version für den Springer-Verlag,
kademlia.scs.cs.nyu.edu/kpos.ps (PostScript),
kademlia.scs.cs.nyu.edu/kpos.pdf (PDF).
Presentations.
Petar Maymounkov: Kademlia: A Peer-to-peer Information
System Based on the XOR Metric. New York University, April 2,
2002,
kademlia.scs.cs.nyu.edu/kpres.ps.gz (compressed PostScript)
Mailinglisten
Siehe
Mailinglisten (Ressourcen).
Verwandte Projekte
Chord
(Frameworks),
MIT
(www.pdos.lcs.mit.edu/chord).
Pastry (Frameworks),
Microsoft Research
(research.microsoft.com/~antr/pastry)
Tapestry (Frameworks),
University of California Berkeley
(www.cs.berkeley.edu/~ravenben/tapestry)
Content Adressable Networks (CAN,
Content
Distribution),
Berkeley & ACIRI
(citeseer.nj.nec.com/ratnasamy01scalable.html)
Anmerkungen
<%
iMyForumID = 40
ShowForum iMyForumID
%>
| |
| Wer ist online?: |
<%
VisitorName = request.cookies("name")
If VisitorName ="" then
%>Name: Besucher
Online: <%= Application("ActiveUsers") %> aktive User.
<%
End if
If VisitorName <> "" then
%> <%
user = Request.Cookies("name")
%>Name: <%=user%>!
Online: <%= Application("ActiveUsers") %> aktive User. <%
End if
%> |
|
Login | Logout |
|
