skip to main content
10.1145/2398776.2398830acmconferencesArticle/Chapter ViewAbstractPublication PagesimcConference Proceedingsconference-collections
research-article

Sharing the cost of backbone networks: cui bono?

Published:14 November 2012Publication History

ABSTRACT

We study the problem of how to share the cost of a backbone network among its customers. A variety of empirical cost-sharing policies are used in practice by backbone network operators but very little ever reaches the research literature about their properties. Motivated by this, we present a systematic study of such policies focusing on the discrepancies between their cost allocations. We aim at quantifying how the selection of a particular policy biases an operator's understanding of cost generation. We identify F-discrepancies due to the specific function used to map traffic into cost (e.g., volume vs. peak rate vs. 95-percentile) and M-discrepancies, which have to do with where traffic is metered (per device vs. ingress metering). We also identify L-discrepancies relating to the liability of individual customers for triggered upgrades and consequent costs (full vs. proportional), and finally, TCO-discrepancies emanating from the fact that the cost of carrying a bit is not uniform across the network (old vs. new equipment, high vs. low energy or real estate costs, etc.). Using extensive traffic, routing, and cost data from a tier-1 network we show that F-discrepancies are large when looking at individual links but cancel out when considering network-wide cost-sharing. Metering at ingress points is convenient but leads to large M-discrepancies, while TCO-discrepancies are huge. Finally, L-discrepancies are intriguing and esoteric but understanding them is central to determining the cost a customer inflicts on the network.

Skip Supplemental Material Section

Supplemental Material

