skip to main content
10.1145/1544012.1544082acmconferencesArticle/Chapter ViewAbstractPublication PagesconextConference Proceedingsconference-collections
research-article

MINT: a Market for INternet Transit

Published: 09 December 2008 Publication History

Abstract

Today's Internet's routing paths are inefficient with respect to both connectivity and the market for interconnection. The former manifests itself via needlessly long paths, de-peering, etc. The latter arises because of a primitive market structure that results in unfulfilled demand and unused capacity. Today's networks make pairwise, myopic interconnection decisions based on business considerations that may not mirror considerations of the edge networks (or end systems) that would benefit from the existence of a particular interconnection. These bilateral contracts are also complex and difficult to enforce.
This paper proposes MINT, a market structure and routing protocol suite that facilitates the sale and purchase of end-to-end Internet paths. We present MINT's structure, explain how it improves connectivity and market efficiency, explore the types of connectivity that might be exchanged (vs. today's "best effort" connectivity), and argue that MINT's deployment is beneficial to both stub networks and transit providers. We discuss research challenges, including the design both of the protocol that maintains information about connectivity and of the market clearing algorithms. Our preliminary evaluation shows that such a market quickly reaches equilibrium and exhibits price stability.

References

[1]
Arbinet. http://www.arbinet.com.
[2]
Band-X. http://www.band-x.com.
[3]
Group Suggests an Exchange to Trade Internet Capacity. http://www.nytimes.com/2008/06/30/technology/30byte.html.
[4]
Peering Database. http://www.peeringdb.com.
[5]
C&W Briefly Drops Peering Agreement with PSINet. http://www.isp-planet.com/news/2001/psinet_cw.html, June 2001.
[6]
M. Afergan and J. Wroclawski. On the Benefits and Feasibility of Incentive Based Routing Infrastructure. In PINS, Portland, OR, 2004.
[7]
Alin Popescu and Todd Underwood. D(3) Peered: Just the Facts Maam. A Technical Review of Level (3)s Depeering of Cogent. In NANOG 35, Oct. 2005.
[8]
A. Ayyangar, K. Kompella, J. Vasseur, and A. Farrel. Label Switched Path Stitching with Generalized Multiprotocol Label Switching Traffic Engineering (GMPLS TE). Internet Engineering Task Force, Feb. 2008. RFC 5150.
[9]
Cisco Optimized Edge Routing (OER). http://www.cisco.com/en/US/products/ps6628/products_ios_protocol_option_home.html, 2006.
[10]
Cisco Visual Networking Index. http://newsroom.cisco.com/visualnetworkingindex/.
[11]
D. D. Clark. A model for cost allocation and pricing in the nternet. In Proc. MIT Workshop on Internet Economics, Mar. 1995.
[12]
B. Davie and Y. Rekhter. MPLS: Technology and Applications. Academic Press, San Diego, CA, 2000.
[13]
Equinix Direct. http://www.equinix.com/prod_serv/network/ed.htm, 2007.
[14]
C. Estan, A. Akella, and S. Banerjee. Achieving Good End-to-End Service Using Bill-Pay. In Proc. 5th ACM Workshop on Hot Topics in Networks (Hotnets-V), Irvine, CA, Nov. 2006.
[15]
C. Estan, A. Akella, and S. Banerjee. A la carte: An Economic Framework for Multi-ISP Service Quality. Technical report, University of Wisconsin, Mar. 2007.
[16]
A. Farrel, J. Vasseur, and J. Ash. A Path Computation Element (PCE)-Based Architecture. Internet Engineering Task Force, Aug. 2006. RFC 4655.
[17]
Internap. http://www.internap.com/, 2006.
[18]
Invisible Hand Networks. http://www.invisiblehand.net/.
[19]
D. Katc, K. Kompella, and D. Yeung. Traffic Engineering (TE) Extensions to OSPF Version 2. Internet Engineering Task Force, Sept. 2003. RFC 3630.
[20]
F. P. Kelly. Charging and rate control for elastic traffic. European Transactions on Telecommunications, 8: 33--37, 1997.
[21]
F. P. Kelly, A. K. Maulloo, and D. K. Tan. Rate control for communication networks: shadow prices, proportional fairness, and stability. Journal of the Operational Research Society, 49: 237--252, 1998.
[22]
J. K. MacKie-Mason and H. R. Varian. Pricing the Internet. In B. Kahin and J. Keller, editors, Public Access to the Internet, pages 269--314. MIT Press, Cambridge, Massachusetts, 1995.
[23]
Martin A. Brown and Alin Popescu and Earl Zmijewski. Peering Wars: Lessons Learned from the Cogent-Telia De-peering. In NANOG 43, June 2008.
[24]
A. M. Odlyzko. Paris Metro Pricing for the Internet. In Proceedings of the ACM Conference on Electronic Commerce (EC), pages 140--147, 1999.
[25]
S. Parsons et al. Everything you wanted to know about double auctions but were afraid to (bid or) ask). http://www.sci.brooklyn.cuny.edu/~parsons/projects/mech-design/publications/cda.pdf.2006.
[26]
R. Raszuk. Mpls traffic engineering overview. http://www.nanog.org/mtg-0002/robert.html, Feb. 2000. NANOG18.
[27]
Y. Rekhter, T. Li, and S. Hares. A Border Gateway Protocol 4 (BGP-4). Internet Engineering Task Force, Jan. 2006. RFC 4271.
[28]
R. Srikant. The Mathematics of Internet Congestion Control. Birkhauser, Boston, Massachusetts, 2004.
[29]
H. Wang, R. Karri, M. Veeraraghavan, and T. Li. A hardware-accelerated implementation of the RSVP-TE signaling protocol. In Proc. IEEE International Conference on Communications, June 2004.
[30]
Z.-L. Zhang. Decoupling QoS control from core routers: A novel bandwidth broker architecture for scalable support of guaranteed services. In Proc. ACM SIGCOMM, pages 71--83, Stockholm, Sweden, Sept. 2000.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
CoNEXT '08: Proceedings of the 2008 ACM CoNEXT Conference
December 2008
526 pages
ISBN:9781605582108
DOI:10.1145/1544012
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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 December 2008

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Acceptance Rates

Overall Acceptance Rate 198 of 789 submissions, 25%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 24 Dec 2024

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media