
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
Kademlia is a structured peertopeer (P2P)
application level network, which implements a distributed
hash table (DHT). Its keyvalue storage and lookup service is
made efficient and reliable by its welldesigned binary tree
topology and dense mesh of connections between participant
nodes. While it can carry out data storage and retrieval in
logarithmic time if the key assigned to the value in question
is precisely known, no complex queries of any kind are
supported. In this article a broadcast algorithm for the
Kademlia network is presented, which can be used to
implement such queries. The replication scheme utilized is
compatible with the lookup algorithm of Kademlia, and it
uses the same routing tables. The reliability (coverage) of the
algorithm is increased by assigning the responsibility of
disseminating the broadcast message to many nodes at the
same time. The article presents a model validated with
simulation as well. The model can be used by nodes at runtime
to calculate the required level of replication for any desired
level of coverage. This calculation can take node churn, packet
loss ratio and the size of the overlay into account.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment