Actions
Task #4985
closed
Better route calculation for ndnSIM
Status:
Closed
Priority:
Normal
Assignee:
-
Category:
helpers
Target version:
-
Start date:
Due date:
% Done:
100%
Estimated time:
Description
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/
Updated by Anonymous over 4 years ago
Gerrit code: https://gerrit.named-data.net/c/ndnSIM/+/5672
Updated by Davide Pesavento over 4 years ago
- Blocked by Feature #4992: Add Random Forwarding Strategy added
Updated by Anonymous over 4 years ago
- Status changed from New to Closed
- % Done changed from 0 to 100
The Gerrit code has merged.
Actions