Skip to main content
Log in

Some studies on path protection in WDM networks

  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

Path protection in WDM networks is one of the popular ways to design resilient WDM networks. Although complete ILP formulations for optimal design of WDM networks have been proposed in literature, the computational cost of actually solving such formulations make this approach impractical, even for moderate sized networks. This high computational cost arises mainly due to the large number of integer variables in the formulations, which increases the complexity exponentially. As a result, most practical solutions use heuristics, which do not provide any guarantees on the performance. In this article, we propose two novel ILP formulations, which drastically reduce the number of integer variables compared to existing ILPs. This leads to much more efficient formulations. We also present a simple heuristic that may be used for larger networks for which ILP formulations become computationally intractable.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Chatterjee S. and Pawlowski S. (1999). All optical networks. Communications of the ACM 42(6): 75–83

    Article  Google Scholar 

  • Dutta R. and Rouskas G.N. (2000). A survey of virtual topology design algorithms for wavelength routed optical networks. Opt. Networks Magaz. 1(1): 73–89

    Google Scholar 

  • Leonardi E., Mellia M. and Marsan M.A. (2000). Algorithms for the logical topology design in WDM all-optical networks. Opt. Network. Magaz. 1(1): 35–46

    Google Scholar 

  • Mukherjee B. (1999). Optical Communication Networks. McGraw-Hill, New York, NY, USA

    Google Scholar 

  • Ramaswami, R., Sivarajan, K.N.: Optical Networks: A Practical Perspective. Morgan Kaufmann Publishers (2002)

  • Skorin-Kapov J. and Laburdette J.F. (1995). On minimum congestion routing in rearrangeable multi-hop lightwave networks. J. of Heuristics 1(1): 129–145

    Article  MATH  Google Scholar 

  • Stearn, T.E., Bala, K.: Multiwavelength optical networks: a layered approach. Addison Wesley Longman Inc (1999)

  • Ducatelle, F., Gambardella, L.M.: A scalable algorithm for survivable routing in IP-over-WDM networks. Proc. of First International Conference on Broadband Networks (Broadnets) ’04, (San Jose, CA, USA, Oct. 2004), pp. 54–63

  • Ducatelle, F., Gambardella, L.M.: FastSurv: a new efficient local search algorithm for survivable routing in WDM networks. Proc. of IEEE GLOBECOM ’04, vol. 3, pp. 1925–1929. Dallas, TX, USA, Nov/Dec 2004

  • Doshi B.T., Dravida S., Harshavardhana P., Hauser O. and Wang Y. (1999). Optical network design and restoration. Bell Labs Tech. J. 4(l): 58–84

    Article  Google Scholar 

  • Ellinas G., Hailemariam A.G. and Stern T.E. (2000). Protection cycles in mesh WDM networks. IEEE J. Select. Area Commun. 18(10): 1924–1937

    Article  Google Scholar 

  • Gerstel, O.: Opportunities for optical protection and restoration. Proc. of OFC’98, vol. 2, pp. 269–270. San Jose, CA, USA, Feb. 1998

  • Gerstel O. and Ramaswami R. (2000). Optical layer survivability: a services perspective. IEEE Commun. Magaz. 38(3): 104–113

    Article  Google Scholar 

  • Modiano, E., Narula, A.: Survivable routing of Logical Topologies in WDM Networks. Proc. of IEEE INFOCOM ’01, vol. 1, pp. 348–357, Anchorage, AL, USA (2001)

  • Gerstel O. and Ramaswami R. (2000). Optical layer survivability: An implementation perspective. IEEE J. Select. Areas Commun. (Special Issue on Optical Networks) 18(10): 885–899

    Google Scholar 

  • Ramamurthy, B., Mukherjee, B.: Survivable WDM Mesh Networks, Part I - Protection. Proc. of IEEE INFOCOM’99, vol. 2, pp. 744–751, New York, NY, USA (1999)

  • Ramamurthy, B., Mukheriee, B.: Survivable WDM mesh networks. Part II- restoration. Proc. of IEEE ICC’99, pp. 2023–2030, Vancouver, BC, Canada, June 1999

  • Sridharan M., Salapaka M.V. and Somani A. (2002). A practical approach to operating survivable WDM networks. IEEE J. Select. Area. Commun. 20(1): 34–46

    Article  Google Scholar 

  • Sahasrabudhe L., Ramamurthy S. and Mukherjee B. (2002). Fault management in IP-over-WDM networks: WDM protection versus IP restoration. IEEE J. Select. Area. Commun. 20(1): 21–33

    Article  Google Scholar 

  • Yurong H., Wushao W., Heritage J.P. and Mukherjee B. (2004). A generalized protection framework using a new link-state availability model for reliable optical networks. IEEE/OSA J. Lightwave Technol. 22(11): 2536–2547

    Article  Google Scholar 

  • Zang H., Ou C. and Mukherjee B. (2003). Path-protection RWA in WDM mesh networks under duct-layer constraints. IEEE/ACM Trans. Network. 11(2): 248–258

    Article  Google Scholar 

  • Mauz, C.: Unified ILP formulation of protection in mesh networks. Proc. of 7th International Conference on Telecommunication, (contel), vol. 2, pp. 737–742. Zagreb, Croatia, June 2003

  • Ramamurthy S., Sahasrabudhe L. and Mukherjee B. (2003). Survivable WDM mesh networks. IEEE/OSA J. Lightwave Technol. 21(4): 870–883

    Article  Google Scholar 

  • Tomatore, M., Maier, G., Pattavina, A.: WDM network optimisation by ILP based on source formulation. Proc. of IEEE INFOCOM ’02, vol. 3, pp. 1813–1821. New York, NY, USA, April 2002

  • Dacomo, A., De Patre, S., Maier, G., Pattavina, A., Martinelli, M.: Design of static resilient WDM mesh networks with multiple heuristic criteria. Proc. of IEEE INFOCOM ’02, vol. 3, pp. 1793–1802. New York, NY, USA, June 2002

  • Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley and Sons (1988)

  • Ahuja R.K., Magnanti T.L. and Orlin J.B. (1993). Network flows: Theory, algorithms, and applications. Prentice Hall, Englewood Cliffs, NJ, USA

    Google Scholar 

  • Hu, T.C.: Integer programming and network flows. Addison Wesley (1970)

  • Saha, S.: Heuristics for the Design of Fault Tolerant Logical Topology. M. Sc Thesis, School of Computer Science, University of Windsor, Windsor, ON, Canada, 2005

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Subir Bandyopadhyay.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aneja, Y., Jaekel, A. & Bandyopadhyay, S. Some studies on path protection in WDM networks. Photon Netw Commun 14, 165–176 (2007). https://doi.org/10.1007/s11107-007-0075-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-007-0075-0

Keywords

Navigation