SOLVING RWA PROBLEM IN ALL-OPTICAL NETWORKS BASED ON OPTIMIZED ANT COLONY ALGORITHM
Abstract
The information bandwidth growth can be achieved using optical networking technology. Optical fiber
has been used as a physical means through many network technologies. Wavelength Division Multiplexing
(WDM) has emerged as a promising technology to conquer the use of large-bandwidth in optical networks.
In WDM network, the essential problem is to serve the load traffic represented by the requests that arrive
at the network and need to be served. For serve the request, the network will determine a path paired with
a specific wavelength used to send the request's data from source to the destination node. This problem is
called the routing and wavelength assignment (RWA). In this work, Multi-Node Optimized Ant Colony
Algorithm (M-NOACA) proposed and implemented to solve the RWA problem in all-optical networks by
simulating traffic with the RWA algorithms. A performance measurements applied to study the
optimization problem of the RWA, and apply a comparison with the classic algorithms. Determining the
best collection of parameters for an ant-based algorithm to obtain the best performance remains an open
issue, in this work, a study is done to introduce a new contribution to obtain the optimal setting of Ant
Colony parameters used to solve the RWA problem.
Downloads
References
and the Plough. American Economic
Review, 101(3), 499-503.
http://dx.doi.org/10.1109/2.901164
Reinhold N.,(2016).”Essentials of Modern Optical
Fiber Communication”. 2
nd edition, Springer.
DOI 10.1007/978-3-662-49623-7
Mohamed K. and Maurice G., (2010), “Lightpath
Rerouting Strategies in WDM All-Optical
Networks Under Scheduled and Random
Traffic”, Journal of Optical Communications
and Networking, Vol. 2, Issue 10, pp. 859-871
Mustafa, Firas M., and Al-Jumailly, Tariq A., (2017).
Buffer less All-Optical WDM Networks with
Dynamic Traffic, Academic Journal of Nawroz
University (AJNU), Vol.6(1), No.(10),
Pages:13-25. DOI:
10.25007/issn.2520-789X. Retrieved from
https://journals.nawroz.edu.krd/index.php/ajnu
/index
Ali N., Halim Z., and Berk U., (2011), An integrated
survey in Optical Networks: Concepts,
Components and Problems, IJCSNS, Vol.11
No.1.
Rajneesh Randhawa, R.S. Kaler,, and Anuj Singal,
(2013),“Performance evaluation of algorithms
for wavelength assignment in optical ring
network”, Optik 124 78– 81.
Matlotia, S,and kaur B.,(2014),“Proposed
Experimental Algorithm for Wavelength
Assignment in Optical WDM Mesh Networks”,
IJIEASR, ISSN: 2319-4413 Volume 3, No. 7,
July 2014.
Ramamurthy, R., Mukherjee, B. (2002),”
Fixed-alternate routing and wavelength
conversion in wavelength-routed optical
networks”,Proc., Networking, IEEE/ACM
Transactions on (Volume:10 , Issue: 3 ),
pages 351 - 367.
Caro G. D. and Dorigo M., (1998),“AntNet:
Distributed stigmergetic control
forcommunications networks”, J. of Artificial
Intelligence Research, vol. 9,pp. 317–365.
Garlick R. and Barr R., (2002),“Dynamic Wavelength
Routing in WDMNetworks via Ant Colony
Optimization”, in Proc. of ANTS 2002, ser.
LNCS, vol. 2463, pp. 27–41.
Ngo S., Jiang X., and Horiguchi S., (2006),“An
ant-based approach for dynamic RWA in
optical WDM networks”,Photonic Netw.
Commun., vol. 11, no. 1, pp. 39–48.
Demeyer S., Leenheer M. D., Baert J., Pickavet M.,
and Demeester P., (2008), “Ant colony
optimization for the routing of jobs in optical
grid networks,”J. of Optical Netw., vol. 7, no.
2, pp. 160–172.
Ramaswami, R., & Sasaki, G. (1998).
Multiwavelength optical networks with limited
wavelength conversion. IEEE/ACM
Transactions on Networking (TON),6(6),
744-754.
Dorigo M. and St¨utzle T., (2004),“Ant Colony
Optimization.”MIT Press, Cambridge.
Christine Solnon, (2010), “Ant Colony Optimization
and Constraint Programming”, Wiley-ISTE.
Marwaha S., Tham C. K., and Srinivasan D., (2002)
“Mobile Agents Based Routing Protocol for
Mobile Ad Hoc Networks,” in Proc. Of the
GLOBECOM’02, vol. 1, New York, pp. 163–
167.
Sim K. M. and Sun W. H., (2002)“Multiple
ant-colony optimization for network routing,”
in Proc. 1st Int. Symp. Cyberworld, Tokyo,
Japan, pp. 277–281.
Lopez-Ibañez M., Paquete L. and Stützle T.,
(2004), ”On the design of ACO for the
Biobjective Quadratic Assignment Problem”.
In: Dorigo, et al. (Eds.): Proc. of the Fourth
International Workshop on Ant Colony
Optimization (ANTS 2004), Lecture Notes in
Computer Science, Springer Verlag.
Schaerer M. and Barán B., (2003) “A multiobjective
Ant Colony System for Vehicle Routing
Problems with Time Windows”Proc. Twenty first IASTED International Conference on
Applied Informatics, Insbruck, Austria, pp.
97-102.
Li JZ., Liu WX., Han Y., Xing HW., Yang AM., Pan
YH. (2018). TSP Problem Based on Artificial
Ant Colony Algorithm. In: Mizera-Pietraszko
J., Pichappan P. (eds) Lecture Notes in
Real-Time Intelligent Systems. RTIS 2016.
Advances in Intelligent Systems and
Computing, vol 613. Springer, Cham. DOI
https://doi.org/10.1007/978-3-319-60744-3_22,
https://link.springer.com/chapter/10.1007/978-
3-319-60744-3_22
Katona, G., Lénárt, B., Juhász, J., (2019) “Parallel
Ant Colony Algorithm for Shortest Path
Problem”, Periodica Polytechnica Civil
Engineering, 63(1), pp. 243-254, 2019.
https://doi.org/10.3311/PPci.12813
Li Z., Tan R., Ren B. (2020) Application of Improved
Ant Colony Algorithm in Path Planning. In:
Barolli L., Hussain F., Ikeda M. (eds)
Complex, Intelligent, and Software Intensive
Systems. CISIS 2019. Advances in Intelligent
Systems and Computing, vol 993. Springer,
Cham. DOI
https://doi.org/10.1007/978-3-030-22354-0_53,
https://link.springer.com/chapter/10.1007%2F
978-3-030-22354-0_53
Qiao D., Bai W., Wang K., Wang Y. (2020). Review
on the Improvement and Application of Ant
Colony Algorithm. Bio-inspired Computing:
Theories and Applications. BIC-TA 2019.
Communications in Computer and Information
Science, vol 1159.
DOI:10.1007/978-981-15-3425-6_1, Springer,
Singapore.
https://link.springer.com/chapter/10.1007%2F
978-981-15-3425-6_1
Zakouni, A., Luo, J. & Kharroubi, F., (2017). Genetic
algorithm and tabu search algorithm for
solving the static manycast RWA problem in
optical networks. J Comb Optim 33, 726–741
https://doi.org/10.1007/s10878-016-0002-3
It is the policy of the Journal of Duhok University to own the copyright of the technical contributions. It publishes and facilitates the appropriate re-utilize of the published materials by others. Photocopying is permitted with credit and referring to the source for individuals use.
Copyright © 2017. All Rights Reserved.
