Routing Protocols: Framework and Principles

Routing protocols are mechansims by which routing information is exchanged between routers so that routing decisions can be made. In the Internet, there are three types of routing protocols commonly used. They are: distance vector, link state, and path vector. In this chapter, we present the basic concepts and fundamentals behind each of these three types of protocols in a generic framework. Routing protocols, being distributed mechanisms, can face pitfalls during a transient period such as looping. Thus, we also discuss such issues and how various efforts are made to address them. Steps to translate these protocols to actual routing protocol specifications on the Internet are discussed in later chapters.

[1]  Juliusz Chroboczek,et al.  The Babel Routing Protocol , 2021, RFC.

[2]  Daniel Massey,et al.  Observation and analysis of BGP behavior under stress , 2002, IMW '02.

[3]  Dimitri Bertsekas.  Dynamic models of shortest path routing algorithms for communication networks with multiple destinations , 1979, 1979 18th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[4]  Eric C. Rosen,et al.  The Updating Protocol of ARPANET's New Routing Algorithm , 1980, Comput. Networks.

[5]  Adrian Segall,et al.  A Failsafe Distributed Routing Protocol , 1979, IEEE Trans. Commun..

[6]  Ming-Syan Chen,et al.  Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping , 1987, IEEE Transactions on Computers.

[7]  Eric C. Rosen.  Vulnerabilities of network control protocols: an example , 1981, SOEN.

[8]  Yi Yang,et al.  Generic Threats to Routing Protocols , 2006, RFC.

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

[10]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[11]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

[12]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[13]  Dimitri P. Bertsekas,et al.  Dynamic behavior of shortest path routing algorithms for communication networks , 1982 .

[14]  J.J. Garcia-Luna-Aceves.  A distributed, loop-free, shortest-path routing algorithm , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[15]  Yehuda Afek,et al.  Improved BGP convergence via ghost flushing , 2003, IEEE Journal on Selected Areas in Communications.

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

[17]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[18]  Daniel Massey,et al.  An analysis of convergence delay in path vector routing protocols , 2006, Comput. Networks.

[19]  Van Jacobson,et al.  The synchronization of periodic routing messages , 1994, TNET.

[20]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[21]  Harry Rudin,et al.  On Routing and "Delta Routing": A Taxonomy and Performance Comparison of Techniques for Packet-Switched Networks , 1976, IEEE Trans. Commun..

[22]  Daniel Massey,et al.  BGP-RCN: improving BGP convergence through root cause notification , 2005, Comput. Networks.

[23]  Adrian Segall.  Advances in Verifiable Fail-Safe Routing Procedures , 1981, IEEE Trans. Commun..

[24]  Ruibing Hao,et al.  An approach to accelerate convergence for path vector protocol , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[25]  Roger Wattenhofer,et al.  The impact of Internet policy and topology on delayed routing convergence , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[26]  I. Richer,et al.  A Review of the Development and Performance of the ARPANET Routing Algorithm , 1978, IEEE Trans. Commun..

[27]  Gordon T. Wilfong,et al.  The stable paths problem and interdomain routing , 2002, TNET.

[28]  A. Khanna,et al.  The revised ARPANET routing metric , 1989, SIGCOMM 1989.