  With the increasing demand and complexity of networks, factors such as
balancing the load, improving the performance, reducing delay and finding
optimal path between nodes in a computer network have become crucial. The
traditional routing approaches are not able to perform up to the mark as they
do not take into account factors such as reducing delay and adaptive nature.
Thus there is a need for more sophisticated techniques to meet the current
network problems. This paper focuses on Ant-net algorithm based on Ant colony
optimization which is an adaptive routing algorithm.In this approach, models of
collective intelligence are transformed into optimization techniques. The ants
travel across various paths in the network, thus depositing of pheromone,
collecting route information and congestion. In this paper the Ant-Net
algorithm along the important data structures required has been discussed and
it is implemented on a simple packet switch network. The simulations describe
the adaptive nature of the algorithm
