A validation model for non-lexical routing protocols

Abstract Routing protocols properties form an essential topic of research. Ensuring that a routing protocol is stable, loop free and reaches the global optimal topology solution is needed for both evaluating it and doing the required enhancements for it. There exist several trials in previous researches to enhance routing protocols. Those works depend on either theoretical models or simulation to validate their results. Existing validation models target lexical based routing metrics only. In this work, we propose a validation model for non-lexical routing metrics (such as Enhanced Interior Gateway Routing Protocol – EIGRP). Our validation model is based on abstract algebra. It helps in validating necessary routing properties and enhancing existing routing protocols in such a way that makes them meet those properties.

[1]  Alexander J. T. Gurney,et al.  Lexicographic products in metarouting , 2007, 2007 IEEE International Conference on Network Protocols.

[2]  Franck Le,et al.  Interconnecting Routing Instances , 2014, IEEE/ACM Transactions on Networking.

[3]  Timothy G. Griffin,et al.  Hybrid link-state, path-vector routing , 2010, AINTEC.

[4]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[5]  J. J. Garcia-Luna-Aceves,et al.  A unified approach to loop-free routing using distance vectors or link states , 1989, SIGCOMM '89.

[6]  Alexander J. T. Gurney,et al.  Pathfinding through Congruences , 2011, RAMICS.

[7]  J. J. Garcia-Luna-Aceves,et al.  EIGRP--A Fast Routing Protocol based on Distance Vectors , 1994 .

[8]  João L. Sobrinho,et al.  An algebraic theory of dynamic network routing , 2005, IEEE/ACM Transactions on Networking.

[9]  Alexander J. T. Gurney,et al.  Increasing Bisemigroups and Algebraic Routing , 2008, RelMiCS.

[10]  Jeffrey M. Jaffe,et al.  A Responsive Distributed Routing Algorithm for Computer Networks , 1982, ICDCS.

[11]  Mohamed G. Gouda,et al.  Maximizable routing metrics , 2003, TNET.

[12]  J. J. Garcia-Luna-Aceves,et al.  Loop-free routing using diffusing computations , 1993, TNET.

[13]  João L. Sobrinho,et al.  Network routing with path vector protocols: theory and applications , 2003, SIGCOMM '03.

[14]  Radia Perlman,et al.  Interconnections: Bridges, Routers, Switches, and Internetworking Protocols , 1999 .

[15]  Franck Le,et al.  Theory and new primitives for safely connecting routing protocol instances , 2010, SIGCOMM 2010.

[16]  P. A. Grillet.  Semigroups: An Introduction to the Structure Theory , 1995 .

[17]  Michel Minoux,et al.  Graphs, dioids and semirings : new models and algorithms , 2008 .

[18]  Timothy G. Griffin,et al.  On the interaction of multiple routing algorithms , 2011, CoNEXT '11.

[19]  J. J. Garcia-Lunes-Aceves.  Loop-free routing using diffusing computations , 1993 .

[20]  Peter Paluch,et al.  Cisco's Enhanced Interior Gateway Routing Protocol (EIGRP) , 2016, RFC.