Graphs and algorithms
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
Stability issues in OSPF routing
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A case study of OSPF behavior in a large enterprise network
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Network routing with path vector protocols: theory and applications
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Design principles of policy languages for path vector protocols
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Routing design in operational networks: a look from the inside
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Robustness of Class-Based Path-Vector Systems
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Implications of autonomy for the expressiveness of policy routing
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
On guidelines for safe route redistributions
Proceedings of the 2007 SIGCOMM workshop on Internet network management
Graphs, Dioids and Semirings: New Models and Algorithms (Operations Research/Computer Science Interfaces Series)
Shedding light on the glue logic of the internet routing architecture
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Instability free routing: beyond one protocol instance
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Unraveling the complexity of network management
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
A Model of Internet Routing Using Semi-modules
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Traffic engineering with traditional IP routing protocols
IEEE Communications Magazine
Interdomain traffic engineering with BGP
IEEE Communications Magazine
Seamless network-wide IGP migrations
Proceedings of the ACM SIGCOMM 2011 conference
On the interaction of multiple routing algorithms
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
Modeling complexity of enterprise routing design
Proceedings of the 8th international conference on Emerging networking experiments and technologies
Lossless migrations of link-state IGPs
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
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.