Solving QoS routing problems by DCA

Authors:
Ta Anh Son;Le Thi Hoai An;Djamel Khadraoui;Pham Dinh Tao
Affiliations:
Laboratory of Modelling, Optimization & Operations Research, National Institute for Applied Sciences, Rouen, France and CRP Henri Tudor, Kirchberg, Luxembourg;Laboratory of Theoretical and Applied Computer Science, Paul Verlaine-Metz University, Metz, France;CRP Henri Tudor, Kirchberg, Luxembourg;Laboratory of Modelling, Optimization & Operations Research, National Institute for Applied Sciences, Rouen, France
Venue:
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
Year:
2010

Citing 7
Cited 0

Approximation of Pareto optima in multiple-objective, shortest-path problems

Operations Research
Approximation schemes for the restricted shortest path problem

Mathematics of Operations Research
A D. C. Optimization Algorithm for Solving the Trust-Region Subproblem

SIAM Journal on Optimization
Concepts of exact QoS routing algorithms

IEEE/ACM Transactions on Networking (TON)
Conditions that impact the complexity of QoS routing

IEEE/ACM Transactions on Networking (TON)
On the complexity of QoS routing

Computer Communications
An overview of constraint-based path selection algorithms for QoS routing

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

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.