Comprehending Kademlia Routing-A Theoretical Framework for the Hop Count Distribution
| dc.contributor.author | Roos, Stefanie | |
| dc.date.accessioned | 2017-01-18T08:21:24Z | |
| dc.date.accessioned | 2022-05-22T08:26:38Z | |
| dc.date.available | 2017-01-18T08:21:24Z | |
| dc.date.available | 2022-05-22T08:26:38Z | |
| dc.date.issued | 2013-07-26 | |
| dc.description.abstract | The family of Kademlia-type systems represents the most efficient and most widely deployed class of internet-scale distributed systems. Its success has caused plenty of large scale measurements and simulation studies, and several improvements have been introduced. Its character of parallel and non-deterministic lookups, however, so far has prevented any concise formal analysis. This paper introduces the first comprehensive formal model of the routing of the entire family of systems that is validated against previous measurements. It sheds light on the overall hop distribution and lookup delays of the different variations of the original protocol. It additionally shows that several of the recent improvements to the protocol in fact have been counter-productive and identifies preferable designs with regard to routing overhead and resilience. | en_US |
| dc.identifier.citation | Roos, Stefanie, Hani Salah, and Thorsten Strufe. "Comprehending Kademlia Routing-A Theoretical Framework for the Hop Count Distribution." arXiv preprint arXiv:1307.7000 (2013). | en_US |
| dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/7775 | |
| dc.language.iso | en | en_US |
| dc.publisher | arXiv | en_US |
| dc.subject | Kademlia, routing, model | en_US |
| dc.title | Comprehending Kademlia Routing-A Theoretical Framework for the Hop Count Distribution | en_US |
| dc.type | Technical Report | en_US |