Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Congestion avoidance and control
ACM SIGCOMM Computer Communication Review - Special twenty-fifth anniversary issue. Highlights from 25 years of the Computer Communication Review
Applying tabu search to spare capacity planning for network restoration
Computers and Operations Research
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Comparisons of packet scheduling algorithms for fair service among connections on the internet
Journal of High Speed Networks
Simple pre-provisioning scheme to enable fast restoration
IEEE/ACM Transactions on Networking (TON)
Fast reroute with pre-established bypass tunnel in MPLS
Computer Communications
Bandwidth guaranteed routing with fast restoration against link and node failures
IEEE/ACM Transactions on Networking (TON)
Maximizing restorable throughput in MPLS networks
IEEE/ACM Transactions on Networking (TON)
Efficient bandwidth guaranteed restoration algorithms for multicast connections
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
| Hi-index | 0.00 |
Multicast networks have many applications especially in real-time content delivery systems. For high-quality services, users do not expect to witness any interruption; thus, network link failure has to be handled gracefully. In unicast networks there are many approaches for dealing with link failures using backup paths. Recently, Cohen and Nakibly categorized these methods, provided linear programming formulations for optimizing network throughput under the assumption that the paths are splitable, and compared them experimentally. In this work, we take their approach and apply to the multicast failure recovery problem. We propose backup bandwidth allocation algorithms based on linear programs to maximize the throughput, and perform an experimental study on the performance of recovery schemes. We study many recovery schemes in multicast networks and propose a new recovery scheme that performs better than all other recovery scheme except the one that recomputed the whole multicast tree from scratch for each link failure.