the O(N^2) problem
Suresh Ramasubramanian
ops.lists at gmail.com
Mon Apr 14 06:07:26 UTC 2008
On Mon, Apr 14, 2008 at 11:27 AM, Edward B. DREGER
<eddy+public+spam at noc.everquick.net> wrote:
> For such a system to scale, it would need to avoid OSPF-style
> convergence. Similarly, I would not want to query, for the sake of
> example, 15k different "trust peers" each time I needed to validate a
> new <host,address> tuple. (Hence the interdomain routing and d-v calc
> references.)
And dkim layered with some kind of reputation (if only a locally built
whitelist) wont scale for this?
More information about the NANOG
mailing list