Heuristic and Exact Algorithms for QoS Routing with Multiple Constraints(Regular section)

The modern network service of finding the optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. gives rise to the multiconstrained optimal-path (MCOP) QoS routing problem, which is NP-complete. In this paper, this problem is solved through both exact and heuristic algorithms. We propose an exact algorithm E MCOP, which first constructs an aggregate weight and then uses a K-shortest-path algorithm to find the optimal solution. By means of E MCOP, the performance of the heuristic algorithm H MCOP proposed by Korkmaz et al. in a recent work is evaluated. H MCOP only runs Dijkstra’s algorithm (with slight modifications) twice, but it can find feasible paths with a success ratio very close to that of the exact algorithm. However, we notice that in certain cases its feasible solution has an unsatisfactorily high average cost deviation from the corresponding optimal solution. For this reason, we propose some modified algorithms based on H MCOP that can significantly improve the performance by running Dijkstra’s algorithm a few more times. The performance of the exact algorithm and heuristics is investigated through computer simulations on networks of various sizes. key words: QoS routing, multi-constrained path, additive QoS constraints, K-shortest-path algorithm, high-speed networking

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

[2]  Gang Feng,et al.  An Efficient Approximate Algorithm for Finding Paths with Two Additive Constraints , 2002 .

[3]  Gang Feng,et al.  Neural network and algorithmic methods for solving routing problems in high-speed networks , 2001 .

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

[5]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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

[7]  Klara Nahrstedt,et al.  On finding multi-constrained paths , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[8]  Marwan Krunz,et al.  Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[9]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[10]  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).

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

[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]  Bal Azs.  Lagrange Relaxation Based Method for the QoS Routing Problem , 2001 .

[15]  Xin Yuan.  Heuristic algorithms for multiconstrained quality-of-service routing , 2002, IEEE/ACM Trans. Netw..

[16]  Quan Sun,et al.  A new distributed routing algorithm for supporting delay-sensitive applications , 1998, Comput. Commun..

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

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

[19]  Ariel Orda,et al.  QoS routing: the precomputation perspective , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[20]  Niki Pissinou,et al.  Efficient solutions to multicast routing in communication networks , 1996, Mob. Networks Appl..

[21]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[22]  G. Feng.  Fast algorithms for delay-constrained least-cost unicast routing , 2001 .

[23]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[24]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .