Click to open the HelpDesk interface
AECE - Front page banner

Menu:


FACTS & FIGURES

JCR Impact Factor: 1.221
JCR 5-Year IF: 0.961
SCOPUS CiteScore: 2.5
Issues per year: 4
Current issue: Nov 2021
Next issue: Feb 2022
Avg review time: 90 days


PUBLISHER

Stefan cel Mare
University of Suceava
Faculty of Electrical Engineering and
Computer Science
13, Universitatii Street
Suceava - 720229
ROMANIA

Print ISSN: 1582-7445
Online ISSN: 1844-7600
WorldCat: 643243560
doi: 10.4316/AECE


TRAFFIC STATS

1,779,427 unique visits
598,461 downloads
Since November 1, 2009



Robots online now
SemanticScholar
bingbot


SJR SCImago RANK

SCImago Journal & Country Rank




TEXT LINKS

Anycast DNS Hosting
MOST RECENT ISSUES

 Volume 21 (2021)
 
     »   Issue 4 / 2021
 
     »   Issue 3 / 2021
 
     »   Issue 2 / 2021
 
     »   Issue 1 / 2021
 
 
 Volume 20 (2020)
 
     »   Issue 4 / 2020
 
     »   Issue 3 / 2020
 
     »   Issue 2 / 2020
 
     »   Issue 1 / 2020
 
 
 Volume 19 (2019)
 
     »   Issue 4 / 2019
 
     »   Issue 3 / 2019
 
     »   Issue 2 / 2019
 
     »   Issue 1 / 2019
 
 
 Volume 18 (2018)
 
     »   Issue 4 / 2018
 
     »   Issue 3 / 2018
 
     »   Issue 2 / 2018
 
     »   Issue 1 / 2018
 
 
 Volume 17 (2017)
 
     »   Issue 4 / 2017
 
     »   Issue 3 / 2017
 
     »   Issue 2 / 2017
 
     »   Issue 1 / 2017
 
 
  View all issues  




SAMPLE ARTICLES

An Efficient Deep Learning Algorithm for Fire and Smoke Detection with Limited Data, NAMOZOV, A., CHO, Y. I.
Issue 4/2018

AbstractPlus

A Novel Approach for Bi-Level Segmentation of Tuberculosis Bacilli Based on Meta-Heuristic Algorithms, AYAS, S., DOGAN, H., GEDIKLI, E., EKINCI, M.
Issue 1/2018

AbstractPlus

Electrical Signature Analysis for Condition Monitoring of Permanent Magnet Synchronous Machine, SALOMON, C. P., FERREIRA, C., LAMBERT-TORRES, G., TEIXEIRA, C. E., BORGES DA SILVA, L. E., SANTANA, W. C., BONALDI, E. L., DE OLIVEIRA, L. E. L.
Issue 4/2018

AbstractPlus

Design, FPGA-based Implementation and Performance of a Pseudo Random Number Generator of Chaotic Sequences, DRIDI, F., EL ASSAD, S., EL HADJ YOUSSEF, W., MACHHOUT, M., SAMHAT, A. E.
Issue 2/2021

AbstractPlus

Correction to ''File System Performance Comparison in Full Hardware Virtualization with ESXi, KVM, Hyper-V and Xen Hypervisors'', DJORDJEVIC, B., TIMCENKO, V., KRALJEVIC, N., MACEK, N.
Issue 3/2021

AbstractPlus

A New Approach for Estimating Insulation Condition of Field Transformers Using FRA, MOHD YOUSOF, M. F., AL-AMERI, S., AHMAD, H., ILLIAS, H. A., ARSHAD, S. N. M.
Issue 1/2020

AbstractPlus




LATEST NEWS

2021-Jun-30
Clarivate Analytics published the InCites Journal Citations Report for 2020. The InCites JCR Impact Factor of Advances in Electrical and Computer Engineering is 1.221 (1.053 without Journal self-cites), and the InCites JCR 5-Year Impact Factor is 0.961.

2021-Jun-06
SCOPUS published the CiteScore for 2020, computed by using an improved methodology, counting the citations received in 2017-2020 and dividing the sum by the number of papers published in the same time frame. The CiteScore of Advances in Electrical and Computer Engineering in 2020 is 2.5, better than all our previous results.

2021-Apr-15
Release of the v3 version of AECE Journal website. We moved to a new server and implemented the latest cryptographic protocols to assure better compatibility with the most recent browsers. Our website accepts now only TLS 1.2 and TLS 1.3 secure connections.

2020-Jun-29
Clarivate Analytics published the InCites Journal Citations Report for 2019. The InCites JCR Impact Factor of Advances in Electrical and Computer Engineering is 1.102 (1.023 without Journal self-cites), and the InCites JCR 5-Year Impact Factor is 0.734.

