Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms
DOI10.1016/J.COR.2009.12.009zbMATH Open1188.90063OpenAlexW1976411149MaRDI QIDQ976036FDOQ976036
Authors: Zhe Liang, Meeyoung Cha, Sue B. Moon, Wanpracha A. Chaovalitwongse 
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
Recommendations
- Bounds of redundant multicast routing problem with SRLG-diverse constraints: edge, path and tree models
- Mathematical programming approaches for dual multicast routing problem with multilayer risk cost
- A multicast problem with shared risk cost
- Efficient and scalable provisioning of always-on multicast streaming services
- Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures
Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Communication networks in operations research (90B18)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Node-and edge-deletion NP-complete problems
- On a multicriteria shortest path problem
- Survivable IP network design with OSPF routing
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
- Optimization problems in multicast tree construction
- A survey of combinatorial optimization problems in multicast routing
- Title not available (Why is that?)
- A heuristic for the Steiner problem in graphs
- Dynamic lightpath protection in WDM mesh networks under wavelength-continuity and risk-disjoint constraints
- Title not available (Why is that?)
- A preference-based approach to spanning trees and shortest paths problems
- On the complexity of the maximum subgraph problem
- A combinatorial algorithm for message scheduling on controller area networks
- 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
- Efficient multicasting over large-scale WLANs through controlled association
- Optimal multicast route packing
Cited In (8)
- A multicast problem with shared risk cost
- Bounds of redundant multicast routing problem with SRLG-diverse constraints: edge, path and tree models
- Finding disjoint paths in networks with star shared risk link groups
- Redundancy system design for an aircraft door management system
- Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures
- Mathematical programming approaches for dual multicast routing problem with multilayer risk cost
- Lumping Reductions for Multispread in Multi-Layer Networks
- Distributed Computing - IWDC 2003
This page was built for publication: Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976036)
