Efficient bandwidth guaranteed restoration algorithms for multicast connections

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper defines a new restoration strategy for provisioning bandwidth guaranteed recovery for multicast connections in presence of link failures. The new restoration strategy is formulated into a new Integer Linear Programming (ILP) algorithm and is compared with other existing restoration strategies. We also present a new heuristic algorithm based on this new restoration strategy. Results show that our heuristic algorithm performs competitively close to the ILP-based algorithm, and is more bandwidth efficient than other existing heuristic algorithms that are based on different restoration strategies. © IFIP International Federation for Information Processing 2005.

Cite

CITATION STYLE

APA

Lau, W., Jha, S., & Banerjee, S. (2005). Efficient bandwidth guaranteed restoration algorithms for multicast connections. In Lecture Notes in Computer Science (Vol. 3462, pp. 1005–1017). Springer Verlag. https://doi.org/10.1007/11422778_81

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free