[103775] in North American Network Operators' Group

home	help	back	first	fref	pref	prev	next	nref	lref	last	post

Re: the O(N^2) problem

daemon@ATHENA.MIT.EDU (Suresh Ramasubramanian)
Mon Apr 14 02:24:05 2008

Date: Mon, 14 Apr 2008 11:37:26 +0530
From: "Suresh Ramasubramanian" <ops.lists@gmail.com>
To: "Edward B. DREGER" <eddy+public+spam@noc.everquick.net>
Cc: nanog@merit.edu, "Owen DeLong" <owen@delong.com>
In-Reply-To: <Pine.LNX.4.62.0804140528330.17426@pop.ict1.everquick.net>
Errors-To: owner-nanog@merit.edu


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?

home	help	back	first	fref	pref	prev	next	nref	lref	last	post