Routing multimedia traffic with QoS guarantees

• Published in: IEEE transactions on multimedia Vol. 5; no. 3; pp. 429 - 443
• Main Authors: Korkmaz, T., Krunz, M.M.
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 01.09.2003; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Approximation algorithms; Complexity; Computational complexity; Constraint optimization; Cost function; Feasibility; Heuristic; Heuristic algorithms; Mathematical analysis; Multimedia; Network topologies; Networks; Nonlinearity; NP-complete problem; Optimization; Polynomials; Quality of service; Routing; Studies; Telecommunication traffic
• ISSN: 1520-9210; 1941-0077
• DOI: 10.1109/TMM.2003.811627

One of the challenging issues in exchanging multimedia information over a network is how to determine a feasible path that satisfies all the quality-of-service (QoS) requirements of multimedia applications while maintaining high utilization of network resources. The latter objective implies the need to impose an additional optimality requirement on the feasibility problem. This can be done through a primary cost function (e.g., administrative weight, hop-count) according to which the selected feasible path is optimal. In general, multiconstrained path selection, with or without optimization, is an NP-complete problem that cannot be exactly solved in polynomial time. Heuristics and approximation algorithms with polynomial- and pseudo-polynomial-time complexities are often used to deal with this problem. However, existing solutions suffer either from excessive computational complexities that cannot be used for online network operation or from low performance. Moreover, they only deal with special cases of the problem (e.g., two constraints without optimization, one constraint with optimization, etc.). For the feasibility problem under multiple constraints, some researchers have recently proposed a nonlinear cost function whose minimization provides a continuous spectrum of solutions ranging from a generalized linear approximation (GLA) to an asymptotically exact solution. In this paper, we propose an efficient heuristic algorithm for the most general form of the problem. We first formalize the theoretical properties of the above nonlinear cost function. We then introduce our heuristic algorithm (H/spl I.bar/MCOP), which attempts to minimize both the nonlinear cost function (for the feasibility part) and the primary cost function (for the optimality part). We prove that H/spl I.bar/MCOP guarantees at least the performance of GLA and often improves upon it. H/spl I.bar/MCOP has the same order of complexity as Dijkstra's algorithm. Using extensive simulations on random graphs and realistic network topologies with correlated and uncorrelated link weights from several distributions including uniform, normal, and exponential, we show the efficiency of H/spl I.bar/MCOP over its (less general) contenders in terms of finding feasible paths and minimizing their costs under the same level of computational complexity.