DSpace Repository

On the Rout­ing of Kadem­lia-type Sys­tems

Show simple item record

dc.contributor.author Roos, Stefanie
dc.contributor.author Salah, Hani
dc.contributor.author Strufe, Thorsten
dc.date.accessioned 2017-01-22T06:31:15Z
dc.date.accessioned 2022-05-22T08:26:43Z
dc.date.available 2017-01-22T06:31:15Z
dc.date.available 2022-05-22T08:26:43Z
dc.date.issued 2017
dc.identifier.uri http://localhost:8080/xmlui/handle/123456789/7787
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. Kademlia’s use of parallel and nondeterministic lookups, however, so far has prevented any concise formal analysis. We introduce a comprehensive formal model of the routing of the entire family of systems that is validated against both simulations and real-world measurements. In particular, we extend our previous work by excluding the effect of churn into the model. Our evaluation additionally shows that several of the recent improvements to the protocol in fact are counterproductive and identify preferable designs with regard to routing overhead and robustness to failures. en_US
dc.language.iso en en_US
dc.publisher Ad­vances in Com­put­er Com­mu­ni­ca­tions and Net­works en_US
dc.subject Kademlia, routing, model en_US
dc.title On the Rout­ing of Kadem­lia-type Sys­tems en_US
dc.type Book chapter en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


My Account