A simple approximation to minimum-delay routing

Computer Communication Review

Volumn 29, Issue 4, 1999, Pages 227-237

  Vutukury, Srinivas ^a   Garcia Luna Aceves, J J ^a  

^a University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONGESTION CONTROL (COMMUNICATION); NETWORK PROTOCOLS; TELECOMMUNICATION TRAFFIC;

GALLAGER'S MINIMUM-DELAY ROUTING;

COMPUTER NETWORKS;

EID: 0033204543     PISSN: 01464833     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/316194.316227     Document Type: Article

References (27)

1. R. Albrightson, J.J. Garcia-Luna-Aceves, and J. Boyle. EIGRP-A Fast Routing Protocol Based on Distance Vectors. Proc. Netn-orld/Inlerop 94, May 1994.
2. D. Bersekas and R. Gallager. Second Derivative Algorithm for Minimum Delay Distributed Routing in Networks. IEEE Trans. Commun., 32:911-919, 1984.
3. D. Bertsekas. Dynamic Behavior of Shortest-Path Algorithms for Communication Networks.lEEETrans. Automatic Control, 27:60-74,1982.
4. J.B. Cain, S.L. Adams, M.D. Noakes, Tom Kryst, and E.L. Althouse. A Near-Optimum Multiple Path Routing Algorithm for Space-Based SDI Networks. MILCOMM, pages 29.3.1-29.3.7,1987.
5. D.G. Cantor and M. Gerla. Optimal Routing in a Packet-Switched Computer Network. lEEETrans. Computers, 23:1062-1069, October 1974.
6. G.G. Cassandras, M.V. Abidi, and D. Towsley. Distributed Routing with Onn-Line Marginal Delay Estimation. lEEETrans. Commun., 18:348359, March 1990.
7. EAV. Dijkstra and C.S.Scholten. Termination Detection for Diffusing Computations. Information Processing Leiters, 11:1-4, August 1980.
8. R. G. Gallager. A Minimum Delay Routing Algorithm Using Distributed Computation. IEEE Trans. Commun., 25:73-84, January 1977.
9. J J. Garcia-Luna-Aceves. Loop-Free Routing Using Diffusing Computations. IEEE/ACMTrans. Networking, 1:130-141, February 1993.
10. J.J. Garcia-Luna-Aceves and J. Behrens. Distributed, scalable routing based on vectors of link states. IEEE Journal on Selected Areas in Communications, October 1995.
11. J.J. Garcia-Luna-Aceves and S. Murthy. A path-finding algorithm for loop-free routing. IEEE/ACM Trans. NeMorking, February 1997.
12. J.J. Garica-Luna-Aceves and M. Spohn. Scalable link-state internet routing. Proc. International Conference on Nebvork Protocols, October 1998.
13. D.W. Glazer and C. Tropper. A new metric for dynamic routing algorithms. lEEETrans. Commun., 38:360-367, March 1990.
14. C. Hendrick. Routing Information Protocol. RFC, 1058, June 1988.
15. J. M. Jaffe and F. H. Moss. A Responsive Distributed Routing Algorithm for Computer Networks. lEEETrans. Commun., 30:1758-1762, July 1982.
16. L. Klienrock. Communication Nets: Stocliastic Message Flow and Delay. McGraw-Hill, New York, 1964.
17. D. Kourkouzelis. Multipath Routing Using Diffusing Computations, M.S. Thesis. University of California, Santa Cruz, March 1997.
18. J. M. McQuillan, I. Richer, and E. Rosen. The new routing algorithm for the arpanet. lEEETrans. Commun., 28:711-719, May 1980.
19. P. M. Merlin and A. Segall. A Failsafe Distributed Routing Protocol. lEEETrans. Commun., 27:1280-1287, September 1979.
20. J. Moy. OSPF Version 2. RFC, 1247, August 1991.
21. V. Paxson, P. Danzig, J. Mogul, and M. Schwartz. Web page: ita.ee.lbl.gov/html/traces.html. Lawrence Berkeley National Laboratory, July 1997.
22. M.I. Reiman and A. Weiss. Sensitivity analysis for simulations via likelihood rations. Proc. 1986 Winter Simulation Conf., pages 285-289, 1986.
23. A. Segall. The Modeling of Adaptive Routing in Data Communication Networks. lEEETrans. Commun., 25:85-95, January 1977.
24. A. Segall and M. Sidi. A Failsafe Distributed Protocol for Minimum Delay Routing. lEEETrans. Commun., 29:689-695, May 1981.
25. J. Spinelli and R. Gallager. Event Driven Topology Broadcast without Sequence Numbers. lEEETrans. Commun., 37:468-474,1989.
26. Z. Wang and J. Crowcroft. Shortest Path First with Emergency Exits. Proc. ofACMSIGCOMM, pages 166-176, 1990.
27. W. T. Zäumen and J.J. Garcia-Luna-Aceves. Loop-Free Multipath Routing Using Generalized Diffusing Computations. Proc. IEEE INFOCOM, March 1998.