Abstract
The popularity of Peer-to-Peer (P2P) file sharing has resulted in large flows between different ISPs, which imposes significant transit fees on the ISPs in whose domains the communicating peers are located. The fundamental tradeoff faced by a peer-swarm is between free, yet delayed content exchange between intra-domain peers, and inter-domain communication of content, which results in transit fees. This dilemma is complex, since peers who possess the content dynamically increase the content capacity of the ISP domain to which they belong.
In this paper, we study the decision problem faced by peer swarms as a routing-in-time problem with time-varying capacity. We begin with a system of two swarms, each belonging to a different ISP: One swarm that has excess service capacity (a steady-state swarm) and one that does not (a transient swarm). We propose an asymptotically accurate fluid-approximation for the stochastic system, and explicitly obtain the optimal policy for the transient swarm in the fluid regime.
We then consider the more complex case where multiple transient swarms compete for service from a single steady-state swarm. We utilize a proportional-fairness mechanism for allocating capacity between swarms, and study its performance as a non-cooperative game. We characterize the resulting Nash equilibrium, and study its efficiency both analytically and numerically. Our results indicate that while efficiency loss incurs due to selfish decision-making, the actual Price of Anarchy (PoA) remains bounded even for a large number of competing swarms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Fraleigh, C., Moon, S., Lyle, B., Cotton, C., Khan, M., Moll, D., Rockell, R., Seely, T., Diot, C.: Packet-level traffic measurements from the Sprint IP backbone. IEEE Network Magazine 17(6), 6–16 (2003)
Gummadi, K.P., Dunn, R.J., Saroiu, S., Gribble, S.D., Levy, H.M., Zahorjan, J.: Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. In: Proc. SOSP (October 2003)
Bangeman, E.: P2P responsible for as much as 90 percent of all Net traffic. ArsTechnica, September 3 (2007)
Labovitz, C., McPherson, D., Iekel-Johnson, S.: 2009 Internet Observatory report. In: NANOG-47 (October 2009)
PPLive (2009), http://www.pplive.com/
QQLive (2009), http://www.qqlive.com/
Reddy, V., Kim, Y., Shakkottai, S., Reddy, A.L.N.: MultiTrack: A Delay and Cost Aware P2P Overlay Architecture. In: ACM SIGMETRICS as a poster, Seattle, WA (June 2009)
Huston, G.: ISP Survival Guide: Stratagies for Running a Competitive ISP. John Wiley and Sons, New York (1999)
Broache, A.: FCC chief grills Comcast on BitTorrent blocking. C|Net News.com, February 25 (2008)
BitTorrent (2005), http://www.bittorrent.com/
Yang, X., de Veciana, G.: Performance of Peer-to-Peer Networks: Service Capacity and Role of Resource Sharing Policies. In: Performance Evaluation: Special Issue on Performance Modeling and Evaluation of P2P Computing Systems, vol. 63 (2006)
Qiu, D., Srikant, R.: Modeling and performance analysis of BitTorrent-like peer-to-peer networks. In: Proc. ACM SIGCOMM, Portland, Oregon, USA (August 2004)
Shakkottai, S., Johari, R.: Demand Aware Content Distribution on the Internet. IEEE/ACM Transactions on Networking 18(2), 476–489 (2010)
Aggarwal, V., Feldmann, A., Scheideler, C.: Can ISPs and P2P users cooperate for improved performance? ACM Computer Communication Review 37(3) (July 2007)
Xie, H., Yang, Y.R., Krishnamurthy, A., Liu, Y., Silberschatz, A.: P4P: Portal for P2P applications. In: Proc. ACM SIGCOMM (August 2008)
Choffnes, D.R., Bustamante, F.: Taming the torrent: A practical approach to reducing cross-ISP traffic in p2p systems. In: Proc. ACM SIGCOMM, Seattle, WA (August 2008)
Aperjis, C., Freedman, M.J., Johari, R.: Peer-assisted content distribution with prices. In: Proc. 4th ACM SIGCOMM Conference on emerging Networking EXperiments and Technologies, CoNext 2008 (December 2008)
Menasché, D.S., Massoulié, L., Towsley, D.F.: Reciprocity and barter in peer-to-peer systems. In: INFOCOM 2010, San Diego, CA (2010)
Kelly, F.P.: Charging and rate control for elastic traffic. European Transactions on Telecommunications 8, 33–37 (1997)
Johari, R., Tsitsiklis, J.N.: Efficiency loss in a network resource allocation game. Mathematics of Operations Research 29, 407–435 (2004)
Roughgarden, T., Tardos, E.: How bad is selfish routing? In: IEEE Symposium on Foundations of Computer Science, pp. 93–102 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Parag, P., Shakkottai, S., Menache, I. (2012). Service Routing in Multi-ISP Peer-to-Peer Content Distribution: Local or Remote?. In: Jain, R., Kannan, R. (eds) Game Theory for Networks. GameNets 2011. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 75. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30373-9_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-30373-9_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30372-2
Online ISBN: 978-3-642-30373-9
eBook Packages: Computer ScienceComputer Science (R0)