Robust Minimum-Cost Multicast with network coding

Abstract

In this paper, we consider the problem of MinimumCost Multicast (MCM) sub-graph optimization with network coding subject to uncertainty in link costs. A number of uncertainty sets such as ellipsoids and bounded polyhedral are taken into account. A robust optimization model is developed to obtain the optimal sub-graph by replacing an uncertain model of MCM by its Robust Counterpart (RC). Then, the analytic and computational optimization tools to obtain robust solutions of an uncertain MCM problem via solving the corresponding explicitly-stated convex RC program is developed and validated through simulations.