Abstract
The stable-paths problem is an abstraction of the basic functionality of the Internet’s BGP routing protocol. It has received considerable attention due to instabilities observed in BGP. In this abstraction, each node informs its neighboring nodes of its current path to the destination node. From the paths received from its neighbors, each node chooses the best path according to some local routing policy. However, since routing policies are chosen locally, conflicts may occur between nodes, resulting in unstable behavior. Deciding if a set of routing policies is stable is NP-hard. Thus, current solutions involve restricting routing policies to avoid instabilities, while maintaining enough flexibility for the routing policies to be useful. Recently, path-categories have been introduced. E.g., a simple system consists of a category of regular paths, and a category of backup paths. By combining path-categories into a total order (regular paths have higher priority than backup paths), it has been shown that the resulting system is stable if each category by itself is stable. In this paper, we relax the total-order of categories into a partial-order, and thus provide greater flexibility of routing choices at each node. We extend the definition of the stable-paths problem to allow such flexibility, and show that if each category is stable in itself, then the whole system is stable. In addition, we show an upper bound on the convergence time of the whole system provided each category in itself has a bounded convergence time.
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
Ee, C.T., Ramachandran, V., Chun, B., Lakshminarayanan, K., Shenker, S.: Resolving inter-domain policy disputes. In: Proceedings of the 2007 ACM SIGCOMM Conference, Kyoto, Japan, Augustm (2007)
Cobb, J.A.: Maintaining Safety in Interdomain Routing with Hierarchical Path-Categories, Technical Report, Department of Computer Science, The University of Texas at Dallas
Cobb, J.A., Musunuri, R.: Enforcing convergence in inter-domain routing. In: Global Telecommunications Conference, IEEE GLOBECOM, pp. 1353–1358 (November 2004)
Feamster, N., Johari, R., Balakrishnan, H.: Implications of autonomy for the expressiveness of policy routing. In: Proceedings of the 2005 SIGCOMM Conference, October 2005, pp. 25–36 (2005)
Labovitz, C., Malan, G., Jahanian, F.: Internet Routing Instability. In: Proceedings of ACM SIGCOMM (September 1997)
Cobb, J.A., Gouda, M.G., Musunuri, R.: A Stabilizing Solution to the Stable Path Problem. In: Huang, S.-T., Herman, T. (eds.) SSS 2003. LNCS, vol. 2704, pp. 169–183. Springer, Heidelberg (2003)
Gao, L., Rexford, J.: Stable Internet Routing Without Global Coordination. IEEE/ACM Transactions on Networking 9(6) (December 2001)
Gao, L., Rexford, J.: Stable Internet Routing Without Global Coordination. In: Proc. of the ACM SIGMETRICS (June 2000)
Gao, L., Griffin, T.G., Rexford, J.: Inherently safe backup routing with BGP. In: IEEE INFOCOM 2001, Proceedings of Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 1, pp. 547–556 (2001)
Griffin, T.G., Shepherd, F.B., Wilfong, G.: Policy Disputes in Path Vector Protocols. In: Proc. of the IEEE Int’l Conf. on Net. Protocols (October 1999)
Griffin, T.G., Shepherd, F.B., Wilfong, G.: The Stable Paths Problem and Interdomain Routing. IEEE/ACM Tran. on Networking 10(2) (April 2002)
Griffin, T.G., Wilfong, G.: A Safe Path Vector Protocol. In: Proc. of the INFOCOM Conference (2000)
Griffin, T.G., Wilfong, G.: An Analysis of BGP Convergence Properties. In: Proc. of the ACM SIGCOMM Conf. (1999)
Rekhtar, Y., Li, T.: A Border Gateway Protocol. RFC1771 (1995)
Varadhan, K., Govindan, R., Estrin, D.: Persistent Route Oscillations in Inter-Domain Routing. Computer Networks (January 2000)
McPherson, D., Gill, V., Walton, D., Retana, A.: IETF RFC-3345:Border Gateway Protocol (BGP) persistent route oscillation condition (August 2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cobb, J.A. (2010). Maintaining Safety in Interdomain Routing with Hierarchical Path-Categories. In: Kant, K., Pemmaraju, S.V., Sivalingam, K.M., Wu, J. (eds) Distributed Computing and Networking. ICDCN 2010. Lecture Notes in Computer Science, vol 5935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11322-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-11322-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11321-5
Online ISBN: 978-3-642-11322-2
eBook Packages: Computer ScienceComputer Science (R0)