Nick Feamster
Abstract
Thousands of competing autonomous systems must cooperate with each other to provide global Internet connectivity. Each autonomous system (AS) encodes various economic, business, and performance decisions in its routing policy. The current interdomain routing system enables each AS to express policy using rankings that determine how each router inthe AS chooses among different routes to a destination, and filters that determine which routes are hidden from each neighboring AS. Because the Internet is composed of many independent, competing networks, the interdomain routing system should provide autonomy, allowing network operators to set their rankings independently, and to have no constraints on allowed filters. This paper studies routing protocol stability under these conditions. We first demonstrate that certain rankings that are commonly used in practice may not ensure routing stability. We then prove that, when providers can set rankings and filters autonomously, guaranteeing that the routing system will converge to a stable path assignment essentially requires ASes to rank routes based on AS-path lengths. We discuss the implications of these results for the future of interdomain routing.
- Alaettinoglu, C., et al. Routing policy specification language (RPSL). RFC 2622, June 1999. Google Scholar
Digital Library
- Private communication with Randy Bush, May 2004.Google Scholar
- Feamster, N., and Balakrishnan, H. Detecting BGP Configuration Faults with Static Analysis. In Proc. 2nd Symposium on Networked Systems Design and Implementation (Boston, MA, May 2005), pp. 49--56. Google ScholarDigital Library
- Feamster, N., Borkenhagen, J., and Rexford, J. Guidelines for interdomain traffic engineering. Computer Communications Review 33, 5 (October 2003), 19--30. Google ScholarDigital Library
- Feamster, N., Johari, R., and Balakrishnan, H. Stable policy routing with provider independence. Tech. Rep. MIT-LCS-TR-981, Massachusetts Institute of Technology, February 2005.Google Scholar
- Feigenbaum, J., Sami, R., and Shenker, S. Mechanism design for policy routing. In ACM Symposium on Principles of Distributed Computing (2004), pp. 11--20. Google ScholarDigital Library
- Gao, L., Griffin, T. G., and Rexford, J. Inherently safe backup routing with BGP. In Proc. IEEE INFOCOM (Anchorage, AK, April 2001), pp. 547--556.Google Scholar
- Gao, L., and Rexford, J. Stable Internet routing without global coordination. IEEE/ACM Trans. Networking 9, 6 (December 2001), 681--692. Google ScholarDigital Library
- Govindan, R., Alaettinoglu, C., Eddy, G., Kessens, D., Kumar, S., and Lee, W. An architecture for stable, analyzable Internet routing. IEEE Network Magazine 13, 1 (January/February 1999), 29--35. Google ScholarDigital Library
- Govindan, R., Alaettinoglu, C., Varadhan, K., and Estrin, D. Route servers for inter-domain routing. Computer Networks and ISDN Systems 30 (1998), 1157--1174. Google ScholarDigital Library
- Griffin, T., Jaggard, A., and Ramachandran, V. Design principles of policy languages for path vector protocols. In Proc. ACM SIGCOMM (Karlsruhe, Germany, August 2003), pp. 61--72. Google ScholarDigital Library
- Griffin, T., Shepherd, F. B., and Wilfong, G. The stable paths problem and interdomain routing. IEEE/ACM Trans. Networking 10, 1 (2002), 232--243. Google ScholarDigital Library
- Griffin, T., and Wilfong, G. A safe path vector protocol. In Proc. IEEE INFOCOM (March 2000), pp. 490--499.Google ScholarCross Ref
- Jaggard, A. D., and Ramachandran, V. Robustness of class-based path vector systems. In Proc. International Conference on Network Protocols (November 2004), pp. 84--93. Google ScholarDigital Library
- Machiraju, S., and Katz, R. Verifying global invariants in multi-provider distributed systems. In Proc. SIGCOMM Workshop on Hot Topics in Networking (HotNets) (November 2004), pp. 149--154.Google Scholar
- Rekhter, Y., and Li, T. A Border Gateway Protocol. RFC 1771, March 1995. Google ScholarDigital Library
- Sobrinho, J. L. Network routing with path vector protocols: Theory and applications. In Proc. ACM SIGCOMM (Karlsruhe, Germany, August 2003), pp. 49--60. Google ScholarDigital Library
- Varadhan, K., Govindan, R., and Estrin, D. Persistent route oscillations in inter-domain routing. Tech. Rep. 96-631, USC/ISI, February 1996.Google Scholar
Index Terms
- Implications of autonomy for the expressiveness of policy routing
Recommendations
Implications of autonomy for the expressiveness of policy routing
SIGCOMM '05: Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communicationsThousands of competing autonomous systems must cooperate with each other to provide global Internet connectivity. Each autonomous system (AS) encodes various economic, business, and performance decisions in its routing policy. The current interdomain ...
Implications of autonomy for the expressiveness of policy routing
Thousands of competing autonomous systems must cooperate with each other to provide global Internet connectivity. Each autonomous system (AS) encodes various economic, business, and performance decisions in its routing policy. The current interdomain ...
Neighbor-specific BGP: more flexible routing policies while improving global stability
SIGMETRICS '09The Border Gateway Protocol (BGP) offers network administrators considerable flexibility in controlling how traffic flows through their networks. However, the interaction between routing policies in different Autonomous Systems (ASes) can lead to ...
Comments