PreeN: Improving steady-state performance of ISP-friendly P2P applications

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. abstract environment. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Shams, S. M. S., Engelstad, P. E., & Kvalbein, A. (2012). PreeN: Improving steady-state performance of ISP-friendly P2P applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7129 LNCS, pp. 458–472). https://doi.org/10.1007/978-3-642-25959-3_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free