Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
OSPF complete implementation
OSPF: Anatomy of an Internet Routing Protocol
OSPF: Anatomy of an Internet Routing Protocol
Network routing with path vector protocols: theory and applications
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
IEEE/ACM Transactions on Networking (TON)
An algebraic theory of dynamic network routing
IEEE/ACM Transactions on Networking (TON)
Patterns in Network Architecture: A Return to Fundamentals
Patterns in Network Architecture: A Return to Fundamentals
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
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
Path Problems in Networks
Theory and new primitives for safely connecting routing protocol instances
Proceedings of the ACM SIGCOMM 2010 conference
Modeling complexity of enterprise routing design
Proceedings of the 8th international conference on Emerging networking experiments and technologies
Hi-index | 0.00 |
Internet routers can obtain distinct routes to the same destination from multiple routing protocols. A mechanism called administrative distance (AD) has evolved to implement route selection in such cases. AD simply imposes a preference ranking among routing protocols. A related mechanism called route redistribution (RR) is used to increase connectivity by injecting routes from one protocol into another. Recent research has shown that the current design of RR with AD mechanisms can give rise to routing and forwarding anomalies that are difficult to debug. We present a new algebraic model that captures not only RR with AD, but also sub-protocol interactions that exist within protocols such as OSPF and IS-IS. Compared with previous work, our model provides a clearer view of the issues and trade-offs involved.