[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
RE: Use cases for optimized DAD (was Re: [DNA-BOF] Do we need aseparate DAD Problem Statement?)
> > I am thinking about a situation where a moving node can
> > anticipate, with high probability, the prefix that
> > it is likely to use on the new link. For example, you could
> > say that the prefixes used on a given wide are WLAN network
> > were
> >
> > <common prefix>:hash(base station link layer address)::
> >
> > If that was the case, the node could optimistically assume
> > what its prefix is likely to be, and optimistically
> > configure a global address even before it has sent any
> > IP packets on the new link.
>
> I know this is jumping off the topic, but...
>
> I think that this design interesting, but may not be generally
> applicable (we have only 16 bits of network prefix which could
> be used for the hash).
I already thought and proposed that kind of method with hashing
alrorithms but if this method want to be a good quality, hash area
is as wide as possible. Unfortunately, general WLAN and customer
network are allocated by 64-bits or silently shorter prefix length.
Daniel