nanog mailing list archives
Re: the O(N^2) problem
From: "Suresh Ramasubramanian" <ops.lists () gmail com>
Date: Mon, 14 Apr 2008 10:57:46 +0530
On Mon, Apr 14, 2008 at 10:34 AM, Owen DeLong <owen () delong com> wrote:
Now I'm lost again. You've mixed so many different metaphors from interdomain routing to distance-vector computaton to store-and-forward that I simply don't understand what you are proposing or how one could begin to approach implementing it or what problem you seem to think it solves (although it sort of seems like you're wanting to attack the trustworthiness of email to battle SPAM through some mechanism that depends only on the level of trust for the (source, arrival path) tuple from whence it came.
Looks like what various people in the industry call a "reputation system"
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)