@inproceedings {Simula.simula.856,
	title = {PreeN: Improving Steady-State Performance of ISP-Friendly P2P Applications},
	journal = {13th International conference on Distributed Computing and Networking, ICDCN 2012},
	volume = {7129},
	year = {2012},
	month = {January},
	publisher = {Springer},
	type = {Conference},
	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.},
	author = {Shams, Saif and Kvalbein, Amund and Paal Einar {Engelstad}},
	editor = {Bononi, L. and Datta, A. and Devismes, S. and Misra, A.}
}
@inproceedings {Simula.simula.858,
	title = {On Randomness in ISP-Friendly P2P Applications},
	journal = {The 26th IEEE International Conference on Advanced Information Networking and Applications, AINA-2012},
	year = {2012},
	month = {March},
	publisher = {IEEE},
	type = {Conference},
	abstract = {P2P networking is a popular technology for sharing large files efficiently without using powerful servers. The goal for a P2P file sharing application is to minimize the download time experienced by the peers. However, the efficiency of a P2P network comes at the expense of excessive network utilization. ISPs want to control the network utilization of P2P applications, and in particular it is desirable to minimize the inter-ISP traffic. The often contradicting interests of applications and network owners have led to the search for an ISP-friendly P2P application that reduces inter-ISP traffic while maintaining the high file-sharing efficiency. Existing solutions propose to localize most of the P2P traffic within the ISP, while randomly selecting a few external peers to ensure the global spread of content. However, these proposals disregard the inherent randomness that will naturally exist in P2P systems. In this paper, we analyze the different sources of inherent randomness in ISP-friendly P2P systems, and show that they can have a significant impact on performance, and therefore must be taken into account when designing new solutions.},
	author = {Shams, Saif and Kvalbein, Amund and Paal Einar {Engelstad}}
}
@inproceedings {Simula.ND.401,
	title = {Analysis of Peer Selection Algorithms in Cross-Layer P2P Architectures},
	journal = {International Workshop on Advances in Peer-to-Peer Technology, IWAP2PT09},
	year = {2009},
	month = {December},
	publisher = {IEEE COMSOC},
	type = {Workshop},
	abstract = {The large amount of peer-to-peer (P2P) traffic in today{\textquoteright}s Internet represents a great challenge for most Internet Service providers (ISPs). P2P traffic does not conform to traditional ISP traffic policies, and it makes it harder to perform traffic engineering in the network. It is especially the peer-selection mechanism of the P2P application that influences the traffic patterns and creates an imbalance for the ISP business. Some ISPs benefit from the P2P traffic, while others suffer. There are research efforts proposing cross-layer solutions where the P2P application uses the underlying routing information for the peer selection. These works put a lot of focus on improving the application performance, but take to a little extent into account how the ISPs are affected. In this paper we propose a framework to measure the effects of the peer-selection mechanism, not only on the P2P application performance, but also on the economy of different types of ISPs. We categorize all ISPs into three groups; core, transit and stub, depending on their position in the global Internet hierarchy. Using our proposed framework, we analyze the performance of different peer-selection algorithms.},
	author = {Shams, Saif and Paal Einar {Engelstad} and Kvalbein, Amund}
}
