Date Added: May 2013
Dynamic Routing Assignment (DRA) is a key problem in intelligent optical computer networks. Mathematicians & Computer Scientists started researching the behavior of ants in the early 1990's to find new routing algorithms. The most efficient & widest AI techniques like Swarm particle optimization and Ant Colony Optimization (ACO) are used to find out solutions for dynamic problems. Ant Colony Optimization (ACO) and in the case of well implemented ACO techniques, optimal performance is comparative to existing top-performing routing algorithms. Such a research has yielded ways to minimize the number of nodes that are taken to get to the destination, techniques for quickly resolving an efficient path, and ways to avoid having loops within a routing scheme.