Abstract
The Quality of Service (QoS) routing emphasizes to find paths from source to destination satisfying the QoS requirements. In this paper, we consider the five problems in QoS Routing called the MCP (Multi-Constrained Path) and the MCOP (Multi-Constrained Optimal Path). They are all NP-hard problems. We first formulate them as Binary Integer Linear Programs (BILP) and then investigate a new solution method based on DC (Difference of Convex functions) programming and DCA (DC Algorithms). Preliminary numerical results show that the proposed algorithm is promising: it is more robust than CPLEX, the best solver for BILP.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hoai An, L.T., Pham Dinh, T., Muu, L.D.: Exact penalty in d.c. programming. Vietnam Journal of Mathematics 27(2), 169–178 (1999)
Hoai An, L.T., Pham Dinh, T.: A Continuous approach for globally solving linearly constrained quadratic zero-one programming problem. Optimization 50(1-2), 93–120 (2001)
Hoai An, L.T., Pham Dinh, T.: The DC (difference of convex functions) Programming and DCA revisited with DC models of real world non convex optimization problems. Annals of Operations Research 133, 23–46 (2005)
Kuipers, F.A., Van Mieghem, P.F.A.: Conditions That Impact the Complexity of QoS Routing. IEEE/ACM Transactions on Volume Networking 13(4), 717–730 (2005)
Kuipers, F.A., Korkmaz, T., Krunz, M., Van Mieghem, P.: Overview of constraint-based path selection algorithms for QoS routing. IEEE Commun. Mag. 40(12), 50–55 (2002)
Chen, S., Nahrstedt, C.: On Finding Multi-constrained Paths. International Journal of Computational Geometry and Applications (1998)
Hassin, R.: Approximation Schemes for the Restricted Shortest Path Problem. Mathematics of Operations Research 17(1), 36–42 (1992)
Liu, G., Ramakrushnam, K.G.: A*Prune: an algorithm for finding K shortest paths subject to multiple constraints. In: IEEE INFOCOM 2001, April 2, 2001, pp. 743–749 (2001)
Lorenz, D.H., Orda, A., Raz, D., Shavitt, Y.: Efficient QoS Partition and Routing of Unicast and Multicast. In: Proceedings IEEE/IFIP IWQoS, Pittsburgh, PA (June 2000)
Mieghem, P.V., Kuipers, F.A.: On the complexity of QoS routing. Computer Communications 26(4), 376–387 (2003)
Mieghem, P.V., Kuipers, F.A.: Concepts of exact QoS routing algorithms. IEEE/ACM Trans. on Networking 12(5), 851–864 (2004)
Orda, A., Sprintson, A.: Efficient algorithm for computing disjoint QoS paths. In: IEEE INFOCOM 2004, March 1, 2004, pp. 727–738 (2004)
Pham Dinh, T., Hoai An, L.T.: Convex analysis approach to DC programming: Theory, Algorithms and Applications. Acta Mathematica Vietnamica, dedicated to Professor Hoang Tuy on the occassion of his 70th birthday 22(1), 289–357 (1997)
Pham Dinh, T., Hoai An, L.T.: DC optimization algorithms for solving the trust region subproblem. SIAM J. Optimization 8, 476–505 (1998)
Warburton, Q.: Approximation of Pareto Optima in Multiple Objective Shortest Path Problems. Operations Research 35, 70–79 (1987)
Yuan, X., Liu, X.: Heuristic algorithms for multi-constrained quality of service routing. In: Proceedings of INFOCOM 2001, vol. 2, pp. 844–853 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Son, T.A., An, L.T.H., Khadraoui, D., Tao, P.D. (2010). Solving QoS Routing Problems by DCA. In: Nguyen, N.T., Le, M.T., Świątek, J. (eds) Intelligent Information and Database Systems. ACIIDS 2010. Lecture Notes in Computer Science(), vol 5991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12101-2_47
Download citation
DOI: https://doi.org/10.1007/978-3-642-12101-2_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12100-5
Online ISBN: 978-3-642-12101-2
eBook Packages: Computer ScienceComputer Science (R0)