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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Braden, R., Zhang, L., Berson, S., Herzog, S., Jamin, S.: Resource ReSerVation Protocol (RSVP) –Version 1 Functional Specification, IETF. RFC 2205 (1997)
Van Caenegem, B., Van Parys, W., De Turck, F., Demeester, P.M.: Dimensioning of survivable WDM networks. IEEE J. Select. Areas Commum. 16(7), 1146–1157 (1998)
Cui, C., Zhao, Q.: Reserch on improved chaos optimization algorithm. Science Technology and Engineering 3 (2007)
Dovrolis, C., Ramanathan, P.: Resource aggregation for fault tolerance in integrated service networks. ACM Comput. Commun. Rev. 28(2), 39–53 (1998)
Grover, W.D., Iraschko, R.R., Zheng, Y.: Comparative methods and issues in design of mesh-restorable STM and ATM networks. In: Soriano, P., Sanso, B. (eds.) Telecommunication Network Planning, pp. 169–200. Kluwer, Boston (1999)
Iraschko, R.R., Mac Gregor, M.H., Grover, W.D.: Optimal capacity placement for path restoration in STM or ATM mesh survivable networks. IEEE/ACM Trans. Networking 6(3), 325–336 (1998)
Kodialam, M., Lakshman, T.V.: Dynamic routing of bandwidth guaranteed tunnels with restoration. In: Proc. IEEE INFOCOM (March 2000)
Li, J., Han, Y., Sun, Z.: Performance analysis of chaos optimization algorithm. Mini-microSystems 8(26), 140–143 (2005)
Liu, Y., Tipper, D.: Approximating optimal spare capacity allocation by successive survivable routing. IEEE/ACM Transactions on Networking 13(1) (February 2005)
Medhi, D., Tipper, D.: Some approaches to solving a multi-hour broadband network capacity design problem with single-path routing. Telecommun Syst. 13(2), 269–291 (2000)
Nederlof, L., Struyue, K., Shea, C., Misser, H., Du, Y., Tamayo, B.: End-to-end survivable broadband networks. IEEE Commun. Mag. 9, 63–70 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Z., Li, L., Sun, G., Hu, H. (2010). An Optimization Algorithm of Spare Capacity Allocation by Dynamic Survivable Routing. In: Tan, Y., Shi, Y., Tan, K.C. (eds) Advances in Swarm Intelligence. ICSI 2010. Lecture Notes in Computer Science, vol 6146. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13498-2_57
Download citation
DOI: https://doi.org/10.1007/978-3-642-13498-2_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13497-5
Online ISBN: 978-3-642-13498-2
eBook Packages: Computer ScienceComputer Science (R0)