Skip to main content
SpringerLink
Log in

Network restoration under a single link or node failure using Preconfigured Virtual Cycles

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

This paper presents a design algorithm for networks with a restoration mechanism that provides failure-independent, end-to-end path protection to a set of given demands under a single link or node failure with a focus on optical networks. The restoration routes are provided on preconfigured cycles, where each of the demands is assigned a single restoration route and specific restoration wavelengths on a segment of one cycle (splitting is not allowed). The number of reserved restoration wavelengths may vary from one link to the next on a cycle; hence, we refer to these cycles as Preconfigured Virtual Cycles (PVCs). The network design algorithm consists of three major parts. The first part generates a large number of candidate PVCs. Our algorithm allows assignment of certain demands that have common failure scenarios to the same PVC. The second part selects a set of PVCs from among the candidates, attempting to minimize the total reserved restoration cost while ensuring that each demand is assigned to one PVC. This is achieved by solving a set covering problem followed by elimination of duplicate assignments. The third part resolves conflicts of wavelength assignments.

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

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

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

  4. Grover, W. D. (2004). Meshed-based survivable networks. Englewood Cliffs: Prentice Hall.

    Google Scholar 

  5. 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), Atlanta, Georgia (pp. 537–543) June 1998.

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

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

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

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

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

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

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

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

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 a single link or node failure using Preconfigured Virtual Cycles. Telecommun Syst 46, 17–30 (2011). https://doi.org/10.1007/s11235-009-9273-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-009-9273-7

Keywords

Search

Navigation