Applicability of resilient routing layers for k-fault network recovery
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
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
Surviving failures in bandwidth-constrained datacenters
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Surviving failures in bandwidth-constrained datacenters
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
| Hi-index | 0.00 |
In this article, a new polynomial-time approximation algorithm called Service Path Local Optimization (SPLO) is proposed for the online restoration problem. SPLO is shown to perform competitively with existing offline heuristics algorithm in terms of spare capacity. SPLO is designed for online computation where only one request is computed at any one time, and the decision making does not depend on future requests. The polynomial-time and online nature of the algorithm makes SPLO suitable for use in real-time on-demand path request applications. SPLO can be combined with a non-polynomial post-processing component that re-optimizes the backup paths. Significant reductions in spare capacity requirements are achievable at the expense of higher computation time. Further, the potential for SPLO as an algorithm in traffic engineering applications is investigated by looking at the performance impact when source-destination-based traffic aggregation is applied. We also introduce a new concept called path intermix where the service path驴s allocated bandwidth can be used by the backup paths protecting that particular service path.