Abstract
In this paper, the minimal backup reprovisioning (MBR) problem is studied, in which, the failure-independent path protecting p-cycles (FIPP p-cycles) scheme is considered for single node-failure on WDM networks. After recovering the affected lightpaths from a node failure, the goal of the MBR is to re-arrange the protecting and available resources such that working paths can be protected against next node failure if possible. This is a hard problem, a hybrid algorithm which combines heuristic algorithm and genetic algorithm is proposed to solve this problem. The simulation results of the proposed method are also given.
This work was partly supported by the National Science Council (NSC) of Taiwan, R.O.C. under Grant Number NSC-99-2221-E-018-015.
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
Ramamurthy, A., Mukherjee, B.: Survivable WDM Mesh Networks-part II: Restoration. In: Proc. of IEEE ICC, pp. 2023–2030 (1999)
Su, H.K., Wu, C.S., Chu, Y.S.: IP Local Node Protection. In: Proc. of Second International Conference on Systems and Networks Communications, ICSNC, vol. 58 (2007)
Stamatelakis, D., Grover, W.D.: IP layer Restoration and Network Planning Based on Virtual Protection Cycles. IEEE Journal on Selected Areas in Communications 18(10), 1938–1949 (2000)
Kodian, A., Grover, W.D.: Failure-independent Path-protecting P-cycles: Efficient and Simple Fully Pre-connected Optical Path Protection. Journal of Lightwave Technology 23(10), 3241–3259 (2005)
Tornatore, M., Lucerna, D., Pattavina, A.: Improving Efficiency of Backup Reprovisioning in WDM Networks. In: Proc. of IEEE Inforcom Phoenix, AZ, USA, pp. 726–734 (15–17) (2008)
Holland, J.: Adaptation in Natural and Artificial Systems. Univ. of Michigan Press, Ann Arbor (1975)
Liu, C., Ruan, L.: Finding Good Candidate Cycles for Efficient P-cycle Network Design. In: Proc. of Int. Conf. on Computer Communications and Networks, ICCCN 2004, Chicago, USA, pp. 321–326 (11–13) (2004)
Boost Graph Library, http://www.boost.org
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Din, DR. (2012). GA-Based Hybrid Algorithm for MBR Problem of FIPP p-Cycles for Node Failure on Survivable WDM Networks. In: Huang, DS., Gan, Y., Premaratne, P., Han, K. (eds) Bio-Inspired Computing and Applications. ICIC 2011. Lecture Notes in Computer Science(), vol 6840. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24553-4_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-24553-4_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24552-7
Online ISBN: 978-3-642-24553-4
eBook Packages: Computer ScienceComputer Science (R0)