Title: Ant Routing Algorithm Simulation using OPNET

Several routing protocols exist for large networks, Open Shortest Path First (OSPF) has been one of the most commonly used. Another technique that could serve a similar purpose is the new Ant Routing Algorithm. This is an adaptive routing technique based on the way ants forage. One of the most distinguished characteristics of this algorithm is that it stores a pheromone variable in each switching node and increments this variable depending on the amount of traffic that flows through the node. After a finite period of time the system will reach a steady-state in which the shortest path has the highest amount of traffic flow. This project presents some simulations results based on the combination of ideas that the authors of this paper gathered into one algorithm. A brief description of OPNET is also provided to the reader. From the results we discuss some of the pros and cons of implementing this routing protocol into an existing network