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

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.