ILP-based design of survivable broadcast trees

Authors:
Minjing Mao;Bin Wu;Kwan L. Yeung
Affiliations:
Department of Electrical and Electronic Engineering, The University of Hong Kong, Pokfulam, Hong Kong;Department of Electrical and Electronic Engineering, The University of Hong Kong, Pokfulam, Hong Kong;Department of Electrical and Electronic Engineering, The University of Hong Kong, Pokfulam, Hong Kong
Venue:
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Year:
2009

Citing 7
Cited 0

Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs

IEEE/ACM Transactions on Networking (TON)
Restoration Methods for Multi-Service Optical Networks

ONDM '98 Proceedings of the IFIP TC6 Second International Working Conference on Optical Network Design and Modeling
Fast optical layer mesh protection using pre-cross-connected trails

IEEE/ACM Transactions on Networking (TON)
The Multi-Tree Approach To Reliability In Distributed Networks

SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Faster algorithms for construction of recovery trees enhancing QoP and QoS

IEEE/ACM Transactions on Networking (TON)
WDM optical communication networks: progress and challenges

IEEE Journal on Selected Areas in Communications
Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study survivable broadcast in high-speed networks against a single link/node failure. We follow the classic approach of blue/red tree [1] to construct a pair of spanning trees (i.e, a blue tree and a red tree) such that the connectivity between the root and an arbitrary node is ensured (via at least one tree) in the presence of a single link/node failure. To ensure that the blue and red trees are constructed in a cost-efficient way, heuristic algorithms have been designed to minimize the cost involved in tree construction. In this paper, we tackle the same problem but resorting to Integer Linear Programming (ILP) for optimal solutions. Two efficient ILPs are formulated, one for protecting against single link failure (MinCost-E) and the other for node failure (MinCost-V). Numerical results show that our ILPs can generate optimal solutions in relatively short amount of time. As compared with the existing heuristic algorithms, we observe a significant improvement in performance.