Determining the Hop Count in Kademlia-type Systems
| dc.contributor.author | Roos, Stefanie | |
| dc.contributor.author | Salah, Hani | |
| dc.contributor.author | Strufe, Thorsten | |
| dc.date.accessioned | 2017-01-19T06:57:17Z | |
| dc.date.accessioned | 2022-05-22T08:58:46Z | |
| dc.date.available | 2017-01-19T06:57:17Z | |
| dc.date.available | 2022-05-22T08:58:46Z | |
| dc.date.issued | 2015-12-01 | |
| dc.description.abstract | —The family of Kademlia-type systems represents the most efficient and most widely deployed class of Internetscale distributed systems. However, prior research on these systems has mainly been restricted to analyzing deployed systems and suggesting improvements tailored to specific environments rather than exploiting the huge parameter space governing the routing performance. Concise analytic results are rare, due to the complexity of Kademlia’s parallel and non-deterministic lookups. This paper introduces the first comprehensive formal model of the routing for the entire family of Kademlia-type systems. We validate our model against simulations of both the BitTorrent Mainline DHT and eMule’s KAD implementation. The model allows a highly scalable comparison with respect to the hop distribution of different variations to the original protocol. In particular, we show that several of the recent improvements to the protocol in fact have been counterproductive with regard to routing efficiency. | en_US |
| dc.identifier.citation | Roos, Stefanie, Hani Salah, and Thorsten Strufe. "Determining the Hop Count in Kademlia-type Systems." IEEE ICCCN. 2015. | en_US |
| dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/8495 | |
| dc.language.iso | en | en_US |
| dc.publisher | IEEE | en_US |
| dc.subject | Kademlia, routing, model | en_US |
| dc.title | Determining the Hop Count in Kademlia-type Systems | en_US |
| dc.type | Article | en_US |