Maximizable routing metrics

IEEE/ACM Transactions on Networking

Volumn 11, Issue 4, 2003, Pages 663-675

  Gouda, Mohamed G ^a   Schneider, Marco ^b  

^a University of Texas at Austin   (United States)

^b SBC Technology Resources   (United States)

Author keywords

Communication system routing; Communication system signaling; Computer networks; Distance vector; Distributed algorithms; Link state; Protocols; Routing; Routing metrics; Trees (graphs)

Indexed keywords

ALGORITHMS; GATEWAYS (COMPUTER NETWORKS); NETWORK PROTOCOLS; ROUTERS; SIGNALING; TREES (MATHEMATICS); VECTORS;

ROUTING METRICS;

TELECOMMUNICATION SYSTEMS;

EID: 0042917517     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2003.815294     Document Type: Article

References (31)

1. R. Albrightson, J. J. Garcia-Luna-Aceves, and J. Boyle, "EIORP-A fast routing protocol based on distance vectors," in Proc. Networld/Interop'94, May 1994.
2. A. Arora and M. G. Gouda, "Distributed reset," IEEE Trans. Comput., vol. 43, pp. 1026-1039, Sept. 1994.
3. R.E. Bellman, Dynamic Programming. Princeton, NJ: Princeton Univ. Press, 1957.
4. B. Rajagopalan and B. M Faiman, "A new responsive distributed shortest-path routing algorithm," in Proc. ACM SIGCOMM, Sept. 1989.
5. Z. Collin and S. Dolev, "Self-stabilizing depth first search," Inform. Processing Lett., vol. 49, pp. 297-301, 1994.
6. K. M. Chandy and J. Misra, "Distributed computation on graphs: Shortest path algorithms," Commun. ACM, vol. 25, no. 11, Nov. 1982.
7. S. Chen and K. Nahrstedt, "An overview of quality of service routing for next-generation high speed networks: Problems and solutions," IEEE Network, vol. 12, pp. 64-79, Nov./Dec. 1998.
8. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. New York: McGraw-Hill, 1990.
9. S. B. Dreyfus and A. M. Law, The Art and Theory of Dynamic Programming. New York: Academic, 1977, vol. 130, Mathematics in Science and Engineering.
10. E. W. Dijkstra and C. S. Scholten, "Termination detection for diffusing computations," Inform. Processing Lett., vol. 11, no. 1, Aug. 1980.
11. D.Farinacci, Introduction to Enhanced IGRP (EIGRP). San Jose, CA: Cisco Systems, July 1993.
12. L. R. Ford Jr and D. R. Fulkerson, Flows in Networks. Princeton, NJ: Princeton Univ. Press, 1962.
13. J. J. Garcia-Luna-Aceves, "A unified approach to loop-free routing using distance vectors or link states," in Proc. ACM SIGCOMM, Sept. 1989.
14. _, "Loop-free routing using diffusing computations," IEEE/ACM Trans. Networking, vol. 1, pp. 130-141, Feb. 1993.
15. J. J. Garcia-Luna-Aceves and M. Spohn, "Scalable link-state Internet routing," in Proc. 6th Int. Conf. Network Protocols, Oct. 1998, pp. 52-61.
16. M. G. Gouda and M. Schneider, "Stabilization of maximum flow trees," in Proc. 3rd Annu. Joint Conf. Information Sciences, Nov. 1994.
17. _, "Maximum flow routing," in Proc. 2nd Workshop Self-Stabilizing Systems, 1995, pp. 2.1-2.13.
18. _, "Maximizable routing metrics," in Proc. 6th Int. Conf. Network Protocols, Oct. 1998, pp. 71-78.
19. _, "Stabilization of maximal metric trees," in Proc. 19th IEEE Int. Conf. Distributed Computing Systems Workshop Self-Stabilizing Systems, June 1999, pp. 10-17.
20. C. Hedrick, "Routing information protocol," Internet Engineering Task Force, RFC 1058, June 1988.
21. C. Hedrick, "An introduction to IGRP," Ctr. Comput. Inform. Services, Lab. Comput. Sci. Res., Rutgers Univ., New Brunswick, NJ, [Online.] Available: http://www.cisco.com, Aug. 1991.
22. C. Huitema, Routing in The Internet. Englewood Cliffs, NJ: Prentice-Hall, 1995.
23. J. M. Jaffe and F. H. Moss, "A responsive distributed routing algorithm for computer networks," IEEE Trans. Commun., vol. COM-30, p., July 1982.
24. P. M. Merlin and A. Segall, "A failsafe distributed routing protocol," IEEE Trans. Commun., vol. COM-27, pp. 1230-1237, Sept. 1979.
25. J. Moy, "OSPF Version 2," Internet Engineering Task Force, RFC 2328, Apr. 1998.
26. I. Pepelnjak, EIGRP Network Design Solutions. Indianapolis, IN: Cisco Press, 2000.
27. M. Schneider, "Self-stabilization," ACM Comput. Surveys, vol. 25, no. 1, Mar. 1993.
28. _, "Flow routing in computer networks," Ph.D. dissertation [Online.] Available: http://www.cs.utexas.edu/users/marco, Dept. Comput. Sci., Univ. Texas, Austin, Dec. 1997.
29. M. Steenstrup, Routing in Communications Networks. Englewood Cliffs, NJ: Prentice-Hall, 1995.
30. A. S. Tanenbaum, Computer Networks, 3rd ed. Englewood Cliffs, NJ: Prentice-Hall, 1996.
31. Z. Wang and J. Crowcroft, "Bandwidth-delay based routing algorithms," in Proc. IEEE Global Telecommunications Conf., Singapore, 1995.