Abstract
To overcome the problem of tending to converge to part in anycast QoS routing based on Genetic Algorithm, a new improved anycast QoS routing algorithm based on Genetic Algorithm is proposed which adopt the improved chaotic disturbance operator. The simulated result shows that this algorithm has a good ability of global search, and it can find a set of low-cost paths with bandwidth constraints and delay requirements efficiently and quickly. By comparing the simulation data, the success rate of finding the optimal solutions is improved, and the larger network scale, its advantage is more obvious.
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.