2020-Jun-11
Starting on the 15th of June 2020 we wiil introduce a new policy for reviewers. Reviewers who provide timely and substantial comments will receive a discount voucher entitling them to an APC reduction. Vouchers (worth of 25 EUR or 50 EUR, depending on the review quality) will be assigned to reviewers after the final decision of the reviewed paper is given. Vouchers issued to specific individuals are not transferable.

Read More »


    
 

  1/2016 - 1
View TOC | « Previous Article | Next Article »

 HIGH-IMPACT PAPER 

Wavelength Converters Placement in Optical Networks Using Bee Colony Optimization

MARKOVIC, G. Z. See more information about MARKOVIC, G. Z. on SCOPUS See more information about MARKOVIC, G. Z. on IEEExplore See more information about MARKOVIC, G. Z. on Web of Science
 
View the paper record and citations in View the paper record and citations in Google Scholar
Click to see author's profile in See more information about the author on SCOPUS SCOPUS, See more information about the author on IEEE Xplore IEEE Xplore, See more information about the author on Web of Science Web of Science

Download PDF pdficon (1,207 KB) | Citation | Downloads: 1,177 | Views: 2,929

Author keywords
artificial intelligence, computational complexity, optical fiber networks, wavelength converters, wavelength division multiplexing

References keywords
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

Abstract
Quick view
Full text preview
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.


References | Cited By  «-- Click to see who has cited this paper

[1] Luiz H. Bonani, Iguatemi E. Fonseca, "Estimating the blocking probability in wavelength-routed optical networks," Optical Switching and Networking, vol. 10, no. 4, pp. 430-438, 2013.
[CrossRef] [Web of Science Times Cited 8] [SCOPUS Times Cited 10]


[2] A. Sridharan, K.N. Sivarajan, "Blocking in all-optical networks," IEEE/ACM Trans. Netw." vol.12, no. 2, pp. 384-397. 2004.
[CrossRef] [Web of Science Times Cited 66] [SCOPUS Times Cited 99]


[3] A. Soares, J. Maranhao, W. Giozza, P. Cunha, "Cost benefit study of sparse-partial wavelength conversion architectures," in Proc. Int. Conf. on Systems and Networks Comm. 2006, ICSNC'06, vol. 12, 2006.
[CrossRef] [SCOPUS Times Cited 3]


[4] S. Thiagarajan, A. K. Somani, "Optimal wavelength converter placement in arbitrary topology wavelength-routed networks," Computer Communications, vol.26, pp. 975-985, 2003.
[CrossRef] [Web of Science Times Cited 8] [SCOPUS Times Cited 7]


[5] H.-Y. Jeong, S.-W. Seo, "A binary (0-1) linear program formulation for the placement of limited-range wavelength converters in wavelength-routed WDM networks," Journal on Lightwave Technology, vol. 23, no. 10, pp. 3076-3091, 2005.
[CrossRef] [Web of Science Times Cited 9] [SCOPUS Times Cited 16]


[6] P. N Trian, U. Killat, "An Exact ILP Formulation for Optimal Wavelength Converter Usage and Placement in WDM Networks," in Proc. of IEEE GLOBECOM 2008, pp. 1-6, 2008.
[CrossRef]x [Web of Science Times Cited 9] [SCOPUS Times Cited 16]


[7] C. Fang, C. P. Low, "Optimal wavelength converter placement with guaranteed wavelength usage," in: Networking 2006, Lecture Notes in Computer Science, vol. 3976, pp. 1050-1061. 2006.
[CrossRef] [SCOPUS Times Cited 6]


[8] L. Li, A.K. Somani, "Efficient algorithms for wavelength converter placement, "Optical Networking Magazine, vol.3, pp. 54-62, 2002.
[CrossRef]


[9] K. R. Venugopal, M. ShivaKumar, P. Sreenivasa, "A heuristic for placement of limited range wavelength converters in all-optical networks,"Computer Networks, vol. 35, no. 2-3, pp. 143-163, 2001.
[CrossRef] [Web of Science Times Cited 10] [SCOPUS Times Cited 10]


[10] D. Zhemin, M. Hamdi, "On the management of wavelength converter allocation in WDM all-optical networks,"in Proc. of the IEEE GLOBECOM'03, vol. 5, pp. 2595-2600, 2003.
[CrossRef]


[11] A. S. Arora, S. Subramaniam, "Wavelength conversion placement in WDM mesh optical networks," Photonic Network Communications, vol. 4, no. 2, pp. 167-177, 2002.
[CrossRef] [Web of Science Times Cited 14] [SCOPUS Times Cited 19]


[12] X. Chu, B. Li, I. Chlamtac, "Wavelength Converter Placement Under Different RWA Algorithms in Wavelength-Routed All-Optical Networks," IEEE Transactions on Communications, vol. 51, no.4, pp. 607-617, 2003.
[CrossRef] [Web of Science Times Cited 67] [SCOPUS Times Cited 99]


