IBGP Routing Algorithm Based On Ant Colony Algorithm

Internal Border Gateway Protocol(IBGP)is an essential infrastructure of the Internet.If it is not properly configured,routing loops and suboptimal routes can quickly occur.These abnormal routing problems are very harmful.They increase the workload of the router and cause the performance of the router to decrease.Therefore,it is imperative to solve the above-mentioned abnormal IBGP routing problem.However,traditional solutions are either complicated to configure or consume excessive resources.Therefore,studying how to effectively solve IBGP routing abnormalities while keeping the solution’s cost lower is still one of the critical issues in the study of IBGP.In this article,we propose an IBGP routing model based on Ant Colony algorithm called ARAI,which can select the optimal route and eliminate routing loops and reduce routing costs.Specifically,we use the pheromone in the ant colony algorithm to comprehensively evaluate the link quality to ensure that the best link is selected and then add a Router-Path attribute to the UPDATE message IBGP message to prevent routing loops.The simulation results show that ARAI reduces30% of packets and 93% of IBGP sessions than Full Mesh,resulting in lower costs.In summary,the main contributions of this article can be summarized as follows:(1)Link quality assessment: We propose a plan to use a pheromone in ant colony algorithm to comprehensively assess link quality,which can dynamically reflect the link Changes in quality.(2)Elimination of routing loops: We have designed a new mechanism to prevent routing loops.Compared with the existing routing loop prevention solutions,it allows IBGP peers to learn new routes from each other.(3)Low cost: Because we have adopted a new anti-loop mechanism and selected high-quality forwarding links,many redundant IBGP sessions and data packets have been reduced,resulting in reduced overhead.This model only needs to use the pheromone and Router-Path parameters in the ant colony algorithm to select the optimal route from many routes without routing loops,so it is easier to configure and deploy than traditional solutions.