Maximizing Resilient Throughput in Peer-to-Peer Network

Abstract

A unique challenge in P2P network is that the peer dynamics (departure or failure) cause unavoidable disrup- tion to the downstream peers. While many works have been dedicated to consider fault resilience in peer se- lection, little understanding is achieved regarding the solvability and solution complexity of this problem from the optimization perspective. To this end, we propose an optimization framework based on the general- ized flow theory. Key concepts introduced by this framework include resilience factor, resilience index, and generalized throughput, which collectively model the peer resilience in a probabilistic measure. Under this framework, we divide the domain of optimal peer selection along several dimensions including network to- pology, overlay organization, and the definition of resilience factor and generalized flow. Within each sub- problem, we focus on studying the problem complexity and finding optimal solutions. Simulation study is also performed to evaluate the effectiveness of our model and performance of the proposed algorithms.