Loading...

Robust minimum-cost multicast with network coding

Ghasvari, H ; Sharif University of Technology

544 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/CTS.2011.5898937
  3. Abstract:
  4. 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
  5. Keywords:
  6. Computational optimization ; Link cost ; Multicasts ; Robust optimization ; Robust solutions ; Uncertain models ; Costs ; Information technology ; Information theory ; Multicasting ; Optimization ; Telecommunication ; Network coding
  7. Source: 2011 18th International Conference on Telecommunications, ICT 2011 ; 2011 , Pages 288-292 ; 9781457700248 (ISBN)
  8. URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5898937