An optimization algorithm of spare capacity allocation by dynamic survivable routing

Authors:
Zuxi Wang;Li Li;Gang Sun;Hanping Hu
Affiliations:
Institute for Pattern Recognition and Artificial Intelligence, Huazhong University of Science and Technology/ National Key Laboratory of Science & Technology on multi-spectral information processi ...;Institute for Pattern Recognition and Artificial Intelligence, Huazhong University of Science and Technology/ National Key Laboratory of Science & Technology on multi-spectral information processi ...;Institute for Pattern Recognition and Artificial Intelligence, Huazhong University of Science and Technology/ National Key Laboratory of Science & Technology on multi-spectral information processi ...;Institute for Pattern Recognition and Artificial Intelligence, Huazhong University of Science and Technology/ National Key Laboratory of Science & Technology on multi-spectral information processi ...
Venue:
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part II
Year:
2010

Citing 5
Cited 0

Resource aggregation for fault tolerance in integrated services networks

ACM SIGCOMM Computer Communication Review
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks

IEEE/ACM Transactions on Networking (TON)
Approximating optimal spare capacity allocation by successive survivable routing

IEEE/ACM Transactions on Networking (TON)
End-to-end survivable broadband networks

IEEE Communications Magazine
Dimensioning of survivable WDM networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.