References

  1. Aaron Archer, Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, and Scott Shenker. Approximation and collusion in multicast cost sharing. Games and Economic Behavior, 47(1):36 -- 71, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  2. Brice Augustin, Balachander Krishnamurthy, and Walter Willinger. Ixps: mapped? In Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference, IMC '09, pages 336--349, New York, NY, USA, 2009. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Bob Briscoe. Flow rate fairness: dismantling a religion. SIGCOMM Comput. Commun. Rev., 37(2):63--74, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Bob Briscoe. A Fairer, Faster Internet. IEEE Spectrum, 45(12):42--47, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Kenjiro Cho, Kensuke Fukuda, Hiroshi Esaki, and Akira Kato. The impact and implications of the growth in residential user-to-user traffic. SIGCOMM '06, pages 207--218, New York, NY, USA, 2006. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. David R. Choffnes and Fabián E. Bustamante. Taming the torrent: a practical approach to reducing cross-isp traffic in peer-to-peer systems. In Proceedings of the ACM SIGCOMM 2008 conference on Data communication, SIGCOMM '08, pages 363--374, New York, NY, USA, 2008. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. kc claffy. "network neutrality": the meme, its cost, its future. SIGCOMM Comput. Commun. Rev., 41(5):44--45. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. C. Courcoubetis and R. Weber. Pricing and Communications Networks. John Wiley & Sons, Ltd, 2003.Google ScholarGoogle Scholar
  9. Cushman & Wakefield. Office Space Across the World, 2012.Google ScholarGoogle Scholar
  10. A. Dhamdhere, C. Dovrolis, and P. Francois. A Value-based Framework for Internet Peering Agreements. In Teletraffic Congress (ITC), 2010 22nd International, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  11. Amogh Dhamdhere and Constantine Dovrolis. The internet is flat: modeling the transition from a transit hierarchy to a peering mesh. In Proceedings of the 6th International COnference, Co-NEXT '10, pages 21:1--21:12, New York, NY, USA, 2010. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Xenofontas Dimitropoulos, Paul Hurley, Andreas Kind, and Marc Stoecklin. On the 95-percentile billing method. In Sue Moon, Renata Teixeira, and Steve Uhlig, editors, Passive and Active Network Measurement, volume 5448 of Lecture Notes in Computer Science, pages 207--216. Springer Berlin, Heidelberg, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Joan Feigenbaum, Christos H. Papadimitriou, and Scott Shenker. Sharing the cost of multicast transmissions. Journal of Computer and System Sciences, 63(1):21 -- 41, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. L. Gyarmati, M. Sirivianos, and N. Laoutaris. Simplicity vs Precision: Sharing the Cost of Backbone Networks. In NetEcon 2012 - Seventh Workshop on the Economics of Networks, Systems, and Computation, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Nikolaos Laoutaris, Michael Sirivianos, Xiaoyuan Yang, and Pablo Rodriguez. Inter-datacenter bulk transfers with netstitcher. In Proceedings of the ACM SIGCOMM 2011 conference, SIGCOMM '11, pages 74--85, New York, NY, USA, 2011. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Nikolaos Laoutaris, Georgios Smaragdakis, Pablo Rodriguez, and Ravi Sundaram. Delay tolerant bulk data transfers on the internet. In Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems, SIGMETRICS '09, pages 229--238, New York, NY, USA, 2009. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Richard T. B. Ma, Dah ming Chiu, John C. S. Lui, Vishal Misra, and Dan Rubenstein. Internet economics: the use of shapley value for isp settlement. In Proceedings of the 2007 ACM CoNEXT conference, CoNEXT '07, pages 6:1--6:12, New York, NY, USA, 2007. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Richard T. B. Ma, Dah-ming Chiu, John C. S. Lui, Vishal Misra, and Dan Rubenstein. On cooperative settlement between content, transit and eyeball internet service providers. In Proceedings of the 2008 ACM CoNEXT Conference, CoNEXT '08, pages 7:1--7:12, New York, NY, USA, 2008. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Ratul Mahajan, David Wetherall, and Thomas Anderson. Negotiation-based routing between neighboring isps. In Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2, NSDI'05, pages 29--42, Berkeley, CA, USA, 2005. USENIX Association. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. M. Marcon, M. Dischinger, K.P. Gummadi, and A. Vahdat. The Local and Global effects of Traffic Shaping in the Internet. In Third International Conference on Communication Systems and Networks (COMSNETS), 2011.Google ScholarGoogle ScholarCross RefCross Ref
  21. Murtaza Motiwala, Amogh Dhamdhere, Nick Feamster, and Anukool Lakhina. Towards a cost model for network traffic. SIGCOMM Comput. Commun. Rev., 42(1):54--60. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Hervé Moulin and Scott Shenker. Strategyproof sharing of submodular costs:budget balance versus efficiency. Economic Theory, 18:511--533, 2001. 10.1007/PL00004200.Google ScholarGoogle ScholarCross RefCross Ref
  23. W. B. Norton. The Internet Peering Playbook: Connecting to the Core of the Internet. DrPeering Press, 2012.Google ScholarGoogle Scholar
  24. L. Qiu, V.N. Padmanabhan, and G.M. Voelker. On the Placement of Web Server Replicas. In IEEE INFOCOM, pages 1587--1596, 2001.Google ScholarGoogle Scholar
  25. L. S. Shapley. A value for n-person games. Annals of Mathematical Studies, 1953.Google ScholarGoogle ScholarCross RefCross Ref
  26. Gireesh Shrimali, Aditya Akella, and Almir Mutapcic. Cooperative interdomain traffic engineering using nash bargaining and decomposition. IEEE/ACM Trans. Netw., 18(2):341--352, April 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Rade Stanojevic, Ignacio Castro, and Sergey Gorinsky. Cipt: using tuangou to reduce ip transit costs. In Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies, CoNEXT '11, pages 17:1--17:12, New York, NY, USA, 2011. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Rade Stanojevic, Nikolaos Laoutaris, and Pablo Rodriguez. On economic heavy hitters: shapley value analysis of 95th-percentile pricing. In Proceedings of the 10th ACM SIGCOMM conference on Internet measurement, IMC '10, pages 75--80, New York, NY, USA, 2010. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. TeleGeography. Wholesale IP transit price database, http://www.telegeography.com/.Google ScholarGoogle Scholar
  30. Vytautas Valancius, Cristian Lumezanu, Nick Feamster, Ramesh Johari, and Vijay V. Vazirani. How many tiers?: pricing in the internet transit market. In Proceedings of the ACM SIGCOMM 2011 conference, SIGCOMM '11, pages 194--205, New York, NY, USA, 2011. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Sharing the cost of backbone networks: cui bono?

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        IMC '12: Proceedings of the 2012 Internet Measurement Conference
        November 2012
        572 pages
        ISBN:9781450317054
        DOI:10.1145/2398776

        Copyright © 2012 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 14 November 2012

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate277of1,083submissions,26%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader