Solving Many to many multicast QoS routing problem using DCA and proximal decomposition technique

MULTICAST gives an efficient way to transfer data from a source to all the member of a multicast group. The Multicast Quality of Service (QoS) routing problem consists in finding a set of paths from a source node to its multicast group satisfying the QoS requirements. This problem is known as one of the key problems in network optimization field. In this paper, we consider an extension of Multicast QoS routing problem called Many to many Multicast QoS routing problems, which problem deals with routing from multi-source nodes to multi-destination node sets satisfying the QoS constraints. It is a nonconvex program with a huge number of constraints problem. They are all NP-complete. We first formulate it as Concave Quadratic Program (CQP) and Binary Integer Linear Program (BILP) and then based on DC (Difference of Convex functions) programming and DCA (DC Algorithms), this paper aims to investigate a new algorithm for solving Many to many multicast QoS routing problems. To handle the large number of constraints, we introduce the proximal decomposition technique in DCA to tackle convex subprograms at each iteration. Preliminary numerical simulations are reported to show the efficiency of our customized DCA and the quality of computed solutions.