Mathematical programming approaches for dual multicast routing problem with multilayer risk cost

This paper addresses a dual multicast routing problem with shared risk link group (SRLG) diverse costs (DMR‐SRLGD) that arises from large‐scale distribution of realtime multicast data (e.g., internet protocol TV, videocasting, online games, stock price update). The goal of this problem is to find two redundant multicast trees, each from one of the two sources to every destination at a minimum cost. The cost of the problem contains two parts: the multicast routing cost and the shard common risk cost. Such common risk could cause the failures of multiple links simultaneously. Therefore, the DMR‐SRLGD ensures the availability and reliability of multicast service. We formulate an edge‐based model for the DMR‐SRLGD. In addition, we also propose a path‐based model that rises from the Dantzig‐Wolfe decomposition of the edge‐based model, and develop a column‐generation framework to solve the linear relaxation of the path‐based formulation. We then employ a branch‐and‐price solution method to find integer solutions to DMR‐SRLGD. We also extend both edge‐based and path‐based models to handle the complex quality of service requirements. The computational results show the edge‐based model is superior than the path‐based model for the easy and small test instances, whereas the path‐based model provides better solutions in a timely fashion for hard or large test instances.