TU Darmstadt / ULB / TUbiblio

Determining the Hop Count in Kademlia-type Systems

Roos, Stefanie and Salah, Hani and Strufe, Thorsten :
Determining the Hop Count in Kademlia-type Systems.
IEEE ICCCN
[Conference or Workshop Item] , (2015)

Abstract

The family of Kademlia-type systems represents the most efficient and most widely deployed class of internet scale 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.

Item Type: Conference or Workshop Item
Erschienen: 2015
Creators: Roos, Stefanie and Salah, Hani and Strufe, Thorsten
Title: Determining the Hop Count in Kademlia-type Systems
Language: German
Abstract:

The family of Kademlia-type systems represents the most efficient and most widely deployed class of internet scale 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.

Title of Book: IEEE ICCCN
Uncontrolled Keywords: - P2P - Area Peer-to-Peer Systems
Divisions: Department of Computer Science > Peer-to-Peer Netzwerke
Department of Computer Science > Telecooperation
Department of Computer Science
Date Deposited: 27 Jul 2016 16:32
Identification Number: TUD-CS-2015-0069
Export:

Optionen (nur für Redakteure)

View Item View Item