Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Caching P2P traffic: What are the benefits for an ISP?
Carlinet Y., Debar H., Gourhant Y., Mé L.  ICN 2010 (Proceedings of the 2010 9th International Conference on Networks, Menuires, The Three Valleys, French Alps, France, Apr 11-16, 2010)376-383.2010.Type:Proceedings
Date Reviewed: Mar 3 2011

Optimizing peer-to-peer (P2P) network performance from an Internet service provider’s (ISP’s) point of view is a current topic of interest in the systems and networking domain. Essentially, the optimization consists of choosing local peers in a P2P network among which to exchange data. This reduces transit traffic and has the net effect of saving monetary costs for the ISP and increasing the quality of experience (QoE) for the user (QoE is an elastic term--defined from the viewpoint of a user involved in downloading P2P content, it translates into minimizing the delay in getting the content).

One way to optimize P2P performance is by using caches in the network. The questions here translate to how big the cache should be, how to quantify the bandwidth saved, and where it should be deployed in the network. Should the cache be active or passive?

In this paper, Carlinet et al. attempt to provide answers for these questions. They monitor live traffic in an ISP’s network for nine months and characterize the portion of traffic that used the eDonkey P2P protocol for data exchange. They find out that the file popularity follows a Mandelbrot-Zipf law; in their particular case, the most popular file was downloaded by 83 customers (out of the 7,012 customers who used eDonkey in their data). To determine the bandwidth savings, the authors use an analytical model, which shows theoretical savings of 48.6 percent of the total eDonkey traffic; that is, 48.6 percent of the traffic stayed local, which--in the absence of caches--would have caused transit costs to the ISP and a degraded QoE to the users, as the querying peer would have had to contact nonlocal peers to get chunks of the file. The empirical data collected indicates that a passive caching strategy saves 21 percent of the total P2P traffic, while the active caching strategy actually consumes more bandwidth than it saves. The reason for this, as their real-life trace shows, is that the users did not completely download every file they started to download.

The rest of the results follow from intuition: active caches are better than passive caches, but may consume more bandwidth; if an ISP is deploying active caches, then the behavior of the user population should be taken into account (the ISP should make sure that the users are intent on completing each download they start). The larger the cache size, the more it will be used (in a trace-driven simulation, Carlinet et al. found that a cache size greater than 7 TB served 332 GB of data, with a hit ratio of 4.8 percent, on a user population of 7,012 users). Finally, the placement of the cache should maximize the number of people using it (for instance, it could be tied to the edge router).

Reviewer:  Vijay Gurbani Review #: CR138863 (1110-1049)
Bookmark and Share
  Reviewer Selected
 
 
Peer-to-Peer Computing (C.2.1 ... )
 
 
Public Networks (C.2.3 ... )
 
 
Distributed Systems (C.2.4 )
 
Would you recommend this review?
yes
no
Other reviews under "Peer-to-Peer Computing": Date
Peer-assisted view-dependent progressive mesh streaming
Cheng W., Liu D., Ooi W.  MM 2009 (Proceedings of the 17th ACM International Conference on Multimedia, Beijing, China, Oct 19-24, 2009)441-450, 2009. Type: Proceedings
May 12 2010
Benefit based cache data placement and update for mobile peer to peer networks
Ye F., Li Q., Chen E. World Wide Web 14(3): 243-259, 2011. Type: Article
Jun 30 2011
Peer-to-peer computing: applications, architecture, protocols, and challenges
Kwok Y., CRC Press, Inc., Boca Raton, FL, 2011.  216, Type: Book (978-1-439809-34-1)
Jan 31 2012
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy