[ndnSIM] CcnxGlobalRouting

Alex Afanasyev alexander.afanasyev at ucla.edu
Fri Jul 19 07:29:01 PDT 2013

Hi Saeid,

ndn::GlobalRouting uses Dijkstra algorithm for shortest (in terms of configured metric) route calculation.  What I meant by boost library dependency is that instead of reimplementing Dijkstra from scratch, ndn::GlobalRouting uses boost's implementation of the algorithm.

Btw. Currently, there are two versions of route calculations in ndn::GlobalRouting.  One version (CalculateRoutes) calculate just one shortest route (to each globally registered prefix), and another version calculate "neighbor-independent" set routes (i.e., if destination can be reached through the face if the face was the only one working, this face will be added to FIB).


On Jul 19, 2013, at 7:23 AM, Saeid Montazeri <saeid.montazeri at gmail.com> wrote:

> All dears,
> My question is about CcnxGlobalRouting. Does it calculate the routes based on shortest path?
> Regarding CalculateRoutes function, it is also mentioned that "Implementation of route calculation is heavily based on Boost Graph Library". What kind of dependency is implied?
> Best Regards,
> Saeid

More information about the ndnSIM mailing list