[13] J. H. Siregar, H. Takagi, Y. Zhang, "Optimal Wavelength Converter Placement in Optical Networks by Genetic Algorithm," IEICE Transactions on Communications, vol. E85-B, no. 6, pp. 1075-1082, 2002. [Online] Available: Temporary on-line reference link removed - see the PDF document

[14] W. Li, J. He, Y. Li, D. Liu, D. Huang, "An efficient algorithm for optimal allocation of wavelength converters in wavelength routing optical networks," Chinese Optics Letters, vol. 2, no.8, pp. 449-452, 2004. [Online] Available: Temporary on-line reference link removed - see the PDF document

[15] C. Vijayanand, M. S. Kumar, K. R. Venugopal, P. S. Kumar, "Converter placement in all-optical networks using genetic algorithms," Computer Communications, vol. 23, no. 13, pp. 1223-1234, 2000.
[CrossRef] [Web of Science Times Cited 21] [SCOPUS Times Cited 25]


[16] K. Roy, M. K. Naskar, "Genetic evolutionary algorithm for optimal allocation of wavelength converters in WDM optical networks," Photonic Network Communications, vol. 16, no.1, pp. 31-42, 2008.
[CrossRef] [Web of Science Times Cited 12] [SCOPUS Times Cited 15]


[17] N. Sengezer, E. Karasan, "Tabu search algorithm for sparse placement of wavelength converters in optical networks," Lecture Notes in Computer Science - Comp. and Inform. Science ISCIS'04, vol. 3280, pp. 247-256, 2004.
[CrossRef] [SCOPUS Times Cited 5]


[18] Y. C. Foo, Sf Chien, Andy L. Y. Low, C. F. Teo, "New strategy for optimizing wavelength converter placement," Optics Express, vol. 13, no.2, pp. 545-551, 2005. [Online] Available: Temporary on-line reference link removed - see the PDF document

[19] C. Teo, Y.C. Foo, S. Chien, A. Low, "A. You and G. Castanon, Wavelength converters placement in all optical networks using particle swarm optimization," Photonic Network Communications, vol. 10, no. 1, pp. 23-37, 2005.
[CrossRef] [Web of Science Times Cited 4] [SCOPUS Times Cited 5]


[20] F. Lezama, G. Castanon, A. M. Sarmiento, "Differential evolution optimization applied to the wavelength converters placement problem in all optical networks," Computer Networks, vol. 56, no.9, pp. 2262-2275, 2012.
[CrossRef] [Web of Science Times Cited 7] [SCOPUS Times Cited 9]


[21] J. Shen, J. Chien, "An Improved ACO Based RWA Algorithm and Its Application in Wavelength Converter Allocation Issue of the Intelligent Optical Networks," Journal of Computational Information Systems, vol.10, no.8, pp. 3341-3349, 2014.

[22] Diego P. Pinto-Roa, Carlos A. Brizuela, Benjamín Barán, "Multi-objective routing and wavelength converter allocation under uncertain traffic," Optical Switching and Networking, vol. 16, pp. 1-20, 2015.
[CrossRef] [Web of Science Times Cited 3] [SCOPUS Times Cited 6]


[23] T. Davidovic, D. Teodorovic, M. Selmic, Bee Colony Optimization Part I: The Algorithm Overview, Yugoslav Journal of Operations Research, vol. 25, pp. 33-56, 2015.
[CrossRef] [SCOPUS Times Cited 40]


[24] D. Teodorovic, M. Selmic, T. Davidovic, "Bee Colony Optimization Part II: The Application Survey," Yugoslav Journal of Operations Research, vol.25, no.2, pp.185-219, 2015.
[CrossRef] [SCOPUS Times Cited 18]


[25] G. Markovic, D. Teodorovic, V. Acimovic-Raspopovic, "Routing and Wavelength Assignment in All-Optical Networks Based on the Bee Colony Optimization," AI Communications, vol.20, no.4. pp. 273-285, 2007.

[26] G. Markovic, V. Acimovic-Raspopovic, V. Radojicic, "A heuristic algorithm for lightpath scheduling in next-generation WDM optical networks," Photonic Network Communications, vol. 23, no.3, pp. 272-284, 2012.
[CrossRef] [Web of Science Times Cited 11] [SCOPUS Times Cited 12]




References Weight

Web of Science® Citations for all references: 249 TCR
SCOPUS® Citations for all references: 420 TCR

Web of Science® Average Citations per reference: 9 ACR
SCOPUS® Average Citations per reference: 16 ACR

TCR = Total Citations for References / ACR = Average Citations per Reference

We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more

Citations for references updated on 2021-11-28 16:41 in 136 seconds.




Note1: Web of Science® is a registered trademark of Clarivate Analytics.
Note2: SCOPUS® is a registered trademark of Elsevier B.V.
Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site.

Copyright ©2001-2021
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.




Website loading speed and performance optimization powered by: