The Research On Congestion Avoidance And Dynamic Routing Method Based On Ant Colony Algorithm

With the rapid development of Internet, the issues of network congestion are becoming increasingly prominent. How to effectively manage bandwidth, to fully utilize network resources, and to avoid network congestion has become the urgent issue needing to be resolved. The ant colony algorithm (ACA) is one kind of mimic algorithm which was put forward by M.Dorigo. ACA borrows the mechanism of ant colony's forage, and every ant is looked as an agent. The characteristic of parallel, positive feedback and robust is strongly showed during ant colony's forage; ACA also has these characteristics, so the research of theory and utility of ACA has great merit. It has become a powerful tool for solving complex problems. As one kind of useful exploration, this paper will apply the ant colony algorithm to network routing protocol design. The main work of this paper is as follows:(1) This paper expounds the basic theory and model of the ACA algorithm as well as its implementation steps and its implementation process; analyzes the advantages and disadvantages of ACA's various models; then, introduces the latest research progress;(2) This paper analyzes the advantages and disadvantages of the current routing algorithm routing algorithm (such as DV and LS routing algorithm); then, explains the model and features of the ant colony routing algorithm, and applies the ant colony algorithm to the IP Network Routing optimization;(3) This paper presents a rationality-based ant routing algorithm; Simulations are made and the results demonstrate better;(4) This paper reconstructs the AntNet algorithm; Simulations are made on the topology of the China Education and Research Network, and the results of simulations verify the validity of AntNet routing algorithm;(5) This paper designs one kind of flood algorithm by applying the ant colony optimization to Mobile Ad Hoc Networks; simulation results are better comparing with DSR and AODV.