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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Design of Ant Colony -- based algorithm Ant Route for solve the OSPF problem




    Publication date :

    2007-09-01


    Size :

    373315 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Route Guidance System Based on OSPF Protocol

    Li, Shujuan / Wang, Wei | ASCE | 2006


    CONTAINER ROUTING ALGORITHM USING OSPF

    AMIN RAHUL / KANG TINGCHUN / BARRION HENRY et al. | European Patent Office | 2022

    Free access

    Using a Simulated Annealing Algorithm to Solve the Transit Route Network Design Problem

    Fan, W. / Machemehl, R. B. | British Library Online Contents | 2006



    Application of Ant Colony Optimization Based Algorithm to Solve Different Electromagnetic Problems

    Quevedo-Teruel, O. / Rajo-Iglesias, E. / European Space Agency | British Library Conference Proceedings | 2006