OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editors: O. Gerstel and P. Iannone
  • Vol. 6, Iss. 6 — Jun. 1, 2014
  • pp: 578–589

Distributed Grooming, Routing, and Wavelength Assignment for Dynamic Optical Networks Using Ant Colony Optimization

X. Wang, M. Brandt-Pearce, and S. Subramaniam  »View Author Affiliations


Journal of Optical Communications and Networking, Vol. 6, Issue 6, pp. 578-589 (2014)
http://dx.doi.org/10.1364/JOCN.6.000578


View Full Text Article

Enhanced HTML    Acrobat PDF (537 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

The physical resource assignment problem in dynamic optical networks, often referred to as the routing and wavelength assignment problem, is very important for the development of optical transport networks. Research has been done to optimize this operation so that the overall connection blocking can be minimized. Traffic grooming adds another dimension to this problem by introducing opportunities for multiplexing low-bit-rate traffic into a high-bit-rate stream. The ant colony optimization (ACO) algorithm is a metaheuristic method that is inspired by the foraging behavior of ants and has been widely implemented in solving discrete optimization problems. This paper proposes an ACO to solve the grooming, routing, and wavelength assignment problem. Unlike previous work, our work includes considerations of mixed line rate, physical impairments, and traffic grooming functionality. Comprehensive simulation tests show how variations on the ACO algorithms’ implementation affect performance. A comparison is made between this distributed algorithm and a centralized algorithm that we propose, a grooming adaptive shortest path algorithm (GASP). Although GASP shows better efficiency in terms of blocking probability, ACO shows great robustness and adaptivity to varying network and traffic conditions.

© 2014 Optical Society of America

OCIS Codes
(060.1155) Fiber optics and optical communications : All-optical networks
(060.4251) Fiber optics and optical communications : Networks, assignment and routing algorithms

ToC Category:
Research Papers

History
Original Manuscript: January 8, 2014
Revised Manuscript: April 25, 2014
Manuscript Accepted: April 26, 2014
Published: May 30, 2014

Citation
X. Wang, M. Brandt-Pearce, and S. Subramaniam, "Distributed Grooming, Routing, and Wavelength Assignment for Dynamic Optical Networks Using Ant Colony Optimization," J. Opt. Commun. Netw. 6, 578-589 (2014)
http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jocn-6-6-578


Sort:  Author  |  Year  |  Journal  |  Reset  

References

  1. H. Zhu, H. Zang, K. Zhu, and B. Mukherjee, “A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks,” IEEE/ACM Trans. Netw., vol.  11, no. 2, pp. 285–299, 2003. [CrossRef]
  2. O. Awwad, A. Al-Fuqaha, and M. Guizani, “Genetic approach for traffic grooming, routing, and wavelength assignment in WDM optical networks with sparse grooming resources,” in IEEE Int. Conf. on Communications, vol. 6, 2006, pp. 2447–2452.
  3. B. Chen, G. Rouskas, and R. Dutta, “On hierarchical traffic grooming in WDM networks,” IEEE/ACM Trans. Netw., vol.  16, no. 5, pp. 1226–1238, 2008. [CrossRef]
  4. S. Balasubramanian and A. Somani, “On path-level traffic grooming strategies in WDM metro optical networks,” IEEE Commun. Mag., vol.  46, no. 11, pp. 91–97, 2008. [CrossRef]
  5. A. Colorni, M. Dorigo, and V. Maniezzo, “Distributed optimization by ant colonies,” in Proc. of the First European Conf. on Artificial Life, vol. 142, 1991, pp. 134–142.
  6. G. Di Caro and M. Dorigo, “Mobile agents for adaptive routing,” in Proc. of the Thirty-First Hawaii Int. Conf. on System Sciences, vol. 7, 1998, pp. 74–83.
  7. J. Pedro, J. Pires, and J. Carvalho, “Distributed routing path optimization for OBS networks based on ant colony optimization,” in IEEE Global Telecommunications Conf., 2009, pp. 1–7.
  8. R. M. Garlick and R. S. Barr, “Dynamic wavelength routing in WDM networks via ant colony optimization,” in Ant Algorithms: Third Int. Workshop, vol. 2463. Springer-Verlag, 2002, pp. 250–255.
  9. S.-H. Ngo, X. Jiang, and S. Horiguchi, “Adaptive routing and wavelength assignment using ant-based algorithm,” in Proc. 12th IEEE Int. Conf. on Networks, vol. 2, 2004, pp. 482–486.
  10. K. Bhaskaran, J. Triay, and V. Vokkarane, “Dynamic anycast routing and wavelength assignment in WDM networks using ant colony optimization (ACO),” in IEEE Int. Conf. on Communications, 2011, pp. 1–6.
  11. Y.-M. Kim, E.-J. Lee, and H.-S. Park, “Ant colony optimization based self-organizing QoS framework in IP networks,” IEEE Commun. Lett., vol.  14, no. 11, pp. 1074–1076, 2010. [CrossRef]
  12. J. Mapisse, P. Cardoso, and J. Monteiro, “Ant colony optimization routing mechanisms with bandwidth sensing,” in EUROCON—Int. Conf. on Computer as a Tool (EUROCON), 2011, pp. 1–4.
  13. Y. Wang, J. Zhang, Y. Zhao, J. Wang, and W. Gu, “ACO-based routing and spectrum allocation in flexible bandwidth networks,” Photon. Netw. Commun., vol.  25, no. 3, pp. 135–143, 2013. [CrossRef]
  14. G. Pavani and H. Waldman, “Traffic engineering and restoration in optical packet switching networks by means of ant colony optimization,” in 3rd Int. Conf. on Broadband Communications, Networks and Systems, 2006, pp. 1–10.
  15. X. Li, Y. Aneja, and F. Baki, “Ant colony optimization metaheuristic for the traffic grooming in WDM networks,” in Proc. of the 2nd Int. Conf. on Combinatorial Optimization and Applications, 2008, pp. 235–245.
  16. X. Wang, M. Brandt-Pearce, and S. Subramaniam, “Dynamic grooming, routing, and wavelength assignment for real-time optical networks using ant colony optimization,” presented at IEEE GLOBECOM, Atlanta, GA, Dec.2013.
  17. B. Ramamurthy, D. Datta, H. Feng, J. Heritage, and B. Mukherjee, “Impact of transmission impairments on the teletraffic performance of wavelength-routed optical networks,” J. Lightwave Technol., vol.  17, no. 10, pp. 1713–1723, 1999. [CrossRef]
  18. R. Essiambre, G. Kramer, P. Winzer, G. Foschini, and B. Goebel, “Capacity limits of optical fiber networks,” J. Lightwave Technol., vol.  28, no. 4, pp. 662–701, 2010. [CrossRef]
  19. M. Batayneh, D. Schupke, M. Hoffmann, A. Kirstaedter, and B. Mukherjee, “On routing and transmission-range determination of multi-bit-rate signals over mixed-line-rate WDM optical networks for carrier Ethernet,” IEEE/ACM Trans. Netw., vol.  19, no. 5, pp. 1304–1316, 2011. [CrossRef]
  20. A. Nag, M. Tornatore, and B. Mukherjee, “Optical network design with mixed line rates and multiple modulation formats,” J. Lightwave Technol., vol.  28, no. 4, pp. 466–475, 2010. [CrossRef]
  21. J. Triay and C. Cervello-Pastor, “An ant-based algorithm for distributed routing and wavelength assignment in dynamic optical networks,” IEEE J. Sel. Areas Commun., vol.  28, no. 4, pp. 542–552, 2010. [CrossRef]
  22. E. Dijkstra, “A note on two problems in connexion with graphs,” Numer. Math., vol.  1, no. 1, pp. 269–271, 1959. [CrossRef]
  23. A. Mokhtar and M. Azizoglu, “Adaptive wavelength routing in all-optical networks,” IEEE/ACM Trans. Netw, vol.  6, no. 2, pp. 197–206, 1998. [CrossRef]
  24. X. Yang and B. Ramamurthy, “Sparse regeneration in translucent wavelength-routed optical networks: architecture, network design and wavelength routing,” Photon. Netw. Commun., vol.  10, no. 1, pp. 39–53, 2005. [CrossRef]

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.

« Previous Article

OSA is a member of CrossRef.

CrossCheck Deposited