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.