TY - GEN
T1 - Incentive-compatible interdomain routing
AU - Feigenbaum, Joan
AU - Ramachandran, Vijay
AU - Sehapira, Michael
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
KW - Border Gateway Protocol (BGP)
KW - Distributed algorithmic mechanism design
KW - Interdomain routing
UR - http://www.scopus.com/inward/record.url?scp=33748713255&partnerID=8YFLogxK
U2 - 10.1145/1134707.1134722
DO - 10.1145/1134707.1134722
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:33748713255
SN - 1595932364
SN - 9781595932365
T3 - Proceedings of the ACM Conference on Electronic Commerce
SP - 130
EP - 139
BT - Proceedings of the 7th ACM Conference on Electronic Commerce 2006
PB - Association for Computing Machinery
T2 - 7th ACM Conference on Electronic Commerce
Y2 - 11 June 2006 through 15 June 2006
ER -