Mechanism design for policy routing

Authors:
Joan Feigenbaum;Rahul Sami;Scott Shenker
Affiliations:
Yale University, Computer Science Department, New Haven, CT;MIT CS&AI Laboratory, Cambridge, MA;ICSI & University of California at Berkeley, EECS Department, Berkeley, CA
Venue:
Distributed Computing - Special issue: PODC 04
Year:
2006

Citing 9
Cited 7

Frugal path mechanisms

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Sharing the cost of multicast transmissions

Journal of Computer and System Sciences - Special issue on Internet algorithms
Distributed algorithmic mechanism design: recent results and future directions

DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
A BGP-based mechanism for lowest-cost routing

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Vickrey Prices and Shortest Paths: What is an Edge Worth?

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Frugality in path auctions

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time

Journal of the ACM (JACM)
Distributed algorithmic mechanism design

Distributed algorithmic mechanism design
Mechanism design for policy routing

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing

Subjective-cost policy routing

Theoretical Computer Science
Interdomain routing and games

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Rationality and traffic attraction: incentives for honest path announcements in bgp

Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Incentive-compatible interdomain routing with linear utilities

WINE'07 Proceedings of the 3rd international conference on Internet and network economics
YAMR: yet another multipath routing protocol

ACM SIGCOMM Computer Communication Review
On the stability of interdomain routing

ACM Computing Surveys (CSUR)
Interdomain Routing and Games

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Border Gateway Protocol (BGP) for inter-domain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these preferences as arising from an AS's underlying utility for each route and study the problem of finding a set of routes that maximizes the overall welfare (i.e., the sum of all ASes' utilities for their selected routes).We show that, if the utility functions are unrestricted, this problem is NP-hard even to approximate closely. We then study a natural class of restricted utilities that we call next-hop preferences. We present a strategyproof, polynomial-time computable mechanism for welfare-maximizing routing over this restricted domain. However, we show that, in contrast to earlier work on lowest-cost routing mechanism design, this mechanism appears to be incompatible with BGP and hence difficult to implement in the context of the current Internet. Our contributions include a new complexity measure for Internet algorithms, dynamic stability, which may be useful in other problem domains.