As peer-to-peer (P2P) emerges as a major paradigm for scalable network application design, it also exposes significant new challenges in achieving efficient and fair utilization of Internet network resources. Being largely network-oblivious, many P2P applications may lead to inefficient network resource usage and/or low application performance. In this paper, we propose a simple architecture called P4P to allow for more effective cooperative traffic control between applications and network providers. We conducted extensive simulations and real-life experiments on the Internet to demonstrate the feasibility and effectiveness of P4P. Our experiments demonstrated that P4P either improves or maintains the same level of application performance of native P2P applications, while, at the same time, it substantially reduces network provider cost compared with either native or latency-based localized P2P applications.

/pdf/p4p-provider-portal-for-applications-4foy7f5uio.pdf

P4p: provider portal for applications

Caching in information centric networking: A survey

Peer-to-peer (P2P) file sharing systems generate a major portion of the Internet traffic, and this portion is expected to increase in the future. We explore the potential of deploying proxy caches in different autonomous systems (ASes) with the goal of reducing the cost incurred by Internet service providers and alleviating the load on the Internet backbone. We conduct an eight-month measurement study to analyze the P2P traffic characteristics that are relevant to caching, such as object popularity, popularity dynamics, and object size. Our study shows that the popularity of P2P objects can be modeled by a Mandelbrot-Zipf distribution, and that several workloads exist in P2P traffic. Guided by our findings, we develop a novel caching algorithm for P2P traffic that is based on object segmentation, and proportional partial admission and eviction of objects. Our trace-based simulations show that with a relatively small cache size, a byte hit rate of up to 35% can be achieved by our algorithm, which is close to the byte hit rate achieved by an off-line optimal algorithm with complete knowledge of future requests. Our results also show that our algorithm achieves a byte hit rate that is at least 40% more, and at most triple, the byte hit rate of the common Web caching algorithms. Furthermore, our algorithm is robust in face of aborted downloads, which is a common case in P2P systems.

/pdf/traffic-modeling-and-proportional-partial-caching-for-peer-33p2l4xl7w.pdf

Traffic modeling and proportional partial caching for peer-to-peer systems

Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions

Peer-to-Peer (P2P) networks enable users to directly share digital content (such as audio, video, and text files) as well as real-time data (such as telephony traffic) with other users without depending on a central server. Although originally popularized by unlicensed online music services such as Napster, P2P networking has recently emerged as a viable multimillion dollar business model for the distribution of academic and clinical information, telecommunications, and social networking. Written at an accessible level for any reader familiar with fundamental Internet protocols, Peer-to-Peer Networking and Applications explains the conceptual operations and architecture underlying basic P2P systems using well-known commercial systems as models. The book also delineates the latest research directions, thereby providing not only a sophisticated understanding of current systems, but also the means to improve upon these systems with innovations that will better performance, security, and flexibility. Peer-to-Peer Networking and Applications is thus both a valuable starting point and an important reference to those practioners employed by any of the 200 companies with approximately $400 million invested in this new and lucrative technology.



Uses well-known commercial P2P systems as models, thus demonstrating real-world applicability.

Discusses how current research trends in wireless networking, high-def content, DRM, etc. will intersect with P2P, allowing readers to account for future developments in their designs.

Provides online access to the Overlay Weaver P2P emulator, an open-source tool that supports a number of peer-to-peer applications with which readers can practice.

P2P Networking and Applications

Peer-to-peer (P2P) file-sharing applications generate a large part if not most of today's Internet traffic. The large volume of this traffic (thus the high potential benefits of caching) and the large cache sizes required (thus nontrivial costs associated with caching) only underline that efficient cache replacement policies are important in this case. P2P file-sharing traffic has several characteristics that distinguish it from well studied Web traffic and that require a focused study of efficient cache management policies. This paper uses trace driven simulations to compare traditional cache replacement policies with new policies that try to exploit characteristics of the P2P file-sharing traffic generated by applications using the FastTrack protocol.

/pdf/cache-replacement-policies-revisited-the-case-of-p2p-traffic-d1e026ax3m.pdf

R. Wozniak

Papers

Cache replacement policies revisited: the case of P2P traffic