Heuristic Algorithms: Novel Solution for RWA Problem in WDM Optical Networks
Keywords:
Heuristics Algorithm, NSFNET, Optical Networks, RWA, Snake Algorithms,Abstract
A new metaheuristic based on the Snake One algorithm is presented and it is compared with different heuristics for the NSFNET network. It is based on monitoring the congested nodes, but with sufficient coverage to satisfy the request for service. That condition does not improve essentially the blocking probability, but it does so in terms of the use of the network’s resources. In the case of the blocking probability, this metaheuristic performs better in optical networks that support traffic loads up to 120 erlangs, and in the case of the use of the network it operates much better than its predecessors Snake One and Snake Two, using fewer network resources for the same traffic load.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.