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.
This work was supported by the DoD University Research Initiative (URI) administered by the Office of Naval Research under Grant N00014-01-1-0795.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Varadhan, K., Govindan, R., Estrin, D.: Persistent route oscillations in inter-domain routing. Technical Report 96-631, USC/ISI (1996)
Griffin, T., Wilfong, G.: An analysis of BGP convergence properties. In: Proceedings of ACM SIGCOMM 1999, pp. 277–288 (1999)
Griffin, T., Shepherd, B., Wilfong, G.: The stable paths problem and interdomain routing. IEEE/ACM Transactions on Networking 10, 232–243 (2002)
Feamster, N., Johari, R., Balakrishnan, H.: The implications of autonomy for stable policy routing. In: Proceedings of the ACM SIGCOMM Conference (SIGCOMM 2005), pp. 25–36 (2005)
Feigenbaum, J., Sami, R., Shenker, S.: Mechanism design for policy routing. In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC 2004), pp. 11–20 (2004)
Gao, L., Rexford, J.: Stable internet routing without global coordination. IEEE/ACM Transactions on Networking 9, 681–692 (2001)
Feigenbaum, J., Papadimitriou, C., Sami, R., Shenker, S.: A BGP-based mechanism for lowest-cost routing. Distributed Computing 18, 61–72 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feigenbaum, J., Karger, D.R., Mirrokni, V.S., Sami, R. (2005). Subjective-Cost Policy Routing. In: Deng, X., Ye, Y. (eds) Internet and Network Economics. WINE 2005. Lecture Notes in Computer Science, vol 3828. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11600930_18
Download citation
DOI: https://doi.org/10.1007/11600930_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30900-0
Online ISBN: 978-3-540-32293-1
eBook Packages: Computer ScienceComputer Science (R0)