Skip to main content

Advertisement

Springer Nature Link
Log in

Multiobjective swarm intelligence for the traffic grooming problem

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

The future of optical networks is focused on Wavelength Division Multiplexing (WDM) technology. WDM allows simultaneous transmissions of traffic on many non-overlapping channels (wavelengths). Since nowadays the majority of traffic requests only require a bandwidth of Mbps, there exists a waste of bandwidth in these non-overlapping channels because they support traffic in Gbps range. For exploiting the optical network resources effectively, several low-speed traffic requests can be groomed onto a wavelength channel, which is not a simple task. In fact, it is known as the Traffic Grooming problem, and is considered an optimization problem (NP-hard problem). In this work, we suggest the use of multiobjective evolutionary computation and swarm intelligence jointly for solving the Traffic Grooming problem. We have proposed the following swarm algorithms: Artificial Bee Colony, Gravitational Search Algorithm, and Firefly Algorithm; but adapted to multiobjective field: MO-ABC, MO-GSA, and MO-FA respectively. Furthermore, we have adapted the well-known Strength Pareto Evolutionary Algorithm 2, Fast Nondominated Sorting Genetic Algorithm, and Multiobjective Selection Based On Dominated Hypervolume to the Traffic Grooming problem with the aim of evaluating the quality of our swarm proposals. Finally, we present several comparisons with other heuristics and metaheuristics published in the literature by other authors. After comparing with them, we conclude that our approaches overcome the results obtained by other approaches published by other authors.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Awwad, O., Al-Fuqaha, A., Guizani, M.: Genetic Approach for Traffic Grooming, Routing, and Wavelength Assignment in WDM Optical Networks with Sparse Grooming Resources. In: Proceedings of the IEEE International Conference on Communications (ICC’06), vol. 6, pp. 2447–2452 (2006)

  2. Beume, N., Naujoks, B., Emmerich, M.: Sms-emoa: multiobjective selection based on dominated hypervolume. Eur. J. Oper. Res. 181(3), 1653–1669 (2007)

    Article  MATH  Google Scholar 

  3. Corcoran, K., Flaxman, S., Neyer, M., Scherpelz, P., Weidert, C., Libeskind-Hadas, R.: Approximation Algorithms for Traffic Grooming in WDM Rings. In: Proceedings of the IEEE International Conference on Communications (ICC’09), pp. 2503–2508. IEEE Press (2009)

  4. De, T., Pal, A., Sengupta, I.: Traffic Grooming, routing, and wavelength assignment in an optical WDM mesh networks based on clique partitioning. Photonic Netw. Commun. 20, 101–112 (2010)

    Article  Google Scholar 

  5. Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms. John Wiley & Sons Inc, New York, NY (2001)

    MATH  Google Scholar 

  6. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182–197 (2000)

    Article  Google Scholar 

  7. Gerstel, O., Ramaswami, R., Sasaki, G.H.: Cost-effective traffic grooming in WDM rings. IEEE/ACM Trans. Netw. 8, 618–630 (2000)

    Article  Google Scholar 

  8. Hu, J., Leida, B.: Traffic Grooming, Routing, and Wavelength Assignment in Optical WDM mesh Networks. In: Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM ’04), pp. 495–501 (2004)

  9. Karaboga, D.: An idea based on honey bee swarm for numerical optimization. In: Technical report-tr06, Erciyes University, Engineering Faculty, Computer Engineering Department (2005)

  10. Konda, V.R., Chow, T.Y.: Algorithm for traffic grooming in optical networks to minimize the number of transceivers. In: Proceedings of the IEEE Workshop on High Performance Switching and Routing, pp. 218–221 (2001)

  11. Lee, S., Lee, T., Chung, M., Choo, H.: Traffic Grooming Algorithm Using Shortest EDPs Table in WDM Mesh Networks. In: Proceedings of the International Conference on Computacional Science (ICCS’05). Lecture Notes in Computer Science, vol. 3516, pp. 559–567. Springer, Berlin / Heidelberg (2005)

  12. Li, D., Sun, Z., Jia, X., Makki, S.: Traffic Grooming for Minimizing Wavelength Usage in WDM Networks. In: Proceedings of the International Conference on Computer Communications and Networks (ICCCN’02), pp. 460–465 (2002)

  13. Modiano, E., Lin, P.: Traffic grooming in WDM networks. IEEE Commun. Mag. 39(7), 124–129 (2001)

    Article  Google Scholar 

  14. Prathombutr, P., Stach, J., Park, E.K.: An algorithm for traffic grooming in WDM optical mesh networks with multiple objectives. Telecommun. Syst. 28, 369–386 (2005)

    Article  Google Scholar 

  15. Rashedi, E., Nezamabadi-pour, H., Saryazdi, S.: GSA: a gravitational search algorithm. Special section on high order fuzzy sets. Info. Sci. 179(13), 2232–2248 (2009).

  16. Sheskin, D.J.: Handbook of Parametric and Nonparametric Statistical Procedures, 5th edn. Chapman & Hall/CRC Press, New York (2011)

    MATH  Google Scholar 

  17. Srinivas, N., Deb, K.: Multiobjective optimization using nondominated sorting in genetic algorithms. Evol. Comput. 2, 221–248 (1994)

    Article  Google Scholar 

  18. Wason, A., Kaler, R.: Routing and wavelength assignment in wavelength-routed all-optical WDM networks. Optik—Int. J. Light Electron Optics 121(16), 1478–1486 (2010)

    Article  Google Scholar 

  19. Yang, X.S.: Firefly algorithms for multimodal optimization. In: Proceedings of the 5th International Conference on Stochastic Algorithms: Foundations and Applications SAGA’09, pp. 169–178. Springer-Verlag, Berlin (2009)

  20. Yao, W., Ramamurthy, B.: A link bundled auxiliary graph model for constrained dynamic traffic grooming in WDM mesh networks. IEEE J. Sel. Areas Commun. 23, 1542–1555 (2005)

    Article  Google Scholar 

  21. Yen, J.Y.: Finding the K shortest loopless paths in a network. Manag. Sci. 17(11), 712–716 (2003)

    Article  Google Scholar 

  22. Yoon, Y., Lee, T., Chung, M., Choo, H.: Traffic grooming based on shortest path in optical WDM mesh networks. In: Proceedings of the IEEE International Conference on Computacional Science (ICCS’05). Lecture Notes in Computer Science, vol. 3516, pp. 1120–1124. Springer, Berlin (2005)

  23. Zhu, H., Zang, H., Zhu, K., Mukherjee, B.: A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks. IEEE/ACM Trans. Netw. 11, 285–299 (2003)

    Article  Google Scholar 

  24. Zhu, K., Mukherjee, B.: Traffic grooming in an optical WDM mesh network. IEEE J. Sel. Areas Commun. 20(1), 122–133 (2002)

    Article  Google Scholar 

  25. Zhu, K., Mukherjee, B.: A review of traffic grooming in WDM optical networks: architectures and challenges. Optical Netw. Mag. 4(2), 55–64 (2003)

    Google Scholar 

  26. Zhu, K., Zang, H., Mukherjee, B.: Design of WDM Mesh Networks with Sparse Grooming Capability. In: Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM’02), vol. 3, pp. 2696–2700 (2002)

  27. Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolutionary algorithms: empirical results. Evol. Comput. 8, 173–195 (2000)

    Article  Google Scholar 

  28. Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength Pareto evolutionary algorithm. In: Proceedings of Evolutionary Methods for Design, Optimization, and Control with Applications to Industrial Problems (EUROGEN’02), pp. 95–100 (2002)

  29. Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. Evol. Comput. 3(4), 257–271 (1999)

    Article  Google Scholar 

Download references

Acknowledgments

This work was partially funded by the Spanish Ministry of Economy and Competitiveness and the ERDF (European Regional Development Fund), under the contract TIN2012-30685 (BIO project). A. Rubio-Largo and D. L. González-Álvarez are supported by the postdoc research Grant ACCION-III-13 and ACCION-III-15 from the University of Extremadura.

Author information

Authors and Affiliations

  1. Department of Computer and Communications Technologies, University of Extremadura, Escuela Politécnica, 10003, Cáceres, Spain

    Álvaro Rubio-Largo, Miguel A. Vega-Rodríguez & David L. González-Álvarez

Authors
  1. Álvaro Rubio-Largo
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Miguel A. Vega-Rodríguez
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. David L. González-Álvarez
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Álvaro Rubio-Largo.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rubio-Largo, Á., Vega-Rodríguez, M.A. & González-Álvarez, D.L. Multiobjective swarm intelligence for the traffic grooming problem. Comput Optim Appl 60, 479–511 (2015). https://doi.org/10.1007/s10589-014-9682-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-014-9682-8

Keywords