Skip to main content

GA-Based Hybrid Algorithm for MBR Problem of FIPP p-Cycles for Node Failure on Survivable WDM Networks

  • Conference paper
  • 2560 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 6840))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ramamurthy, A., Mukherjee, B.: Survivable WDM Mesh Networks-part II: Restoration. In: Proc. of IEEE ICC, pp. 2023–2030 (1999)

    Google Scholar 

  2. 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)

    Google Scholar 

  3. 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)

    Article  Google Scholar 

  4. 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)

    Article  Google Scholar 

  5. 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)

    Google Scholar 

  6. Holland, J.: Adaptation in Natural and Artificial Systems. Univ. of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  7. 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)

    Google Scholar 

  8. Boost Graph Library, http://www.boost.org

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics