Robust Minimum-Cost Multicast with network coding

In this paper, we consider the problem of Minimum-Cost 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 th...

Full description

Saved in:
Bibliographic Details
Published in2011 18th International Conference on Telecommunications pp. 288 - 292
Main Authors Ghasvari, H., Khalaj, B. H., Raayatpanah, M. A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2011
Subjects
Ellipsoids
Network coding
Optimization
Programming
Robustness
Stochastic processes
Uncertainty
Online AccessGet full text

Cover

More Information
Summary:In this paper, we consider the problem of Minimum-Cost 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.
ISBN:9781457700255
1457700255
DOI:10.1109/CTS.2011.5898937