I found several inaccuracies in QSPN documentation. 1. Paragraph 4.1, description of changed links: > Let R be the set of routes contained in the ETP received by C. > Let M be the set of all the routes contained in the map of C. > For each route r in R, the node C looks for a route m in M such that > dst(m) = dst(r), gw(m) = N > If m exists, then C sets rem(m) := rem(r) Really, rem(m) must be rem(r) + rem(CN)
2. Paragraph 4.1, description of broken links: > In other words, R is the set of all the best routes passing through > A. Note that R is not empty because there’s at least the route B-A. In general case, R can be empty. For example, let C node has links to B and A. If rem(AC)=1, rem(BC)=1 and rem(AB)=3, then the best route from B to A is B-C-A. _______________________________________________ Netsukuku mailing list [email protected] http://lists.dyne.org/mailman/listinfo/netsukuku
