skip to main content
10.1145/1134707.1134722acmconferencesArticle/Chapter ViewAbstractPublication PagesecConference Proceedingsconference-collections
Article

Incentive-compatible interdomain routing

Published: 11 June 2006 Publication History

Abstract

The routing of traffic between Internet domains, or Autonomous Systems (ASes), a task known as interdomain routing, is currently handled by the Border Gateway Protocol (BGP) [17]. Using BGP, autonomous systems can apply semantically rich routing policies to choose interdomain routes in a distributed fashion. This expressiveness in routing-policy choice supports domains' autonomy in network operations and in business decisions, but it comes at a price: The interaction of locally defined routing policies can lead to unexpected global anomalies, including route oscillations or overall protocol divergence (see, e.g., [20]). Networking researchers have addressed this problem by devising constraints on policies that guarantee BGP convergence without unduly limiting expressiveness and autonomy (see, e.g., [7, 8]).In addition to taking this engineering or "protocol-design" approach, researchers have approached interdomain routing from an economic or "mechanism-design" point of view. It is known that lowest-cost-path (LCP) routing can be implemented in a truthful, BGP-compatible manner [3] but that several other natural classes of routing policies cannot [2, 5]. In this paper, we present a natural class of interdomain-routing policies that is more realistic than LCP routing and admits incentive-compatible, BGP-compatible implementation. We also present several positive steps toward a general theory of incentive-compatible interdomain routing.

References

