Application Research Of Ant Colony Algorithm In IPv6Routing

With the rapid development of internet and the rising number of internet users, the users’ needs about network service quality and network performance are also rapidly growing. In the next generation IPv6networks, routing problem is becoming a hot issue in the field of network communications. Ant colony algorithm is a new type of bionic random algorithm, ant colony algorithm derived from the behavior of the real ants, the individual behavior of each ant is very simple, but the ants are able to collaborate with each other in order to search shortest path between the nest and the food. Characteristics of ant colony are very good to resolve next-generation internet routing issues.In this thesis, routing algorithm based on the optimized ant colony algorithm is proposed, the algorithm not only can solve optimal routing problem, but also can fully utilize the good characteristics of the ant colony algorithm. Routing algorithm based on optimized ant colony algorithm can well adapt to next generation networks (IPv6) and can effectively solve the users’needs about network services, network performance, and so on.The main contents of this thesis are as follows:(1) The thesis analysis and research IPv6protocol in detail, at the same time, systematic analysis and research principle of ant colony algorithm, and described the process of ant searching for paths, and some typical model of ant colony algorithm.(2) For lack of ant colony algorithm, the ant colony algorithm is improved and optimized, routing algorithm based on the optimized ant colony algorithm is proposed. The algorithm described not only specific algorithm ideas and routing principles, but also principles of pheromone updated and punished, and so on.(3) The thesis Analysis α, β and p, and achieve their optimal values by a simulation. At the same time, based on the best value of α, β and ρ. routing algorithm is also simulated and the experimental results are analyzed and summarized.