Routing low-speed traffic requests onto high-speed lightpaths by using a multiobjective firefly algorithm

5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Nowadays, the bandwidth requirements of the majority of traffic connection requests are in the range of Mbps. However, in optical networks each physical link is able to operate in the range of Gbps causing a huge waste of bandwidth as a result. Fortunately, using access station at each node of the optical network, several low-speed traffic requests may be multiplexed onto one high-speed channel. Multiplexing or grooming these low-speed requests is known in the literature as the Traffic Grooming problem - an NP-hard problem. Therefore, in this paper we propose the use of Evolutionary Computation for solving this telecommunication problem. The selected algorithm is an approach inspired by the flash pattern and characteristics of fireflies, the Firefly Algorithm (FA), but adapted to the multiobjective domain (MO-FA). After performing several experiments and comparing the results obtained by the MO-FA with those obtained by other approaches published in the literature, we can conclude that it is a good approach for solving this problem. © Springer-Verlag Berlin Heidelberg 2013.

Cite

CITATION STYLE

APA

Rubio-Largo, Á., & Vega-Rodríguez, M. A. (2013). Routing low-speed traffic requests onto high-speed lightpaths by using a multiobjective firefly algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7835 LNCS, pp. 12–21). Springer Verlag. https://doi.org/10.1007/978-3-642-37192-9_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free