Name
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-12101-2_47 | ACIIDS |
Keywords | Field | DocType |
new solution method,multi-constrained optimal path,best solver,dc algorithms,multi-constrained path,qos routing,qos routing problem,binary integer linear programs,np-hard problem,convex function,qos requirement,quality of service,np hard problem,constrained optimization,satisfiability | Mathematical optimization,Computer science,Quality of service,Convex function,Binary Integer Decimal,Solver,Dc programming | Conference |
Volume | ISSN | ISBN |
5991 | 0302-9743 | 3-642-12100-5 |
Citations | PageRank | References |
2 | 0.36 | 12 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ta Anh Son | 1 | 11 | 2.13 |
| Le Thi Hoai An | 2 | 1038 | 80.20 |
| Djamel Khadraoui | 3 | 218 | 32.33 |
| Pham Dinh Tao | 4 | 1340 | 104.84 |