ANT ROUTING SYSTEM-A ROUTING ALGORITHM BASED ON ANT ALGORITHMS
In this design, a routing algorithm Ant Routing System (ARS) is developed using Matlab. ARS is based on a general-purpose metaheuristic named Ant Colony Optimization, which is a framework for building ant-inspired algorithms. ARS is applied as the routing algorithm in a simulated package-switched point-to-point network. It is tested using Matlab simulation whether ARS is able to obtain an increase in throughput while avoiding package loss in a heavily loaded network when packages are sent between two distinct routers. To this end, it is investigated how prioritizing different heuristics affect the quality of the routing performed. It is concluded that ARS behaves differently depending on the relative priority of positive feedback, negative feedback, and local heuristics and that it is possible to adjust the parameters to achieve a distribution of traffic over several paths when the network is heavily loaded, resulting in higher throughput and lower package loss.
Reference Paper: Ant Routing System-A Routing Algorithm Based on Ant Algorithms Applied to a Simulated Network
Author’s Name: Mikkel Bundgaard, Troels C. Damgaard, and Federico Decara og Jacob W. Winther
Source: Semanticscholar
Year:2002
Request source code for academic purpose, fill REQUEST FORM or contact +91 7904568456 by WhatsApp or info@verilogcourseteam.com, fee applicable.
SIMULATION VIDEO DEMO
