Abstract
The stable path problem is an abstraction of the basic functionality of the Internet’s BGP routing protocol. This abstraction has received considerable attention, due to the instabilities observed in BGP. In this abstraction, each process informs its neighboring processes of its current path to the destination. From the paths received from its neighbors, each process chooses the best path according to some locally chosen routing policy. However, since routing policies are chosen locally, conflicts may occur between processes, resulting in unstable behavior. Current solutions either require expensive path histories, or prevent processes from locally choosing their routing policy. In this paper, we present a solution with small overhead, and furthermore, each process has the freedom to choose any routing policy. However, to avoid instabilities, each process is restricted to choose a path that is consistent with the current paths of its descendants on the routing tree. This is enforced through diffusing computations. Furthermore, our solution is stabilizing, and thus, recovers automatically from transient faults.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cobb, J.A., Gouda, M.G., “Stabilization of General Loop-Free Routing”, Journal of Parallel and Distributed Computing, Vol. 62, No. 5, May, 2002. 181
Cobb, J.A., Gouda, M.G., Musuburi, R., “A Stabilizing Solution to The Stable Path Problem”, Tech. Report, Dept. of Comp. Science, Univ. of Texas at Dallas. 180
Gao, L., Rexford, J., “Stable Internet Routing Without Global Coordination”, IEEE/ACM Transactions on Networking, Vol. 9, No. 6, Dec. 2001. 170
Gao, L., Rexford, J., “Stable Internet Routing Without Global Coordination”, Proc. of the ACM SIGMETRICS, June 2000. 170
Garcia-Lunes-Aceves, J. J., “Loop-Free Routing Using Diffusing Computations”, IEEE/ACM Transactions on Networking, Volume 1, No. 1, Feb., 1993. 176
Gouda, M.G., Elements of Network Protocol Design, John Wiley & Sons, 1998. 170, 171
Gouda, M.G., Schneider, M., “Maximizable Routing Metrics”, Proc. of the IEEE International Conference on Network Protocols, 1998. 175
Griffin, T.G., Shepherd, F.B., Wilfong, G., “Policy Disputes in Path Vector Protocols”, Proc. of the IEEE Int’l Conf. on Net. Protocols, Oct., 1999. 174, 175, 182
Griffin, T.G., Shepherd, F. B., Wilfong, G., “The Stable Paths Problem and Interdomain Routing”, IEEE/ACM Tran. on Networking, Vol. 10, No. 2, Apr. 2002. 169, 170, 175, 182
Griffin, T. G., Wilfong, G., “A Safe Path Vector Protocol”, Proc. of the INFOCOM Conference, 2000. 170
Griffin, T. G., Wilfong, G., “An Analysis of BGP Convergence Properties”, Proc. of the ACM SIGCOMM Conf., 1999. 174
Herman, T., “A Comprehensive Bibliography on Self-Stabilization”, Chicago Journal of Theoretical Computer Science, working paper, 2002. 170, 179
Mao, Z. M., Govindan, R., Varghese, G., and Katz, R., “Route Flap Damping Exacerbates Internet Routing Convergence”, ACM SIGCOMM Conf., Aug., 2002. 169
Rekhtar, Y., Li, T., “A Border Gateway Protocol” RFC1771, 1995. 169
Schneider, M., “Self-Stabilization”, ACM Computing Surveys, Vol. 25, No. 1, 1993. 170, 179
Varadhan, K., Govindan, R., Estrin, D., “Persistent Route Oscillations in Inter-Domain Routing”, Computer Networks, Jan. 2000. 169
Villamizar, C., Chandra, R., Govindan, R., “BGP Route Flap Damping”, RFC 2439, 1998. 169
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cobb, J.A., Gouda, M.G., Musunuri, R. (2003). A Stabilizing Solution to the Stable Path Problem. In: Huang, ST., Herman, T. (eds) Self-Stabilizing Systems. SSS 2003. Lecture Notes in Computer Science, vol 2704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45032-7_13
Download citation
DOI: https://doi.org/10.1007/3-540-45032-7_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40453-8
Online ISBN: 978-3-540-45032-0
eBook Packages: Springer Book Archive