Evaluating Connection Resilience for the Overlay Network Kademlia
H. Heck, O. Kieselmann, and A. Wacker. 37th IEEE International Conference on Distributed Computing Systems (ICDCS 2017), page 2581-2584. Atlanta, GA, USA, IEEE Computer Society, (June 2017)
DOI: 10.1109/ICDCS.2017.101
Abstract
Kademlia is a decentralized overlay network, up to now mainly used for highly scalable file sharing applications. Due to its distributed nature, it is free from single points of failure. Communication can happen over redundant network paths, which makes information distribution with Kademlia resilient against failing nodes and attacks. In this paper, we simulate Kademlia networks with varying parameters and analyze the number of node-disjoint paths. With our results, we show the influence of these parameters on the network connectivity and, therefore, the resilience against failing nodes and communication channels.
%0 Conference Paper
%1 heck2017evaluating
%A Heck, Henner
%A Kieselmann, Olga
%A Wacker, Arno
%B 37th IEEE International Conference on Distributed Computing Systems (ICDCS 2017)
%C Atlanta, GA, USA
%D 2017
%I IEEE Computer Society
%K heck itegpub kademlia kieselmann myown resilience
%P 2581-2584
%R 10.1109/ICDCS.2017.101
%T Evaluating Connection Resilience for the Overlay Network Kademlia
%X Kademlia is a decentralized overlay network, up to now mainly used for highly scalable file sharing applications. Due to its distributed nature, it is free from single points of failure. Communication can happen over redundant network paths, which makes information distribution with Kademlia resilient against failing nodes and attacks. In this paper, we simulate Kademlia networks with varying parameters and analyze the number of node-disjoint paths. With our results, we show the influence of these parameters on the network connectivity and, therefore, the resilience against failing nodes and communication channels.
@inproceedings{heck2017evaluating,
abstract = {Kademlia is a decentralized overlay network, up to now mainly used for highly scalable file sharing applications. Due to its distributed nature, it is free from single points of failure. Communication can happen over redundant network paths, which makes information distribution with Kademlia resilient against failing nodes and attacks. In this paper, we simulate Kademlia networks with varying parameters and analyze the number of node-disjoint paths. With our results, we show the influence of these parameters on the network connectivity and, therefore, the resilience against failing nodes and communication channels.},
added-at = {2017-04-24T20:08:40.000+0200},
address = {Atlanta, GA, USA},
author = {Heck, Henner and Kieselmann, Olga and Wacker, Arno},
biburl = {https://www.bibsonomy.org/bibtex/220b7c903f03bfa69e748cf71ba58c4a7/wacker},
booktitle = {37th IEEE International Conference on Distributed Computing Systems (ICDCS 2017)},
doi = {10.1109/ICDCS.2017.101},
interhash = {099d9026551c2d5797b9410731aead4b},
intrahash = {20b7c903f03bfa69e748cf71ba58c4a7},
keywords = {heck itegpub kademlia kieselmann myown resilience},
month = {June},
pages = {2581-2584},
publisher = {IEEE Computer Society},
timestamp = {2017-07-31T15:34:37.000+0200},
title = {Evaluating Connection Resilience for the Overlay Network Kademlia},
year = 2017
}