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
Online AccessGet full text

Cover

Loading…