Advertisement

Designing Fast and Bandwidth Efficient Protection Scheme for WDM Optical Networks

  • Yu Lin
  • Haitham S. Hamza
  • Jitender S. Deogun
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3976)

Abstract

In this paper, we introduce the Pre-cross-connected Segment First — PXSFirst protection scheme; a new path-based protection schemes for WDM optical networks. The goal of the PXSFirst scheme is to achieve fast recovery, while maximizing bandwidth sharing to improve bandwidth utilization. Similar to pre-cross-connected trails (PXTs) protection scheme, PXSFirst ensures that all backup paths are pre-cross-connected, and hence eliminates the switching configuration delay along backup paths. However, unlike the PXT scheme, where backup paths can only share trails, PXSFirst breaks backup paths into smaller segments by existing end nodes, and hence, increases the possibility of bandwidth sharing. Extensive simulation results for different network topologies and under different traffic patterns show that the proposed scheme has better blocking performance and less bandwidth utilization (an average of 11.0% reduction) compared to existing PXT protection schemes.

Keywords

Protection Scheme Bandwidth Utilization Backup Path Short Path Algorithm Primary Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Ou, C., Zhang, J., Zang, H., Sahasrabuddhe, L.H., Mukherjee, B.: New and improved approaches for shared-path protection in WDM mesh networks. J. Lightwave Technology 22(5), 1223–1232 (2004)CrossRefGoogle Scholar
  2. 2.
    Schupke, D.A., Gruber, C.G., Autenrieth, A.: Optimal configuration of p − cycles in WDM networks. In: Proc. of IEEE ICC 2002, pp. 2761–2765 (2002)Google Scholar
  3. 3.
    Stamatelakis, D.: Theory and algorithms for preconfiguration of sparse capacity in mesh restorable networks, M.Sc. Thesis. University of Alberta, Canda (1997)Google Scholar
  4. 4.
    Shen, G., Grover, W.D.: Extending the p − cycle concept to path segment protection for span and node failure recovery. J. of Selected Areas in Communications 21(8) (2003)Google Scholar
  5. 5.
    Mohan, G., Siva Ram Murthy, C., Somani, A.K.: Efficient algorithms for routing dependable connections in WDM optical networks. IEEE/ACM Transactions on Networking 9(5), 553–566 (2001)CrossRefGoogle Scholar
  6. 6.
    Kim, S.-L., Lumetta, S.S.: Capacity-efficient protection with fast recovery in optically transparent mesh networks. In: Proc. 1st International Conference on Broadband Networks (BroadNets 2004), pp. 290–299 (2004)Google Scholar
  7. 7.
    Ramamurthy, S., Sahasrabuddhe, L., Mukherjee, B.: Survivable WDM Mesh Networks. Journal of Lightwave Techonology 21(4), 870–882 (2003)CrossRefGoogle Scholar
  8. 8.
    Ramamurthy, S., Mugherjee, B.: Survivable WDM mesh networks- Part I: Protection. In: Proc. IEEE INFOCOM, pp. 744–751 (March 1999)Google Scholar
  9. 9.
    Ramamurthy, S., Mugherjee, B.: Survivable WDM mesh networks- Part II: Restoration. In: Proc. IEEE Integrated Circuits Conf., June 1999, pp. 2023–2030 (1999)Google Scholar
  10. 10.
    Sabella, R., Iannone, E., Listanti, M., Berdusco, M., Binetti, S.: Impact of transmission performance on path routing in all-optical transport networks. IEEE J. Select. Areas Commun. 6, 1617–1622 (1988)CrossRefGoogle Scholar
  11. 11.
    Chow, T.Y., Chudak, F., Ffrench, A.M.: Fast optical layer mesh protection using pre-cross-connected trails. IEEE/ACM Transactions on Networking 12(3), 539–548 (2004)CrossRefGoogle Scholar
  12. 12.
    Grover, W.D., Stamatelakis, D.: Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration. In: Proc. IEEE Int. Conf. Communications, pp. 537–543 (1998)Google Scholar
  13. 13.
    Grover, W.D., Doucette, J.E.: Advances inoptical network dsign with p − cycles: joint opitimization and pre-selection of candidate p − cycles. In: Proc. IEEE-LEOS Topical Meeting, WA2-49-WA2-50 (2002)Google Scholar
  14. 14.
    Grover, W., Stamatelakis, D.: Bridging the ring-mesh dichotomy with p − cycles. In: Proc. IEEE/VDE DRCN 2000, pp. 92–104 (2000)Google Scholar
  15. 15.
    Xu, D., Xiong, Y., Qiao, C.: A New PROMISE Algorithm in Networks with Shared Risk Link Group. In: IEEE Globecom, San Francisco, CA (December 2003)Google Scholar
  16. 16.
    Saradhi, C.V., Murthy, C.S.R.: Dynamic establishment of segmented protection paths in single and multi-fiber WDM mesh networks. In: OPTICOMM 2002, pp. 211–22 (2002)Google Scholar
  17. 17.
    Kodialam, M., Lakshman, T.V.: Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information. In: INFOCOM 2001, pp. 376–385 (2001)Google Scholar
  18. 18.
    Ho, P.-H., Mouftah, H.: A framework for service-guaranteed shared protection in WDM mesh networks. IEEE Comm. Mag. 40(2), 97–103 (2002)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2006

Authors and Affiliations

  • Yu Lin
    • 1
  • Haitham S. Hamza
    • 1
  • Jitender S. Deogun
    • 1
  1. 1.Department of Computer Science & EngineeringUniversity of Nebraska-LincolnLincolnUSA

Personalised recommendations