In article <Pine.LNX.4.44.0210101724030.9287-100000@xxxxxxxxxx> (at Thu, 10 Oct
2002 17:29:38 +0300 (EEST)), Pekka Savola <pekkas@xxxxxxxxxx> says:
> Dave, Alexey.. I think there has to be a high-level decision on how to
> proceed here. I'm referring to the optimization. TCP or other
> connection-oriented protocols use this one per connection; UDP and the
> like probably once per packet. The latter is at least quite undesirable,
> as you pointed out.
Hmm, what we think is, performance critical applications such as DVTS
(Digital Video Transport System) will do bind(2) so the latter is not
We need improved source address selection for further feature(s)
(like privacy extentions).
Our code is easy to implement further rules and order of calculation
cost is same as before; O(n) while n is number of addresses.
We think netdev and/or usagi can develop optimization later,
and we think people can survive until then.
> Putting the stuff in the routing table could work, but then this algorithm
> would have to be re-run always when there are changes in any address in
> the node. There might be other ways.
- store one (daddr,ddev,saddr,tstamp) set in sk
- update addrconf_tstamp in addrconf_verify() (etc.)
- check tstamp and addrconf_tstamp and use saddr if ok in saddr selection