DocumentCode
3348062
Title
Maximizing Resilient Throughput in Peer-to-Peer Network: A Generalized Flow Approach
Author
Bin Chang ; Yi Cui ; Yuan Xue
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Vanderbilt Univ., Nashville, TN
fYear
2008
fDate
13-18 April 2008
Abstract
A unique challenge in P2P network is that the peer dynamics (departure or failure) cause unavoidable disruption to the downstream peers. While many works have been dedicated to consider fault resilience in peer selection, 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 generalized 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 topology, overlay organization, and the definition of resilience factor and generalized flow. Within each subproblem, 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.
Keywords
optimisation; peer-to-peer computing; probability; telecommunication network reliability; telecommunication network topology; generalized flow theory; network fault resilience; network topology; optimization framework; overlay organization; peer-to-peer network; probabilistic measure; resilience index; resilient network throughput maximizing; Communications Society; Constraint optimization; Economic indicators; Measurement; Network servers; Operations research; Peer to peer computing; Performance analysis; Resilience; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM 2008. The 27th Conference on Computer Communications. IEEE
Conference_Location
Phoenix, AZ
ISSN
0743-166X
Print_ISBN
978-1-4244-2025-4
Type
conf
DOI
10.1109/INFOCOM.2008.316
Filename
4509911
Link To Document