Вы находитесь на странице: 1из 3

Contribution introduced to

the code
-In global-route-manager-impl.cc class that compute Dijkstra
Algorithm, in function SPFNext
When we are applying the formula in Dijkstra algorithm
(D(V) = min { D(v) , D(W)+C(V,W) })
The case when D(v) = D(W)+C(V,W) resulted in a new path in the
dijkstra algorithm. Eventually it will be least cost path as well as
the current path. That resulted in multiple paths to the same
destination.
What we did was to remove that if condition. From line (920 to
951).

- In the class ipv4-global-routing.cc There is a print function that


ns3 use to print routing tables.
In ns3 there is no way to output the print of the routing to the
output stream, so we had to modify this function in order to print
to console the routing table.

Run samples
The output using terminal

The output using file

Вам также может понравиться