Franck Le
ABSTRACT
Recent studies have shown that the current primitives for connecting multiple routing protocol instances (OSPF 1, OSPF 2, EIGRP 10, etc.) are pervasively deployed in enterprise networks and the Internet. Furthermore, these primitives are extremely vulnerable to routing anomalies (route oscillations, forwarding loops, etc.) and at the same time too rigid to support some of today's operational objectives. In this paper, we propose a new theory to reason about routing properties across multiple routing instances. The theory directly applies to both link-state and vector routing protocols. Each routing protocol still makes independent routing decisions and may consider a combination of routing metrics, including bandwidth, delay, cost, and reliability. While the theory permits a range of solutions, we focus on a design that requires no changes to existing routing protocols. Guided by the theory, we derive a new set of connecting primitives, which are not only provably safe but also more expressive than the current version. We have implemented and validated the new primitives using XORP. The results confirm that our design can support a large range of desirable operational goals, including those not achievable today, safely and with little manual configuration.
- 100x100 Clean Slate Project. www.100x100network.org.Google Scholar
- 4D Project. www.cs.cmu.edu/_4D.Google Scholar
- XORP: eXtensible Open source Routing Platform. www.xorp.org.Google Scholar
- A. Basu and J. G. Riecke. Stability Issues in OSPF Routing. In ACM SIGCOMM, 2001. Google ScholarDigital Library
- T. Benson, A. Akella, and D. Maltz. Unraveling the Complexity of Network Management. In USENIX NSDI, 2009. Google ScholarDigital Library
- J. N. Billings and T. G. Griffin. A Model of Internet Routing Using Semi-modules. In International Conference on Relational Methods in Computer Science, 2009. Google ScholarDigital Library
- B. Carré. Graphs and Networks. Oxford University Press, 1979.Google Scholar
- Cisco. OSPF Redistribution Among Different OSPF Processes, 2006.Google Scholar
- Cisco. What Is Administrative Distance?, March 2006.Google Scholar
- N. Feamster, H. Balakrishnan, and J. Rexford. Some Foundational Problems in Interdomain Routing. In HotNets, 2004.Google Scholar
- N. Feamster, R. Johari, and H. Balakrishnan. Implications of Autonomy for the Expressiveness of Policy Routing. In ACM SIGCOMM, 2005. Google ScholarDigital Library
- B. Fortz, J. Rexford, and M. Thorup. Traffic Engineering With Traditional IP Routing Protocols. In IEEE Communication Magazine, 2002. Google ScholarDigital Library
- M. Gondran and M. Minoux. Graphs and Algorithms. Wiley, 1984. Google ScholarDigital Library
- M. Gondran and M. Minoux. Graphs, Dioids, and Semirings : New Models and Algorithms. Springer, 2008. Google ScholarDigital Library
- M. G. Gouda and M. Schneider. Maximizable Routing Metrics. In IEEE ICNP, 1998.Google ScholarCross Ref
- T. G. Griffin, A. D. Jaggard, and V. Ramachandran. Design Principles of Policy Languages for Path Vector Protocols. In ACM SIGCOMM, 2003. Google ScholarDigital Library
- T. G. Griffin and J. L. Sobrinho. Metarouting. In ACM SIGCOMM, 2005. Google ScholarDigital Library
- A. Gurney and T. G. Griffin. Lexicographic Products in Metarouting. In ICNP, 2007.Google ScholarCross Ref
- A. D. Jaggard and V. Ramachandran. Robustness of Class-Based Path-Vector Systems. In IEEE ICNP, 2004. Google ScholarDigital Library
- F. Le and G. Xie. On Guidelines for Safe Route Redistributions. In ACM INM Workshop, 2007. Google ScholarDigital Library
- F. Le, G. Xie, D. Pei, J. Wang, and H. Zhang. Shedding Light on the Glue Logic of the Internet Routing Architecture. In ACM SIGCOMM, 2008. Google ScholarDigital Library
- F. Le, G. Xie, and H. Zhang. Understanding Route Redistribution. In IEEE ICNP, 2007.Google ScholarCross Ref
- F. Le, G. Xie, and H. Zhang. Instability Free Routing: Beyond One Protocol Instance. In ACM CoNEXT, 2008. Google ScholarDigital Library
- D. Maltz, G. Xie, J. Zhan, H. Zhang, G. Hjalmtysson, and A. Greenberg. Routing Design in Operational Networks: A Look from the Inside. In ACM SIGCOMM, 2004. Google ScholarDigital Library
- D. Mills and H. Braun. The NSFNET Backbone Network. In ACM SIGCOMM, 1987. Google ScholarDigital Library
- B. Quoitin, C. Pelsser, L. Swinnen, O. Bonaventure, and S. Uhlig. Interdomain Traffic Engineering with BGP. In IEEE Communication Magazine, 2003. Google ScholarDigital Library
- A. Shaikh, C. Isett, A. Greenberg, M. Roughan, and J. Gottlieb. A Case Study of OSPF Behavior in a Large Enterprise Network. In IMW, 2002. Google ScholarDigital Library
- J. Sobrinho. Algebra and Algorithms for QoS Path Computation and Hop-by-Hop Routing in the Internet. In IEEE INFOCOM, 2001.Google ScholarCross Ref
- J. L. Sobrinho. Network Routing With Path Vector Protocols: Theory and Applications. In ACM SIGCOMM, 2003. Google ScholarDigital Library
- J. L. Sobrinho and T. G. Griffin. Routing in Equilibrium. In Mathematical Theory of Networks and System, 2010.Google Scholar
Index Terms
- Theory and new primitives for safely connecting routing protocol instances
Recommendations
Theory and new primitives for safely connecting routing protocol instances
SIGCOMM '10Recent studies have shown that the current primitives for connecting multiple routing protocol instances (OSPF 1, OSPF 2, EIGRP 10, etc.) are pervasively deployed in enterprise networks and the Internet. Furthermore, these primitives are extremely ...
Shedding light on the glue logic of the internet routing architecture
Recent studies reveal that the routing structures of operational networks are much more complex than a simple BGP/IGP hierarchy, highlighted by the presence of many distinct instances of routing protocols. However, the glue (how routing protocol ...
Shedding light on the glue logic of the internet routing architecture
SIGCOMM '08: Proceedings of the ACM SIGCOMM 2008 conference on Data communicationRecent studies reveal that the routing structures of operational networks are much more complex than a simple BGP/IGP hierarchy, highlighted by the presence of many distinct instances of routing protocols. However, the glue (how routing protocol ...
Comments