• DocumentCode
    2905369
  • Title

    Simulation of the Floyd-Warshall algorithm using OMNeT++ 4.1

  • Author

    Comsa, Anamaria ; Rus, Andrei Bogdan ; Dobrota, Virgil

  • Author_Institution
    Commun. Dept., Tech. Univ. of Cluj-Napoca, Cluj-Napoca, Romania
  • fYear
    2012
  • fDate
    21-23 June 2012
  • Firstpage
    229
  • Lastpage
    232
  • Abstract
    The paper is focused on the Floyd-Warshall all-paths routing algorithm, presenting its first implementation in OMNeT++ simulator. The experiments are trying to demonstrate that Floyd-Warshall´s use for a routing protocol is more efficient from infrastructure provider´s perspective. The performances are compared to the results obtained when employing distance-vector protocols (such as RIP) or link-state protocols (such as OSPF). The approach is to provide a permanent adaptation to the network parameters such as the available transfer rate and the latency.
  • Keywords
    computer networks; graph theory; routing protocols; Floyd-Warshall all-paths routing algorithm; OMNeT++ 4.1 simulator; distance-vector protocols; infrastructure provider perspective; link-state protocols; network parameters; permanent adaptation; routing protocol; transfer rate; Educational institutions; IP networks; Logic gates; Network topology; Routing; Routing protocols; Topology; Floyd-Warshall algorithm; cost matrix; link capacity; link flow;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications (COMM), 2012 9th International Conference on
  • Conference_Location
    Bucharest
  • Print_ISBN
    978-1-4577-0057-6
  • Type

    conf

  • DOI
    10.1109/ICComm.2012.6262572
  • Filename
    6262572