ILP-based design of survivable broadcast trees


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… (More)


4 Figures and Tables

Cite this paper

@article{Mao2009ILPbasedDO, title={ILP-based design of survivable broadcast trees}, author={Minjing Mao and Bin Wu and Kwan Lawrence Yeung}, journal={2009 International Conference on High Performance Switching and Routing}, year={2009}, pages={1-6} }