TY - GEN
T1 - Design of Ant Colony - Based algorithm Ant Route for solve the OSPF problem
AU - Anticona, Manuel Tupia
AU - Villegas, Carina Estrada
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/47349098531
U2 - 10.1109/CERMA.2007.4367718
DO - 10.1109/CERMA.2007.4367718
M3 - Conference contribution
AN - SCOPUS:47349098531
SN - 0769529747
SN - 9780769529745
T3 - Electronics, Robotics and Automotive Mechanics Conference, CERMA 2007 - Proceedings
SP - 386
EP - 391
BT - Electr., Rob. Autom. Mech. Conf., CERMA - Proc.
T2 - Electronics, Robotics and Automotive Mechanics Conference, CERMA 2007
Y2 - 25 September 2007 through 28 September 2007
ER -