Salah, Hani ; Roos, Stefanie ; Strufe, Thorsten (2014)
Diversity Entails Improvement: A new Neighbour Selection Scheme for Kademlia-type Systems.
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
Discovery of nodes and content in large-scale distributed systems is generally based on Kademlia, today. Understanding Kademlia-type systems to improve their performance is essential for maintaining a high service quality for an increased number of participants, particularly when those systems are adopted by latency-sensitive applications. This paper contributes to the understanding of Kademlia by studying the impact of diversifying neighbours’ identifiers within each routing table bucket on the lookup performance. We propose a new, yet backward-compatible, neighbour selection scheme that attempts to maximize the aforementioned diversity. The scheme does not cause additional overhead except negligible computations for comparing the diversity of identifiers. We present a theoretical model for the actual impact of the new scheme on the lookup’s hop count and validate it against simulations of three exemplary Kademlia-type systems. We also measure the performance gain enabled by a partial deployment for the scheme in the real KAD system. The results confirm the superiority of the systems that incorporate our scheme.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2014 |
| Autor(en): | Salah, Hani ; Roos, Stefanie ; Strufe, Thorsten |
| Art des Eintrags: | Bibliographie |
| Titel: | Diversity Entails Improvement: A new Neighbour Selection Scheme for Kademlia-type Systems |
| Sprache: | Deutsch |
| Publikationsjahr: | 2014 |
| Buchtitel: | IEEE International Conference on Peer-to-Peer Computing (IEEE P2P) |
| Kurzbeschreibung (Abstract): | Discovery of nodes and content in large-scale distributed systems is generally based on Kademlia, today. Understanding Kademlia-type systems to improve their performance is essential for maintaining a high service quality for an increased number of participants, particularly when those systems are adopted by latency-sensitive applications. This paper contributes to the understanding of Kademlia by studying the impact of diversifying neighbours’ identifiers within each routing table bucket on the lookup performance. We propose a new, yet backward-compatible, neighbour selection scheme that attempts to maximize the aforementioned diversity. The scheme does not cause additional overhead except negligible computations for comparing the diversity of identifiers. We present a theoretical model for the actual impact of the new scheme on the lookup’s hop count and validate it against simulations of three exemplary Kademlia-type systems. We also measure the performance gain enabled by a partial deployment for the scheme in the real KAD system. The results confirm the superiority of the systems that incorporate our scheme. |
| ID-Nummer: | TUD-CS-2014-0857 |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik > Peer-to-Peer Netzwerke 20 Fachbereich Informatik |
| Hinterlegungsdatum: | 27 Jul 2016 16:32 |
| Letzte Änderung: | 17 Mai 2018 21:50 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum