On 07/ 7/10 12:21 AM, Pascal Thubert (pthubert) wrote:
[Pascal] This is a very classical issue. RPL handles it with the also
classical
lollipop algorithm. And yes, 2 reboots in row will take a bit more time
to
settle than just one, but it ends up working after the second reboot nb
reaches the previous watermark. More on the RPL version at:
http://tools.ietf.org/html/draft-ietf-roll-rpl-10#section-6
Seems like the non-deployed OSPFv1 used lollipop, but since that was
still subject to the S1 < S2 < S3 < S1 issue, this was removed in OSPFv2.
That might be an issue for Roll; I haven't looked at it closely.
In any case, OSPFv1 includes the feature where using a number on the
stick of the lollipop will result in other routers telling you the last
sequence number they they have for your LSA. The message flow for
6lowpan-nd doesn't have such a mechanism, and given that we don't
require flooding all the information to all the routers, it isn't clear
that we can actually add such a thing to 6lowpan-nd. (Without requiring
that the AROs be flooded to all of the 6LRs.)
Thus I think there is some work needed before we can consider applying
lollipop or any other sequence numbers to 6lowpan-nd.
[Pascal] This is basically what the HA does in MIP. This has an added
value for
the HA to be able to ensure bidir reachability by using a new seq num as
a
challenge, though it is not officially used in the protocol.
I HA in MIP is a centralized solution.
A distributed protocol is q very different beast.
Erik
_______________________________________________
6lowpan mailing list
[email protected]
https://www.ietf.org/mailman/listinfo/6lowpan
