Dave,
> Where I have N source addresses and M
> destination addresses, this is easily shown to be
> O(N*M).
Well, not quite, if you have an address selection algorithm
that excludes some combinations up front. Also, do we expect
N or M to be >3 in many cases, or even >2 in most cases?
So I think the practical value will be less than you fear,
typically 4, and >9 would be very rare. Not that this is
negligible, but it's not unthinkable either.
draft-ietf-shim6-locator-pair-selection and
draft-ietf-shim6-failure-detection talk about example mechanisms
for this, by the way.
Brian
_______________________________________________
rrg mailing list
[email protected]
https://www.irtf.org/mailman/listinfo/rrg
