nanog mailing list archives
Re: the O(N^2) problem
From: "Suresh Ramasubramanian" <ops.lists () gmail com>
Date: Mon, 14 Apr 2008 11:37:26 +0530
On Mon, Apr 14, 2008 at 11:27 AM, Edward B. DREGER <eddy+public+spam () 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?
Current thread:
- the O(N^2) problem Edward B. DREGER (Apr 13)
- Re: the O(N^2) problem David Andersen (Apr 13)
- Re: the O(N^2) problem Owen DeLong (Apr 13)
- Re: the O(N^2) problem Suresh Ramasubramanian (Apr 13)
- Re: the O(N^2) problem Edward B. DREGER (Apr 13)
- Re: the O(N^2) problem Suresh Ramasubramanian (Apr 13)
- Re: the O(N^2) problem Steven M. Bellovin (Apr 13)
- Re: the O(N^2) problem Suresh Ramasubramanian (Apr 14)
- Re: the O(N^2) problem Joe Greco (Apr 14)
- Re: the O(N^2) problem Suresh Ramasubramanian (Apr 13)
- [admin] RE: the O(N^2) problem Martin Hannigan (Apr 14)
- <Possible follow-ups>
- Re: the O(N^2) problem Edward B. DREGER (Apr 14)
- Re: the O(N^2) problem Rich Kulawiec (Apr 14)