A 1.598 approximation algorithm for the Steiner problem in graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
ILP Formulation of Grooming over Wavelength-Routing with Protection
ONDM '01 Proceedings of the IFIP TC6 Fifth Working Conference on Optical Network Design and Modeling: Towards an Optical Internet: New Visions in Optical Network Design and Modelling
Resilient multicast using overlays
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS
Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS
Distributed computation of shared backup path in mesh optical networks using probabilistic methods
IEEE/ACM Transactions on Networking (TON)
A new heuristic routing algorithm with Hamiltonian Cycle Protection in survivable networks
Computer Communications
Ant colony optimization for Steiner tree problems
CSTST '08 Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology
Optical Networks: A Practical Perspective, 3rd Edition
Optical Networks: A Practical Perspective, 3rd Edition
Grooming-enhanced multicast in multilayer networks
ONDM'07 Proceedings of the 11th international IFIP TC6 conference on Optical network design and modeling
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
ILP formulations for p-cycle design without candidate cycle enumeration
IEEE/ACM Transactions on Networking (TON)
Application layer multicast with proactive route maintenance over redundant overlay trees
PCM'04 Proceedings of the 5th Pacific Rim conference on Advances in Multimedia Information Processing - Volume Part III
Novel algorithms for shared segment protection
IEEE Journal on Selected Areas in Communications
Achieving Shared Protection for Dynamic Multicast Sessions in Survivable Mesh WDM Networks
IEEE Journal on Selected Areas in Communications - Part Supplement
| Hi-index | 0.00 |
The evolution of multicast applications has speeded up. providers have to offer cheap and reliable services for their customers. One way to achieve this is to use a restoration method that provides relatively fast restoration calculated upon a failure, where nearly the minimal amount of resources is allocated. In this paper we propose a new, faster way of restoring multicast demands after link failure that is based on preplaning. We prove its optimality if a few preconditions hold. To do so a new formalization of the wavelength graph transformation (WGT) is presented. We show, based on simulations, that the beneficial properties of our method hold even when one or more preconditions are not kept.