Internet and Network Economics
Volume 3828 of the series Lecture Notes in Computer Science pp 174-183
Subjective-Cost Policy Routing
- Joan FeigenbaumAffiliated withComputer Science Department, Yale University
- , David R. KargerAffiliated withMIT Computer Science and Artificial Intelligence Laboratory
- , Vahab S. MirrokniAffiliated withMIT Computer Science and Artificial Intelligence Laboratory
- , Rahul SamiAffiliated withSchool of Information, University of Michigan
Abstract
We study a model of interdomain routing in which autonomous systems’ (ASes’) routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requirement that all routes to a given destination must be confluent. We show that it is NP-hard to determine whether there is a set of stable routes. We also show that it is NP-hard to find a set of confluent routes that minimizes the total subjective cost; it is hard even to approximate minimum cost closely. These hardness results hold even for very restricted classes of subjective costs.
We then consider a model in which the subjective costs are based on the relative importance ASes place on a small number of objective cost measures. We show that a small number of confluent routing trees is sufficient for each AS to have a route that nearly minimizes its subjective cost. We show that this scheme is trivially strategyproof and that it can be computed easily with a distributed algorithm that does not require major changes to the Border Gateway Protocol. Furthermore, we prove a lower bound on the number of trees required to contain a (1 + ε)-approximately optimal route for each node and show that our scheme is nearly optimal in this respect.
- Title
- Subjective-Cost Policy Routing
- Book Title
- Internet and Network Economics
- Book Subtitle
- First International Workshop, WINE 2005, Hong Kong, China, December 15-17, 2005. Proceedings
- Pages
- pp 174-183
- Copyright
- 2005
- DOI
- 10.1007/11600930_18
- Print ISBN
- 978-3-540-30900-0
- Online ISBN
- 978-3-540-32293-1
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- 3828
- Series ISSN
- 0302-9743
- Publisher
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Topics
- Industry Sectors
- eBook Packages
- Editors
-
- Xiaotie Deng (16)
- Yinyu Ye (17)
- Editor Affiliations
-
- 16. Department of Computer Science, City University of Hong Kong
- 17. Stanford University
- Authors
-
- Joan Feigenbaum (18)
- David R. Karger (19)
- Vahab S. Mirrokni (19)
- Rahul Sami (20)
- Author Affiliations
-
- 18. Computer Science Department, Yale University, 51 Prospect St., New Haven, CT, 06520, USA
- 19. MIT Computer Science and Artificial Intelligence Laboratory, 32 Vassar St, Cambridge, MA, 02139, USA
- 20. School of Information, University of Michigan, 1075 Beal Ave., Ann Arbor, MI, 48109, USA
Continue reading...
To view the rest of this content please follow the download PDF link above.