ndnSIM

Existing ndnSIM route calculation provides two algorithms:

• CalculateRoutes(): Only provides a single shortest path nexthop.
• CalculateAllPossibleRoutes(): Provides all possible nexthops, but many of them lead to loops.

To improve on that, I want to implement LFID (Loop-Free Inport-Dependent) routing, which maximizes the nexthop choice while also completely avoiding loops.

The code is available here: https://github.com/schneiderklaus/ndnSIM-routing

And you can find the tech report of the design: https://named-data.net/publications/techreports/mp_routing_tech_report/