|1/2016 - 1|
Wavelength Converters Placement in Optical Networks Using Bee Colony OptimizationMARKOVIC, G. Z.
|Click to see author's profile on SCOPUS, IEEE Xplore, Web of Science|
|Download PDF (1,207 KB) | Citation | Downloads: 809 | Views: 1,068|
artificial intelligence, computational complexity, optical fiber networks, wavelength converters, wavelength division multiplexing
wavelength(26), networks(22), optical(19), placement(14), converter(11), communications(9), converters(7), algorithm(7), optimal(6), optimization(5)
Blue keywords are present in both the references section and the paper title.
About this article
Date of Publication: 2016-02-28
Volume 16, Issue 1, Year 2016, On page(s): 3 - 10
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2016.01001
Web of Science Accession Number: 000376995400001
SCOPUS ID: 84960106375
Wavelength converters placement (WCP) in all-optical WDM networks belongs to the class of hard combinatorial optimization problems. So far, this problem has been solved by various heuristic strategies or by application of metaheuristic approaches such as genetic algorithms (GA), particle swarm optimization (PSO), differential evolution (DE), etc. In this paper, we introduce the application of Bee Colony Optimization (BCO) metaheuristic to solve the WCP problem in all-optical WDM networks. Numerous studies prove that BCO is a fast, robust and computationally efficient tool in tackling complex optimization problems. The objective of the proposed BCO-WCP algorithm is to find the best placement of limited number of wavelength converters in given optical network such that the overall network blocking probability is minimized. To evaluate the performances of the BCO-WCP algorithm, numerous simulation experiments have been performed over some realistic optical network examples. The blocking probability performance and computational complexity are compared with optimal solution obtained by exhaustive search (ES) approach as well as with DE and PSO metaheuristics. It will be shown that the BCO-WCP algorithm is not only be able to produce high quality (optimal) solution, but significantly outperforms the computational efficiency of other considered approaches.
Web of Science® Times Cited: 2 [View]
View record in Web of Science® [View]
View Related Records® [View]
SCOPUS® Times Cited: 2
View record in SCOPUS® [Free preview]
There are no citing papers in the CrossRef Cited-by Linking system.
Disclaimer: All information displayed above was retrieved by using remote connections to respective databases. For the best user experience, we update all data by using background processes, and use caches in order to reduce the load on the servers we retrieve the information from. As we have no control on the availability of the database servers and sometimes the Internet connectivity may be affected, we do not guarantee the information is correct or complete. For the most accurate data, please always consult the database sites directly. Some external links require authentication or an institutional subscription.
Web of Science® is a registered trademark of Thomson Reuters, Scopus® is a registered trademark of Elsevier B.V., other product names, company names, brand names, trademarks and logos are the property of their respective owners.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.