Abstract
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important QoS metrics which affect the performance of a network. One of these metrics is the average network delay, which should be minimized. In this paper, a routing strategy based on simulated evolution algorithm to find suboptimal routing solution for computer networks while optimizing the above metric is presented. To intensify the search, a hybrid variant of the proposed algorithm has also been implemented. This variant incorporates Tabu search characteristics into the simulated evolution algorithm. Performance evaluation of the two approaches is done via simulation. Empirical results suggest that the hybrid variant performs better than the original simulated evolution algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
