Abstract
As a new network addressing and routing scheme, anycast has been defined as a standard communication model in IPv6. The multiple QoS constrained anycast routing problem is a nonlinear combination optimization problem, which is proved to be a NP complete problem. This paper studies anycast routing technology with multiple QoS constraints and proposes a multiple QoS anycast routing algorithm based adaptive genetic algorithm. This algorithm uses adaptive probabilities of crossover and mutation over and over again in simple genetic algorithm. Fitness scaling can guarantee the diversity of populations, which is beneficial to find global optimal solution. Simulation results show the efficiency of our algorithm. It can satisfy the constrained condition of multiple QoS, balance network load fairly, and improve the quality of network service.
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.
