Incentive-compatible interdomain routing

Joan Feigenbaum*, Vijay Ramachandran, Michael Sehapira

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

29 Scopus citations

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 over-all 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.

Original languageAmerican English
Title of host publicationProceedings of the 7th ACM Conference on Electronic Commerce 2006
PublisherAssociation for Computing Machinery
Pages130-139
Number of pages10
ISBN (Print)1595932364, 9781595932365
DOIs
StatePublished - 2006
Event7th ACM Conference on Electronic Commerce - Ann Arbor, MI, United States
Duration: 11 Jun 200615 Jun 2006

Publication series

NameProceedings of the ACM Conference on Electronic Commerce
Volume2006

Conference

Conference7th ACM Conference on Electronic Commerce
Country/TerritoryUnited States
CityAnn Arbor, MI
Period11/06/0615/06/06

Keywords

  • Border Gateway Protocol (BGP)
  • Distributed algorithmic mechanism design
  • Interdomain routing

Fingerprint

Dive into the research topics of 'Incentive-compatible interdomain routing'. Together they form a unique fingerprint.

Cite this