Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms
From MaRDI portal
Publication:976036
DOI10.1016/j.cor.2009.12.009zbMath1188.90063MaRDI QIDQ976036
Zhe Liang, Wanpracha Art Chaovalitwongse, Meeyoung Cha, Sue B. Moon
Publication date: 11 June 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.12.009
90C35: Programming involving graphs or networks
90C11: Mixed integer programming
90C29: Multi-objective and goal programming
90B18: Communication networks in operations research
Related Items
A multicast problem with shared risk cost, Mathematical programming approaches for dual multicast routing problem with multilayer risk cost
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A preference-based approach to spanning trees and shortest paths problems
- On a multicriteria shortest path problem
- Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks
- Constructing disjoint paths on expander graphs
- A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
- A heuristic for the Steiner problem in graphs
- Efficient multicasting over large-scale WLANs through controlled association
- Optimal multicast route packing
- A survey of combinatorial optimization problems in multicast routing
- Dynamic lightpath protection in WDM mesh networks under wavelength-continuity and risk-disjoint constraints
- A combinatorial algorithm for message scheduling on controller area networks
- Survivable IP network design with OSPF routing
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
- Node-and edge-deletion NP-complete problems
- On the complexity of the Maximum Subgraph Problem
