Meta Heuristic for WDM Optical Networks Without Wavelength Conversion
Keywords:
Heuristic Algorithms, National Science Foundation NETwork, Optical Networks, Snake One, Wavelength Division Multiplexing,Abstract
This paper presents the results of the algorithm Snake-Two, evolving from algorithm Snake-One, which showed important results in the blocking probability of transport networks under dynamic traffic, but poor results in the network utilization indicator. The strategy applied is called Saturated Link and it moves traffic to congestion zones, creating concentrated network utilization, thus improving blocking probability. This is achieved by monitoring congested links using the full saturation capacity of each link. This way, the ones least used are downloaded, which enables keeping the congestion zoned and saturated, significantly lowering the blocking probability with low network utilization cost for dynamic traffic scenarios.References
A. Rodriguez et al., “Comparing Genetic Algorithms and Simulated Annealing for dynamic traffic routing”. LNEE Springer, vol. 315, 2014, pp. 3-14.
H. Tantian et al., “A Genetic Algorithm Using Priority-Based Encoding for Routing and Spectrum Assignment in Elastic Optical Network”, in Intelligent Computation Technology and Automation (ICICTA), 2014 7th International Conference on, 2014, pp.5-11.
A. Rubio-Largo et al., “Multiobjective Metaheuristics for Traffic Grooming in Optical Networks”, Evolutionary Computation, IEEE Transactions on, vol. 17, no 4, 2013, pp. 457-473.
A. Kumar et al., “Optimization of wavelength converter in WDM networks using genetic algorithm. In: Electronics”, in Computing and Communication Technologies (CONECCT), 2013 IEEE International Conference on; Jan. 2013, pp.1-3.
K. Assis et al., “Hybrid Algorithms for Routing and Assignment Wavelengths in Optical Networks”, in Latin America Transactions, IEEE, vol. 8, no 3, 2010, pp. 214-220.
A. Rubio-Largo et al., “Using a Multiobjective OpenMP+MPI DE for the Static RWA Problem”, Computer Aided Systems Theory LNCS Springer-Verlag, vol. 6927, 2012, pp. 224-231.
Y. Pan et al., “Cost-optimized joint resource allocation in grids/clouds with multilayer optical network architecture”, Optical Communications and Networking, IEEE/OSA Journal of, vol. 6, no 10, 2014, pp. 911-924.
H. Zang et al., “Dynamic lightpath establishment in wavelength routed WDM networks”, Communications Magazine IEEE, vol. 39, no 9, 2001, pp. 100-108.
R. Barpanda et al., “Solving large problem instances of the RWA problem using genetic algorithms”, in Industrial and Information Systems (ICIIS), Mangalore, Karnataka, India, 2010, pp. 41-46.
W. Zhang-liang et al., “An ant colony algorithm with tabu search and its application”, in Intelligent Computation Technology and Automation (ICICTA), Shenzhen, Guangdong, China, 2011, pp. 412- 416.
A. Rubio-Largo et al., “A Multiobjective Gravitational Search Algorithm Applied to the Static Routing and Wavelength Assignment Problem”, in Applications of Evolutionary Computation; Lecture Notes in Computer Science Springer-Verlag, vol. 6625, 2011, pp. 41- 50.
K. Bhaskaran et al., “Dynamic Anycast Routing and Wavelength Assignment in WDM Networks Using Ant Colony Optimization (ACO)”, in Communications (ICC), 2011 IEEE International Conference on, vol. 1, no 1, 2011, pp. 1-6.
S. Sakamoto et al., “Performance analysis of WMNs using simulated annealing algorithm for different temperature values”, in Complex, Intelligent, and Software Intensive Systems (CISIS), Taichung, Taiwan, 2013, pp. 164-168.
L. Khelifi et al., “A hybrid a|pproach based on multi-objective simulated annealing and tabu search to solve the dynamic dial a ride problema”, in Advanced Logistics and Transport (ICALT), Sousse, Tunez, 2013, pp. 227-232.
A. Rodriguez et al., “Routing wavelength assignement: A solution with tabu search in dynamic traffic”, Ingeniare. Rev. chil. Ing, vol. 22, no 4, 2014, pp. 495-503.
A. Rodriguez et al., “New heuristic algorithm for dynamic traffic in WDM optical networks”, Revista Ingeniería e Investigación, vol. 35, no 3, 2015, pp. 100-106.
A. Rubio-Largo et al., “Tackling the Static RWA Problem by Using a Multiobjective Artificial Bee Colony Algorithm”, Advances in Computational Intelligence. Lecture Notes in Computer Science, Springer-Verlag, Berlin Heidelberg, vol. 6692, 2011, pp. 364-371.
Downloads
Published
How to Cite
Issue
Section
License
TRANSFER OF COPYRIGHT AGREEMENT
The manuscript is herewith submitted for publication in the Journal of Telecommunication, Electronic and Computer Engineering (JTEC). It has not been published before, and it is not under consideration for publication in any other journals. It contains no material that is scandalous, obscene, libelous or otherwise contrary to law. When the manuscript is accepted for publication, I, as the author, hereby agree to transfer to JTEC, all rights including those pertaining to electronic forms and transmissions, under existing copyright laws, except for the following, which the author(s) specifically retain(s):
- All proprietary right other than copyright, such as patent rights
- The right to make further copies of all or part of the published article for my use in classroom teaching
- The right to reuse all or part of this manuscript in a compilation of my own works or in a textbook of which I am the author; and
- The right to make copies of the published work for internal distribution within the institution that employs me
I agree that copies made under these circumstances will continue to carry the copyright notice that appears in the original published work. I agree to inform my co-authors, if any, of the above terms. I certify that I have obtained written permission for the use of text, tables, and/or illustrations from any copyrighted source(s), and I agree to supply such written permission(s) to JTEC upon request.
