|Authors||S. Shams, A. Kvalbein and P. E. Engelstad|
|Editors||L. Bononi, A. Datta, S. Devismes and A. Misra|
|Title||PreeN: Improving Steady-State Performance of ISP-Friendly P2P Applications|
|Afilliation||Networks, Communication Systems|
|Publication Type||Proceedings, refereed|
|Year of Publication||2012|
|Conference Name||13th International conference on Distributed Computing and Networking, ICDCN 2012|
Much effort has been put into making P2P applications ISP-friendly, i.e. finding a solution that reduces inter-ISP traffic while maintaining the high file-sharing efficiency of existing P2P applications. Related works have analyzed different ISP-friendly P2P solutions by simulations. However, most of these simulation models have two common assumptions; 1) the peer arrival process follows a flash-crowd scenario, 2) the distribution of peers follows a uniform distribution. Most of the time, both these assumptions are not true for a P2P network. In this paper we show that the peer arrival process and the distribution of peers have a significant effect on the simulation results. We also show that solutions perform differently, e.g. in terms of the amount of inter-ISP traffic and download time, in a flash crowd scenario than in a steady state, limiting the applicability of the results and conclusions reported in previous works. Based on this new insight, we propose a Preemptive Neighbor Selection (PreeN) that makes an ISP-friendly P2P application efficient in steady state scenarios.