Project

General

Profile

Task #4985

Better route calculation for ndnSIM

Added by Klaus Schneider about 1 year ago. Updated 11 months ago.

Status:
Closed
Priority:
Normal
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/


Related issues

Blocked by NFD - Feature #4992: Add Random Forwarding Strategy ClosedKlaus Schneider

Actions
#2

Updated by Davide Pesavento about 1 year ago

#3

Updated by Klaus Schneider 11 months ago

  • Status changed from New to Closed
  • % Done changed from 0 to 100

The Gerrit code has merged.

Also available in: Atom PDF