Solving the MCOP problem optimally

Providing guaranteed end-to-end quality of service (QoS) is a key issue for deploying multimedia applications on broadband integrated services networks. To support such a QoS-based service, a problem concerning how to select a feasible end-to-end path in order to satisfy multiple QoS constraints simultaneously must be studied. Two exact algorithms, branch-and-bound and extended Bellman-Ford algorithms, are proposed for this NP-complete problem. In spite of the time complexity of the branch-and-bound algorithm being O(d/sup n/) at the worst case, simulation results show that the branch-and-bound method not only outperforms the extended Bellman-Ford method, but also is an efficient method when it is applied to random networks and practical networks like ANSNET. As for mesh networks, it is observed that our branch-and-bound method is efficient only for networks where the number of hops of the desired MCOP (multiple constrained optimal path) is less than 15.

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

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

[3]  Spyros Tragoudas,et al.  An efficient algorithm for finding a path subject to two additive constraints , 2002, Comput. Commun..

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

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

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

[7]  Kevin C. Almeroth,et al.  The Use of Multicast Delivery to Provide a Scalable and Interactive Video-on-Demand Service , 1996, IEEE J. Sel. Areas Commun..

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

[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.

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

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

[13]  Ian M. Leslie,et al.  How bad is naive multicast routing? , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.