An Optimization Algorithm of Spare Capacity Allocation by Dynamic Survivable Routing

The survivability of MPLS networks has received considerable attention in recent years. One of the key tasks is to route backup paths and allocate spare capacity in the network to provide the QoS guaranteed communication services to a set of failure scenarios. This is a complex multi-constraint optimization problem, called the spare capacity allocation (SCA). In this paper, a dynamic survivable routing (DSR) algorithm using the chaotic optimization theory is proposed to solve it. Comparing traditional SCA algorithm, numerical results show that DSR has the satisfying QoS performances.