Randomized protocols for resilient peer-to-peer networks.

This paper studies a few randomized algorithms (e.g., random walks, gossip) in peer-to-peer networks. We leverage the Docker virtual container technology to develop implementations of the peer-to-peer networks and of these distributed randomized algorithms executing on top of them. We can thus analyze their behavior and performance in realistic settings. We further consider the problem of identifying high-risk bottleneck links in the network with the objective of improving the resilience and reliability of peer-to-peer networks. We propose a randomized algorithm to solve this problem and evaluate its performance by simulations. [ABSTRACT FROM AUTHOR]