Bounds of redundant multicast routing problem with SRLG-diverse constraints: edge, path and tree models

Authors:
Zhe Liang;Wanpracha Art Chaovalitwongse
Affiliations:
Department of Industrial & Systems Engineering, Rutgers University, Piscataway, USA 08854;Department of Industrial & Systems Engineering, Rutgers University, Piscataway, USA 08854
Venue:
Journal of Global Optimization
Year:
2010

Citing 7
Cited 0

A heuristic for the Steiner problem in graphs

Computational Optimization and Applications
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs

IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraints

IEEE/ACM Transactions on Networking (TON)
Survey of multicast routing algorithms and protocols

ICCC '02 Proceedings of the 15th international conference on Computer communication
Shared risk link group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks

IEEE/ACM Transactions on Networking (TON)
Dynamic lightpath protection in WDM mesh networks under wavelength-continuity and risk-disjoint constraints

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes three classes of alternative mathematical programming models (i.e., edge-based, path-based, and tree-based) for redundant multicast routing problem with shared risk link group (SRLG)-diverse constraints (RMR-SRLGD). The goal of RMR-SRLGD problem is to find two redundant multicast trees, each from one of the two sources to every destination, at a minimum cost while ensuring the paths from the two sources to a destination do not share any common risks. Such risk could cause the failures of multiple links simultaneously. Therefore, the RMR-SRLGD problem ensures the availability and reliability of multicast services. We investigated and compared the theoretical bounds of the linear programming (LP) relaxation for all models. We also summarized a hierarchy relationship of the tightness of LP bounds for the proposed models.