Solving Multicast QoS Routing Problem in the Context V2I Communication Services Using DCA

Author

Son, Ta Anh ; An, Le Thi Hoai ; Khadraoui, Djamel ; Tao, Pham Dinh

Author_Institution

CRP Henri Tudor, Luxembourg City, Luxembourg

fYear

2010

fDate

18-20 Aug. 2010

Firstpage

471

Lastpage

476

Abstract

The Multicast Quality of Service (QoS) routing emphasizes to find a set of paths from a source node to a destination node set satisfying the QoS requirements. In this paper, we consider the two problems in Multicast QoS Routing called the MCM (Multi-Constrained Mutlicast Tree) and the MCOM (Multi-Constrained Optimal Multicast Tree). They are all NP-complete problems. We first formulate them as Quadratic Concave Program and Binary Integer Linear Program (BILP) and then investigate a new solution method based on DC (Difference of Convex functions) programming and DCA (DC Algorithms). Preliminary numerical results are compared with CPLEX, the best solver for BILP. They show that the proposed algorithm is an efficient algorithm for solving BILP.

Keywords

integer programming; linear programming; mobile radio; multicast communication; quadratic programming; quality of service; telecommunication network routing; DCA; V2I communication; binary integer linear program; destination node; difference of convex functions; multi-constrained optimal multicast tree; multicast quality of service routing; quadratic concave program; source node; Additives; Convex functions; Loss measurement; Mobile communication; Programming; Quality of service; Routing; Binary Integer Linear Programming (BILP); DC Algorithm; DC programming; Exact Penalty; Multi-Constrained Multicast Tree; Multi-Constrained Optimal Multicast Tree; Multicast QoS routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer and Information Science (ICIS), 2010 IEEE/ACIS 9th International Conference on

Conference_Location

Yamagata

Print_ISBN

978-1-4244-8198-9

Type

conf

DOI

10.1109/ICIS.2010.50

Filename

5590490