Exact and Heuristic Algorithms for Multi-constrained Path Selection Problem

The multi-constrained path (MCP) selection problem occurs when the quality of services (QoS) are supported for point-to-point connections in the distributed multimedia applications deployed on the Internet. This NP-complete problem is concerned how to determine a feasible path between two end-points, so that a set of QoS path constraints can be satisfied simultaneously. Based on the branch-and-bound technology and tabu-searching strategy, an optimal algorithm and a heuristic algorithm are proposed in this paper. The experimental results show that our heuristic algorithm not only has very good performance on several different network topologies, but also is very efficient method for solving large-scale MCP problem.

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

[2]  Spyros Tragoudas,et al.  An efficient algorithm for finding a path subject to two additive constraints , 2000, SIGMETRICS '00.

[3]  Alberto Leon-Garcia,et al.  QoS Based Multicast Routing Algorithms for Real Time Applications , 1998, Perform. Evaluation.

[4]  Douglas Comer,et al.  Internetworking with TCP/IP , 1988 .

[5]  Marwan Krunz,et al.  A randomized algorithm for finding a path subject to multiple QoS constraints , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

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

[7]  Ariel Orda.  Routing with end-to-end QoS guarantees in broadband networks , 1999, TNET.

[8]  Wen-Lin Yang.  Solving the MCOP problem optimally , 2002, 27th Annual IEEE Conference on Local Computer Networks, 2002. Proceedings. LCN 2002..

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

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