A heuristic for the Steiner problem in graphs
Computational Optimization and Applications
A comparison of reliable multicast protocols
Multimedia Systems
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
IEEE/ACM Transactions on Networking (TON)
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On the complexity of the Maximum Subgraph Problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Diverse Routing for Shared Risk Resource Groups (SRRG) Failures in WDM Optical Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
Computer Networks and ISDN Systems
IEEE/ACM Transactions on Networking (TON)
Cybernetics and Systems Analysis
Survivable IP network design with OSPF routing
Networks - Special Issue on Multicommodity Flows and Network Design
TIE breaking: tunable interdomain egress selection
IEEE/ACM Transactions on Networking (TON)
Streaming cache placement problems: complexity and algorithms
International Journal of Computational Science and Engineering
Efficient multicasting over large-scale WLANs through controlled association
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.01 |
This paper presents a redundant multicast routing problem in multilayer networks that arises from large-scale distribution of realtime multicast data (e.g., Internet TV, videocasting, online games, stock quotes). Since these multicast services commonly operate in multilayer networks, the communications paths need to be robust against a single router or link failure as well as multiple such failures due to shared risk link groups (SRLGs). The main challenge of this multicast is to ensure the service availability and reliability using a path protection scheme, which is to find a redundant path that is SRLG-disjoint (diverse) from each working path. The objective of this problem is, therefore, to find two redundant multicast trees, each from one of the two redundant sources to every destination, at a minimum total communication cost whereas two paths from the two sources to every destination are guaranteed to be SRLG-diverse (i.e., links in the same risk group are disjoint). In this paper, we present two new mathematical programming models, edge-based and path-based, for the redundant multicast routing problem with SRLG-diverse constraints. Because the number of paths in path-based model grows exponentially with the network size, it is impossible to enumerate all possible paths in real life networks. We develop three approaches (probabilistic, non-dominated and nearly non-dominated) to generate potentially good paths that may be included in the path-based model. This study is motivated by emerging applications of internet-protocol TV service, and we evaluate the proposed approaches using real life network topologies. Our empirical results suggest that both models perform very well, and the nearly non-dominated path approach outperforms all other path generation approaches.