> I am studying the code of babeld, but I cannot find the " DSDV, > AODV" algorithm in the code. could somebody help me? or tell me the > bellman-ford algorithm the locate or the code's function.
The BF algorithm is in the function route_changed. It is called in three places: - update_route, which is called whenever we receive an update for a route, - update_route_metric, which is called whenever a route's metric changes for reasons unrelated to an update, - retract_neighbour_routes, which is called when a neighbour is lost. The DSDV-like bit is in the function route_feasible. -- Juliusz _______________________________________________ Babel-users mailing list [email protected] https://alioth-lists.debian.net/cgi-bin/mailman/listinfo/babel-users
