Maximizable routing metrics

We present a simple theory for maximizable routing metrics. First, we give a formal definition of routing metrics and identify two important properties: boundedness and monotonicity. We show that these two properties are both necessary and sufficient for a routing metric to be maximizable in any network. We show how to combine two (or more) routing metrics into a single composite metric such that if the original metrics are both bounded and monotonic (and, hence, maximizable), then the composite metric is also bounded and monotonic (and, hence, maximizable). We present several applications of our theory. We show that the composite routing metric used in the Inter-Gateway Routing Protocol (IGRP) is not maximizable and we show that Enhanced IGRP (EIGRP) does not behave as expected for nonmonotonic metrics. We also show that a technique for scalable link-state routing does not work correctly when applied to composite metrics. A common theme throughout our paper is that the intuitions generated by using distance metrics to produce shortest paths do not carry over to other routing metrics.

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

[2]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[3]  Christian Huitema,et al.  An Architecture for Residential Internet Telephony Service , 1999, IEEE Internet Comput..

[4]  Christian Huitema,et al.  Routing in the Internet , 1995 .

[5]  J. J. Garcia-Luna-Aceves,et al.  Scalable link-state Internet routing , 1998, Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256).

[6]  Eric S. Crawley,et al.  A Framework for QoS-based Routing in the Internet , 1998, RFC.

[7]  S. T. Buckland,et al.  An Introduction to the Bootstrap. , 1994 .

[8]  B. Rajagopalan,et al.  A new responsive distributed shortest-path rounting algorithm , 1989, SIGCOMM 1989.

[9]  Charles L. Hedrick Rutgers.  An introduction to igrp , 1991 .

[10]  M. Gouda,et al.  Flow routing in computer networks , 1997 .

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

[12]  M. Steenstrup.  Routing in communications networks , 1995 .

[13]  Averill M. Law,et al.  The art and theory of dynamic programming , 1977 .

[14]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[15]  Mohamed G. Gouda,et al.  Stabilization of maximal metric trees , 1999, Proceedings 19th IEEE International Conference on Distributed Computing Systems.

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

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

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

[19]  Mohamed G. Gouda,et al.  Maximizable routing metrics , 1998, Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256).

[20]  Ivan Pepelnjak.  EIGRP Network Design Solutions , 2000 .

[21]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[22]  Charles L. Hedrick,et al.  Routing Information Protocol , 1988, RFC.

[23]  Yehuda Afek,et al.  Self-stabilizing unidirectional network algorithms by power-supply , 1997, SODA '97.

[24]  Anish Arora,et al.  Distributed Reset , 1994, IEEE Trans. Computers.

[25]  Jon Crowcroft,et al.  Bandwidth-delay based routing algorithms , 1995, Proceedings of GLOBECOM '95.

[26]  Shlomi Dolev,et al.  Self-Stabilizing Depth-First Search , 1994, Inf. Process. Lett..

[27]  Mohamed G. Gouda,et al.  Stabilization of maximum flow trees , 1994 .

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

[29]  R. Bellman.  Dynamic programming. , 1957, Science.

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

[31]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[32]  Bala Rajagopalan,et al.  A new responsive distributed shortest-path rounting algorithm , 1989, SIGCOMM '89.

[33]  K. Mani Chandy,et al.  Distributed computation on graphs: shortest path algorithms , 1982, CACM.