Skip to main content
SpringerLink
Log in

Network restoration under dual failures using path-protecting preconfigured cycles

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

This paper presents a design algorithm for networks with a restoration mechanism that provides end-to-end path protection to a set of demands with specified working routes, where demands must survive one or two failures in optical networks and these failures may occur almost instantaneously. Each of the demands protected from two failures is assigned two restoration routes and restoration wavelengths on a cycle. A demand protected from a single failure is assigned one restoration route and restoration wavelengths on a cycle. These assignments are preconfigured so that switching and wavelength conversions are not needed at intermediate nodes of restoration routes. Splitting of demand across multiple restoration routes upon a failure occurrence is not allowed. The algorithm generates a large number of candidate Path-Protecting Preconfigured Cycles (PP-PCs). A candidate cycle may provide protection to a mix of demands requiring different protection levels, where demands may share under certain conditions restoration wavelengths even if they are exposed to common failure scenarios and have overlapping restoration routes. A near-optimal set of preconfigured cycles is selected from among all candidates, attempting to minimize the total cost of restoration wavelengths while ensuring that each demand is assigned to a single preconfigured cycle. This is achieved by solving a set covering problem followed by deleting duplicate demand assignments and by resolving wavelength assignment conflicts.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Akpuh, J., & Doucette, J. (2009). Enhanced failure-specific p-cycle network dual-failure restorability design and optimization. Journal of Optical Networking, 8, 1–13.

    Article  Google Scholar 

  2. Baloukov, D. (2009). Study in failure independent path-protecting p-cycle network design. M.S. thesis, University of Alberta, Edmonton, Canada.

  3. Baloukov, D., Grover, W. D., & Kodian, A. (2008). Toward jointly optimized design of failure-independent path-protecting p-cycle networks. Journal of Optical Networking, 7, 62–79.

    Article  Google Scholar 

  4. Chow, T. Y., Chudak, F., & Ffrench, A. M. (2004). Fast optical layer mesh protection using pre-cross-connected trails. IEEE/ACM Transactions on Networking, 12, 539–548.

    Article  Google Scholar 

  5. Cosares, S., Deutsch, D. N., Saniee, I., & Wasem, O. J. (1995). SONET toolkit: a decision support system for designing robust and cost-effective fiber-optics networks. Interfaces, 25(1), 20–40.

    Article  Google Scholar 

  6. Eiger, M. I., Luss, H., & Shallcross, D. F. (2010). Network restoration under a single link or node failure using preconfigured virtual cycles, Telecommunication Systems. doi:10.1007/s11235-009-9273-7, January, 2010.

  7. Grover, W. D. (2004). Mesh-based survivable networks. New Jersey: Prentice Hall.

    Google Scholar 

  8. Grover, W. D., & Stamatelakis, D. (1998). Cycle-oriented distributed pre-configuration: ring-like speed with mesh-like capacity for self-planning network restoration. In: Proceedings of the IEEE International Conference on Communications (ICC 98), pp. 537–543, Atlanta, Georgia, June 1998.

  9. Grue, A., & Grover, W. D. (2006). Characterization of pre-cross-connected trails for optical mesh network protection. Journal of Optical Networking, 5, 493–508.

    Article  Google Scholar 

  10. Grue, A., & Grover, W. D. (2007). Improved method for survivable network design based on pre-cross-connected trails. Journal of Optical Networking, 6, 200–216.

    Article  Google Scholar 

  11. Kennington, J., Olinick, E., Ortynski, A., & Spiride, G. (2003). Wavelength routing and assignment in a survivable wdm mesh network. Operations Research, 51, 67–79.

    Article  Google Scholar 

  12. Kodian, A., & Grover, W. D. (2005). Failure-independent path-protecting p-cycles: efficient and simple fully preconnected optimal-path protection. Journal of Lightwave Technology, 23, 3241–3259.

    Article  Google Scholar 

  13. Kodian, A., Grover, W. D., & Doucette, J. (2005). A disjoint rout-sets approach to design of path-protecting p-cycle networks. In Proceedings of workshop on design of reliable communication networks (DRCN 2005), pp. 231–238, Naples, Italy, October 2005.

  14. Jaumard, B., Rocha, C., Baloukov, D., & Grover, W. (2007). A column generation approach for design of networks using path-protecting p-cycles In Proceedings of workshop on design of reliable communication networks (DRCN 2007), Session MPM-4, La Rochelle, France, October, 2007.

  15. Li, G., Wang, D., Kalmanek, C., & Doverspike, R. (2003). Efficient distributed restoration path selection for shared mesh restoration. IEEE/ACM Transactions on Networking, 11, 761–771.

    Article  Google Scholar 

  16. Luss, H., Rosenwein, M. B., & Wong, R. T. (1998). Topological network design for SONET ring architecture. IEEE Transactions—SMC, Part A: Systems and Humans, 28, 780–790.

    Article  Google Scholar 

  17. Luss, H., & Wong, R. T. (2004). Survivable telecommunications network design under different types of failures. IEEE Transactions—SMC, Part A: Systems and Humans, 34, 521–530.

    Article  Google Scholar 

  18. Onguetou, D. P., Baloukov, D., & Grover, W. D. (2009). Near-optimal FIPP p-cycle network designs using general path-protecting p-cycles and combined GA-ILP methods. In Proceedings of workshop on design of reliable communication networks (DRCN 2009), pp. 243–250, Washington DC, USA, October 2009.

  19. Schupke, D. A. (2003). Multiple failures survivability in WDM networks with p-cycles. In Proceedings of the international symposium on circuits and systems (ISCAS 2003) (Vol. 3, pp. 866–869). May 2003.

  20. Simmons, J. M. (2007). Cost vs. capacity tradeoff with shared mesh protection in optical-bypass-enabled backbone networks. In Proceedings of the optical fiber communication and the national fiber optic engineers conference (OFC/NFOEC 2007), NthC2.pdf, Anaheim, California, March 2007.

  21. Wang, H., & Mouftah, H. T. (2005). p-cycles in multi-failure network survivability. In Proceedings of international conference of transparent optical networks (ICTON, 2005), Vol. 1, pp. 381–384.

Download references

Author information

Authors and Affiliations

  1. Telcordia Technologies, Piscataway, NJ, 08854, USA

    Martin I. Eiger, Hanan Luss & David F. Shallcross

Authors
  1. Martin I. Eiger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hanan Luss
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David F. Shallcross
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hanan Luss.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Eiger, M.I., Luss, H. & Shallcross, D.F. Network restoration under dual failures using path-protecting preconfigured cycles. Telecommun Syst 49, 271–286 (2012). https://doi.org/10.1007/s11235-010-9374-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-010-9374-3

Keywords

Search

Navigation