Commit 8d348d4a by Juliusz Chroboczek

Add comments about hysteresis algorithm.

1 parent a8631d72
Showing 1 changed file with 9 additions and 1 deletions
......@@ -656,6 +656,11 @@ route_acceptable(struct babel_route *route, int feasible,
return 1;
}
/* Find the best route according to the weak ordering. Any
linearisation of the strong ordering (see consider_route) will do,
we use sm <= sm'. We could probably use a lexical ordering, but
that's probably overkill. */
struct babel_route *
find_best_route(const unsigned char *prefix, unsigned char plen, int feasible,
struct neighbour *exclude)
......@@ -902,7 +907,10 @@ send_unfeasible_request(struct neighbour *neigh, int force,
}
}
/* This takes a feasible route and decides whether to install it. */
/* This takes a feasible route and decides whether to install it.
This uses the strong ordering, which is defined by sm <= sm' AND
m <= m'. This ordering is not total, which is what causes
hysteresis. */
void
consider_route(struct babel_route *route)
......
Styling with Markdown is supported
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!