Optimal and heuristic algorithms for quality-of-service routing with multiple constraints

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 about how to determine a feasible path between two given end-points, so that a set of QoS path constraints can be satisfied simultaneously. Based on the branch-and-bound technique and tabu-searching strategy, an optimal algorithm and a tabu-search based heuristic are developed in this paper for solving the MCP problem with multiple constraints. The experimental resuits show that our tabu-search based heuristic not only outperforms the previous method published in literature, but also demonstrates that it is indeed a highly efficient method for solving the MCP problem in large-scale networks.

[1]  Anoop Ghanwani,et al.  Block loss reduction in ATM networks , 1996, Comput. Commun..

[2]  Ariel Orda,et al.  QoS routing in networks with inaccurate information: theory and algorithms , 1999, TNET.

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

[4]  Erol Gelenbe,et al.  Design and performance of cognitive packet networks , 2001, Perform. Evaluation.

[5]  Erol Gelenbe,et al.  Self-awareness and adaptivity for quality of service , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[6]  Piet Van Mieghem,et al.  The impact of correlated link weights on QoS routing , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[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]  Erol Gelenbe,et al.  Measurement and performance of a cognitive packet network , 2001, Comput. Networks.

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

[10]  Hsueh-I Lu,et al.  Multicast routing with multiple QoS constraints in ATM networks , 2000, Inf. Sci..

[11]  R. F. Brown,et al.  PERFORMANCE EVALUATION , 2019, ISO 22301:2019 and business continuity management – Understand how to plan, implement and enhance a business continuity management system (BCMS).

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

[13]  Wen-Lin Yang.  A comparison of two optimal approaches for the MCOP problem , 2004, J. Netw. Comput. Appl..

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

[15]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[16]  Erol Gelenbe,et al.  Cognitive packet networks: QoS and performance , 2002, Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems.

[17]  Peter Steenkiste,et al.  Quality-of-Service Routing for Traffic with Performance Guarantees , 1997 .

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

[19]  Ariel Orda,et al.  QoS routing in networks with uncertain parameters , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[20]  Erol Gelenbe,et al.  Call Establishment Overload in Large ATM Networks , 1997, Perform. Evaluation.

[21]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

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

[23]  Erol Gelenbe,et al.  Bandwidth allocation and call admission control in high-speed networks , 1997, IEEE Commun. Mag..

[24]  Zhi-Hong Mao,et al.  Function approximation with spiked random networks , 1999, IEEE Trans. Neural Networks.

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

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

[27]  James R. Beers.  Book Review: Internetworking with TCP/IP Volume III: Client-Server Programming and Applications by Douglas E. Comer and David L. Stevens (Prentice Hall, 1993) , 1993, CCRV.

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

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

[30]  David Clark,et al.  Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism , 1992, SIGCOMM.

[31]  Ariel Orda,et al.  Optimal partition of QoS requirements on unicast paths and multicast trees , 2002, TNET.