Srinivas Vutukury
ABSTRACT
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is very responsive to topological and link-cost changes; however, except under light traffic loads, the delays obtained with this type of routing are far from optimal. Furthermore, if link costs are associated with delays, single-path routing exhibits oscillatory behavior and becomes unstable as traffic loads increase. On the other hand, minimum-delay routing approaches can minimize delays only when traffic is stationary or very slowly changing.We present a "near-optimal" routing framework that offers delays comparable to those of optimal routing and that is as flexible and responsive as single-path routing protocols proposed to date. First, an approximation to the Gallager's minimum-delay routing problem is derived, and then algorithms that implement the approximation scheme are presented and verified. We introduce the first routing algorithm based on link-state information that provides multiple paths of unequal cost to each destination that are loop-free at every instant. We show through simulations that the delays obtained in our framework are comparable to those obtained using the Gallager's minimum-delay routing. Also, we show that our framework renders far smaller delays and makes better use of resources than traditional single-path routing.
- 1.R. Albrightson, J.J. Garcia-Luna-Aceves, and J. Boyle. EIGRP-A Fast Routing Protocol Based on Distance Vectors. Proc. Networld/Interop 94, May 1994.]]Google Scholar
- 2.D. Bersekas and R. Gallager. Second Derivative Algorithm for Minimum Delay Distributed Routing in Networks. IEEE Trans. Commun., 32:911-919, 1984.]]Google ScholarCross Ref
- 3.D. Bertsekas. Dynamic Behavior of Shortest-Path Algorithms for Communication Networks. IEEE Trans. Automatic Control, 27:60-74, 1982.]]Google ScholarCross Ref
- 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.]]Google ScholarCross Ref
- 5.D.G. Cantor and M. Gerla. Optimal Routing in a Packet-Switched Computer Network. lEEE Trans. Computers, 23:1062-1069, October 1974.]]Google ScholarDigital Library
- 6.C.G. Cassandras, M.V. Abidi, and D. Towsley. Distributed Routing with Onn-Line Marginal Delay Estimation. IEEE Trans. Commun., 18:348- 359, March 1990.]]Google Scholar
- 7.E.W. Dijkstra and C.S.Scholten. Termination Detection for Diffusing Computations. It!formation Processing Letters, 11:1-4, August 1980.]]Google Scholar
- 8.R. G. Gallager. A Minimum Delay Routing Algorithm Using Distributed Computation. IEEE Trans. Commun., 25:73-84, January 1977.]]Google ScholarCross Ref
- 9.J.J. Garcia-Luna-Aceves. Loop-Free Routing Using Diffusing Computations. IEEE/ACM Trans. Networking, 1:130--141, February 1993.]] Google ScholarDigital Library
- 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.]]Google ScholarDigital Library
- 11.J.J. Garcia-Luna-Aceves and S. Murthy. A path-finding algorithm for loop-free routing. IEEE/ACM Trans. Networking, February 1997.]] Google ScholarDigital Library
- 12.J.J. Garica-Luna-Aceves and M. Spohn. Scalable link-state intemet routing. Proc. International Conference on Network Protocols, October 1998.]] Google ScholarDigital Library
- 13.D.W. Glazer and C. Tropper. A new metric for dynamic routing algorithms. IEEE Trans. Commun., 38:360-367, March 1990.]]Google ScholarCross Ref
- 14.C. Hendrick. Routing Information Protocol. RFC, 1058, june 1988.]] Google ScholarDigital Library
- 15.J. M. Jaffe and F. H. Moss. A Responsive Distributed Routing Algorithm for Computer Networks. IEEE Trans. Commun., 30:1758-1762, July 1982.]]Google Scholar
- 16.L. Klienrock. Communication Nets: Stochastic Message Flow and Delay. McGraw-Hill, New York, 1964.]] Google ScholarDigital Library
- 17.D. Kourkouzelis. Multipath Routing Using Diffusing Computations, M.S. Thesis. University of California, Santa Cruz, March 1997.]]Google Scholar
- 18.J. M. McQuillan, I. Richer, and E. Rosen. The new routing algorithm for the arpanet. IEEE Trans. Commun., 28:711-719, May 1980.]]Google ScholarCross Ref
- 19.P. M. Merlin and A. Segall. A Failsafe Distributed Routing Protocol. IEEE Trans. Conmtun., 27:1280-1287, September 1979.]]Google Scholar
- 20.J. Moy. OSPF Version 2. RFC, 1247, August 1991.]]Google ScholarDigital Library
- 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.]]Google Scholar
- 22.M.I. Reiman and A. Weiss. Sensitivity analysis for simulations via likelihood rations. Proc. 1986 Winter Simulation Conf., pages 285-289, 1986.]] Google ScholarDigital Library
- 23.A. Segall. The Modeling of Adaptive Routing in Data Communication Networks. IEEE Trans. Commun., 25:85-95, January 1977.]]Google ScholarCross Ref
- 24.A. Segall and M. Sidi. A Failsafe Distributed Protocol for Minimum Delay Routing. IEEE Trans. Commun., 29:689--695, May 1981.]]Google Scholar
- 25.J. Spinelli and R. Gallager. Event Driven Topology Broadcast without Sequence Numbers. IEEE Trans. Commun., 37:468-474, 1989.]]Google ScholarCross Ref
- 26.Z. Wang and J. Crowcroft. Shortest Path First with Emergency Exits. Proc. of ACM SIGCOMM, pages 166-176, 1990.]] Google ScholarDigital Library
- 27.W.T. Zaumen and J.J. Garcia-Luna-Aceves. Loop-Free Multipath Routing Using Generalized Diffusing Computations. Proc. IEEE INFO- COM, March 1998.]]Google ScholarCross Ref
Index Terms
- A simple approximation to minimum-delay routing
Recommendations
A simple approximation to minimum-delay routing
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is very responsive to topological and link-cost changes; however, except under ...
Advanced PROPHET Routing in Delay Tolerant Network
ICCSN '09: Proceedings of the 2009 International Conference on Communication Software and NetworksTo solve routing jitter problem in PROPHET in delay tolerant network, advanced PROPHET routing is proposed in this paper. Average delivery predictabilities are used in advanced PROPHET to avoid routing jitter. Furthermore, we evaluate it through ...
Look-Ahead Routing and Message Scheduling in Delay-Tolerant Networks
Routing is one of the most challenging development issues in Delay-Tolerant Networks (DTNs) because of lack of continuous connection. Existing routing schemes for DTNs provide best effort service, but are unable to optimize QoS and support message ...
Comments