[1]
M. Caesar and J. Rexford. BGP Policies in ISP Networks. IEEE Network Magazine 19(6):5--11, Nov. 2005.
[2]
J. Feigenbaum, D. Karger, V. Mirrokni, and R. Sami. Subjective-Cost Policy Routing. In Proc. Wshp. Internet and Network Economics (WINE), pp. 174--183, LNCS vol. 3828. Springer-Verlag, Dec. 2005.
[3]
J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker. A BGP-based Mechanism for Lowest-Cost Routing. Distributed Computing 18(1):61--72, Jul. 2005.
[4]
J. Feigenbaum, V. Ramachandran, and M. Schapira. Incentive-Compatible Interdomain Routing (full version). Yale Univ. Tech. Report 1342. ftp://ftp.cs.yale.edu/pub/TR/tr1342.pdf.
[5]
J. Feigenbaum, R. Sami, and S. Shenker. Mechanism Design for Policy Routing. In Proc. 23rd Symp. Principles of Distributed Computing (PODC'04), pp. 11--20, ACM Press, Jul. 2004.
[6]
L. Gao, T. G. Griffin, and J. Rexford. Inherently Safe Backup Routing with BGP. In Proc. IEEE INFOCOM'01, pp. 547--556. IEEE Computer Society, Apr. 2001.
[7]
L. Gao and J. Rexford. Stable Internet Routing without Global Coordination. IEEE/ACM Trans. Networking 9(6):681--692, Dec. 2001.
[8]
T. G. Griffin, A. D. Jaggard, and V. Ramachandran. Design Principles of Policy Languages for Path Vector Protocols. In Proc. ACM SIGCOMM'03, pp. 61--72. ACM Press, Aug. 2003.
[9]
T. G. Griffin, F. B. Shepherd, and G. Wilfong. Policy Disputes in Path Vector Protocols. In Proc. 7th Int'l Conf. Network Protocols (ICNP), pp. 21--30. IEEE Computer Society, Nov. 1999.
[10]
T. G. Griffin, F. B. Shepherd, and G. Wilfong. The Stable Paths Problem and Interdomain Routing. IEEE/ACM Trans. Networking 10(2):232--243, Apr. 2002.
[11]
J. Green and J. Laffont. Incentives in Public Decision Making. In Studies in Public Economics, vol. 1, pp. 65--78. North Holland, Amsterdam, 1979.
[12]
J. Hershberger and S. Suri. Vickrey Prices and Shortest Paths: What is an edge worth? In Proc. 42nd Symp. Foundations of Computer Science (FOCS), pp. 129--140. IEEE Computer Society, 2001.
[13]
G. Huston. Interconnection, Peering, and Settlements. In Proc. Internet Global Summit (INET). The Internet Society, Jun. 1999.
[14]
E. Koutsoupias and C. H. Papadimitriou. Worst-case Equilibria. In Proc. 16th Symp. Theoretical Aspects of Computer Science (STACS), pp. 387--396, LNCS vol. 1563 (G. Meinel and S. Tison, eds.). Springer-Verlag, Mar. 1999.
[15]
J. Moy. Open Shortest Pouting First (OSPF) version 2. RFC 2328. Internet Engineering Task Force (IETF), Apr. 1998.
[16]
N. Nisan and A. Ronen. Algorithmic Mechanism Design. Games and Economic Behavior 35(1,2):166--196, 2001.
[17]
Y. Rekhter and T. Li. A Border Gateway Protocol (BGP-4). RFC 1771. Internet Engineering Task Force (IETF), Mar. 1995.
[18]
J. Shneidman and D. C. Parkes. Specification Faithfulness in Networks with Rational Nodes. In Proc. 23rd ACM Symp. Principles of Distributed Computing (PODC'04), pp. 88--97, ACM Press, Jul. 2004.
[19]
J. L. Sobrinho. An Algebraic Theory of Dynamic Network Routing. IEEE/ACM Trans. Networking 13(5):1160--1173, Oct. 2005.
[20]
K. Varadhan, R. Govindan, and D. Estrin. Persistent Route Oscillations in Interdomain Routing. Computer Networks 32(1):1--16, Jan. 2000.

Cited By

View all
  • (2021)Enabling Novel Interconnection Agreements with Path-Aware Networking Architectures2021 51st Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)10.1109/DSN48987.2021.00027(116-128)Online publication date: Jun-2021
  • (2017)Stabilizing BGP through distributed elimination of recurrent routing loops2017 IEEE 25th International Conference on Network Protocols (ICNP)10.1109/ICNP.2017.8117560(1-10)Online publication date: Oct-2017
  • (2014)An economic analysis of routing conflict and its resolutionPerformance Evaluation10.1016/j.peva.2013.09.00471(25-43)Online publication date: 1-Jan-2014
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
EC '06: Proceedings of the 7th ACM conference on Electronic commerce
June 2006
342 pages
ISBN:1595932364
DOI:10.1145/1134707
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: 11 June 2006

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. border gateway protocol (BGP)
  2. distributed algorithmic mechanism design
  3. interdomain routing

Qualifiers

  • Article

Conference

EC06
Sponsor:
EC06: ACM Conference on Electronic Commerce
June 11 - 15, 2006
Michigan, Ann Arbor, USA

Acceptance Rates

Overall Acceptance Rate 664 of 2,389 submissions, 28%

Upcoming Conference

EC '25
The 25th ACM Conference on Economics and Computation
July 7 - 11, 2025
Stanford , CA , USA

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2021)Enabling Novel Interconnection Agreements with Path-Aware Networking Architectures2021 51st Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)10.1109/DSN48987.2021.00027(116-128)Online publication date: Jun-2021
  • (2017)Stabilizing BGP through distributed elimination of recurrent routing loops2017 IEEE 25th International Conference on Network Protocols (ICNP)10.1109/ICNP.2017.8117560(1-10)Online publication date: Oct-2017
  • (2014)An economic analysis of routing conflict and its resolutionPerformance Evaluation10.1016/j.peva.2013.09.00471(25-43)Online publication date: 1-Jan-2014
  • (2014)How secure are secure interdomain routing protocols?Computer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2014.05.00770(260-287)Online publication date: 1-Sep-2014
  • (2014)Double-sided auctions applied to vertical handover for mobility management in wireless networksJournal of Network and Systems Management10.1007/s10922-013-9269-122:4(658-681)Online publication date: 1-Oct-2014
  • (2013)A survey of interdomain routing policiesACM SIGCOMM Computer Communication Review10.1145/2567561.256756644:1(28-34)Online publication date: 31-Dec-2013
  • (2013)What's a little collusion between friends?Proceedings of the 2013 ACM symposium on Principles of distributed computing10.1145/2484239.2484242(240-249)Online publication date: 22-Jul-2013
  • (2013)Participation Incentives in BGPInternet Naming and Discovery10.1007/978-1-4471-4552-3_8(105-129)Online publication date: 2013
  • (2013)On the Economics of Identifier-Based DiscoveryInternet Naming and Discovery10.1007/978-1-4471-4552-3_7(91-103)Online publication date: 2013
  • (2012)A theory for the connectivity discovered by routing protocolsIEEE/ACM Transactions on Networking10.1109/TNET.2011.216508020:3(677-689)Online publication date: 1-Jun-2012
  • Show More Cited By

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