## Ensuring Resilience in Optical WDM Networks With Nature-Inspired Heuristics

Journal of Optical Communications and Networking, Vol. 2, Issue 8, pp. 642-652 (2010)

http://dx.doi.org/10.1364/JOCN.2.000642

Acrobat PDF (150 KB)

### Abstract

One of the most important issues in optical network design is ensuring its resilience. In this paper, we propose using nature-inspired heuristics to find a resilient mapping of a given virtual topology with minimum resource usage. Evolutionary algorithms and ant colony optimization algorithms are applied to the problem after a set of parameter tuning tests. To assess the performance of the proposed algorithms, we compare the experimental results with those obtained through integer linear programming. The results show that both of our algorithms can solve the problem even for large-scale network topologies for which a feasible solution cannot be found using integer linear programming. Moreover, the CPU time and the memory used by the nature-inspired heuristics is much lower. The solution quality and the CPU time usage results prove that both of our nature-inspired heuristics can easily be applied to real-world applications.

© 2010 Optical Society of America

**OCIS Codes**

(060.4251) Fiber optics and optical communications : Networks, assignment and routing algorithms

(060.4257) Fiber optics and optical communications : Networks, network survivability

(060.4265) Fiber optics and optical communications : Networks, wavelength routing

**ToC Category:**

Research Papers

**History**

Original Manuscript: March 15, 2010

Revised Manuscript: June 22, 2010

Manuscript Accepted: June 26, 2010

Published: July 30, 2010

**Citation**

Fatma Corut Ergin, Elif Kaldırım, Ayşegül Yayımlı, and A. Şima Uyar, "Ensuring Resilience in Optical WDM Networks With Nature-Inspired Heuristics," J. Opt. Commun. Netw. **2**, 642-652 (2010)

http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jocn-2-8-642

Sort: Year | Journal | Reset

### References

- B. Mukherjee, Optical WDM Networks. New York: Springer, 2006.
- E. Modiano and A. Narula-Tam, “Survivable lightpath routing: a new approach to the design of WDM-based networks,” IEEE J. Sel. Areas Commun. , vol. 20, no. 4, pp. 800–809, 2002. [CrossRef]
- J. Armitage, O. Crochat, and J. Y. Le Boudec, “Design of a survivable WDM photonic network,” in Proc. IEEE INFOCOM, 1997, pp. 244–252.
- A. Nucci, B. Sanso, T. Crainic, E. Leonardi, and M. A. Marsan, “Design of fault-tolerant logical topologies in wavelength-routed optical IP networks,” in Proc. of IEEE Globecom, 2001, pp. 2098–2103.
- F. Ducatelle and L. M. Gambardella, “A scalable algorithm for survivable routing in IP-over-WDM networks,” in Proc. of Int. Conf. on Broadband Networks, 2004, pp. 54–63.
- M. Kurant and P. Thiran, “Survivable mapping algorithm by ring trimming (SMART) for large IP-over-WDM networks,” in Proc. of Int. Conf. on Broadband Networks, 2004, pp. 44–53.
- N. Banerjee and S. Sharan, “An evolutionary algorithm for solving the single objective static routing and wavelength assignment problem in WDM networks,” in Proc. of ICISIP, 2004, pp. 13–18.
- M. Saha and I. Sengupta, “A genetic algorithm based approach for static virtual topology design in optical networks,” in Proc. of INDICON, 2005, pp. 392–395.
- F. C. Ergin, A. Yayımlı, and Ş. Uyar, “An evolutionary algorithm for survivable virtual topology mapping in optical WDM networks,” in EvoWorkshops09, LNCS 5484, 2009, pp. 31–40.
- G. N. Varela and M. C. Sinclair, “Ant colony optimisation for virtual-wavelength-path routing and wavelength allocation,” in Congr. on Evolutionary Computation, 1999, vol. 3, pp. 1809–1816.
- R. M. Garlick and R. S. Barr, “Dynamic wavelength routing in WDM networks via ant colony optimization,” in 3rd Int. Workshop on Ant Algorithms, LNCS 2463, 2002, vol. 3, pp. 250–255.
- S. H. Ngo, X. Jiang, and S. Horiguchi, “An ant-based approach for dynamic RWA in optical WDM networks,” Photonic Network Commun. , vol. 11, pp. 39–48, 2006. [CrossRef]
- S. H. Ngo, X. Jiang, V. Le, and S. Horiguchi, “Ant-based survivable routing in dynamic WDM networks with shared backup paths,” J. Supercomput. , vol. 36, no. 3, pp. 297–307, 2006. [CrossRef]
- A. Hassan, C. Phillips, and J. Pitts, “Dynamic routing and wavelength assignment using hybrid particle swarm optimization,” in EPSRC PGNet, 2007.
- E. Kaldırım, F. C. Ergin, Ş. Uyar, and A. Yayımlı, “Ant colony optimization for survivable virtual topology mapping in optical WDM networks,” in Proc. of ISCIS, 2009, pp. 334–339.
- A. Todimala and B. Ramamurthy, “A scalable approach for survivable virtual topology routing in optical WDM networks,” IEEE J. Sel. Areas Commun. , vol. 25, no. 6, pp. 63–69, 2007. [CrossRef]
- H. H. Hoos and T. Stutzle, Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, 2005.
- A. E. Eiben and J. E. Smith, Introduction to Evolutionary Computing. Springer Verlag, 2003.
- M. Dorigo and T. Stutzle, Ant Colony Optimization. Cambridge, MA: Massachusetts Institute of Technology, 2004.
- M. Dorigo, V. Maniezzo, and A. Colorni, “Ant system: optimization by a colony of cooperating agents,” IEEE Trans. Syst., Man, Cybern., Part B: Cybern. , vol. 26, pp. 29–41, 1996. [CrossRef]
- M. Dorigo and T. Stutzle, “The ant colony optimization metaheuristics: algorithms, applications, and advances,” in Handbook of Metaheuristics (International Series in Operations Research and Management Science 57), 2002, pp. 251–285.
- T. Stutzle, Ant Colony Optimization Source Code, 2004. Available: http://www.aco-metaheuristic.org/aco-code.
- ILOG CPLEX 6.5 User’s Manual, 2000.

## Cited By |
Alert me when this paper is cited |

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

OSA is a member of CrossRef.