Efficient bandwidth guaranteed restoration algorithms for multicast connections

Authors:
William Lau;Sanjay Jha;Suman Banerjee
Affiliations:
University of New South Wales, Sydney, NSW, Australia;University of New South Wales, Sydney, NSW, Australia;University of Wisconsin-Madison, Madison, WI
Venue:
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Year:
2005

Citing 5
Cited 2

Restoration strategies and spare capacity requirements in self-healing ATM networks

IEEE/ACM Transactions on Networking (TON)
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs

IEEE/ACM Transactions on Networking (TON)
Enabling conferencing applications on the internet using an overlay muilticast architecture

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup

ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Failure-Oriented Path Restoration Algorithm for Survivable Networks

IEEE Transactions on Network and Service Management

Construction of a proxy-based overlay skeleton tree for large-scale real-time group communications

NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Comparison of recovery schemes to maximize restorable throughput in multicast networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

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.