Internet presents problems of congestion and loss of packages due to an inefficient use of the network resources. The present technologies of routing are not enabled to surpass these problems, which with the course of the time worsen significantly. Before this dilemma, sciences of the computation make studies to develop new techniques that offer a better yield. In this sense, the present article presents/displays the design of a routing algorithm (Ant Route), based on the metaheuristic Ant Colony Optimization, whose objective is to reduce the time of congestion in the connections of a network, and with it to improve the total efficiency of a network OSP.
Design of Ant Colony -- based algorithm Ant Route for solve the OSPF problem
2007-09-01
373315 byte
Conference paper
Electronic Resource
English
Route Guidance System Based on OSPF Protocol
ASCE | 2006
|Using a Simulated Annealing Algorithm to Solve the Transit Route Network Design Problem
British Library Online Contents | 2006
|Using a Simulated Annealing Algorithm to Solve the Transit Route Network Design Problem
Online Contents | 2006
|Application of Ant Colony Optimization Based Algorithm to Solve Different Electromagnetic Problems
British Library Conference Proceedings | 2006
|