Heuristic methods for delay constrained least cost routing using /spl kappa/-shortest-paths

The delay constrained least cost (DCLC) problem is to find the least cost path in a graph subject to a delay constraint. First formulated in the context of routing in computer networks, the DCLC model also applies to problems of path planning and other decision problems. DCLC is NP-complete. Many heuristic methods have been proposed for it. This note presents two new methods based on the /spl kappa/-shortest-path (/spl kappa/SP) approach. These heuristic methods-one centralized, the other distributed-are both polynomial. In numerical experiments the proposed algorithms almost always find the optimal paths.

[1]  Andrés Marzal,et al.  Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison , 1999, WAE.

[2]  Bal Azs.  Lagrange Relaxation Based Method for the QoS Routing Problem , 2001 .

[3]  Pierre A. Humblet,et al.  Routing subject to quality of service constraints in integrated communication networks , 1995, IEEE Netw..

[4]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[5]  Xingming Liu,et al.  Heuristic algorithms for multi-constrained quality of service routing , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[6]  Gang Liu,et al.  A*Prune: an algorithm for finding K shortest paths subject to multiple constraints , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  Norio Shiratori,et al.  Routing with multiple QoS requirements for supporting multimedia applications , 1998, Telecommun. Syst..

[8]  Ron Widyono.  The Design and Evaluation of Routing Algorithms for Real-time Channels , 1994 .

[9]  Piet Van Mieghem,et al.  Hop-by-hop quality of service routing , 2001, Comput. Networks.

[10]  Ellen W. Zegura,et al.  A quantitative comparison of graph-based models for Internet topology , 1997, TNET.

[11]  Jeffrey M. Jaffe,et al.  Algorithms for finding paths with multiple constraints , 1984, Networks.

[12]  P. Van Mieghem,et al.  A multiple quality of service routing algorithm for PNNI , 1998 .

[13]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[14]  Douglas S. Reeves,et al.  A distributed algorithm for delay-constrained unicast routing , 1997, Proceedings of INFOCOM '97.

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Fernando A. Kuipers,et al.  An overview of constraint-based path selection algorithms for QoS routing , 2002 .

[17]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[18]  Ian M. Mitchell,et al.  Continuous path planning with multiple constraints , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).