IETF Logo Mail Archive

Re: [dbound] Updated draft-levine-orgboundary-03

"John R Levine" <johnl@taugh.com> Thu, 12 November 2015 17:27 UTC

Return-Path: <johnl@taugh.com>
X-Original-To: dbound@ietfa.amsl.com
Delivered-To: dbound@ietfa.amsl.com
Received: from localhost (ietfa.amsl.com [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id A737A1B2A93 for <dbound@ietfa.amsl.com>; Thu, 12 Nov 2015 09:27:41 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -1.137
X-Spam-Level:
X-Spam-Status: No, score=-1.137 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, HELO_MISMATCH_COM=0.553, HOST_MISMATCH_NET=0.311, SPF_PASS=-0.001] autolearn=no
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id NfNyqgwGZQoM for <dbound@ietfa.amsl.com>; Thu, 12 Nov 2015 09:27:41 -0800 (PST)
Received: from miucha.iecc.com (abusenet-1-pt.tunnel.tserv4.nyc4.ipv6.he.net [IPv6:2001:470:1f06:1126::2]) (using TLSv1 with cipher DHE-RSA-AES256-SHA (256/256 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id B05E81B2A92 for <dbound@ietf.org>; Thu, 12 Nov 2015 09:27:40 -0800 (PST)
Received: (qmail 47362 invoked from network); 12 Nov 2015 17:27:39 -0000
DKIM-Signature: v=1; a=rsa-sha256; c=simple; d=iecc.com; h=date:message-id:from:to:cc:subject:in-reply-to:references:mime-version:content-type:user-agent; s=b900.5644cc0b.k1511; bh=MYTcTvDb6aHaXBkx0U+VhFguOzpOg2fLThsgiVjhk4s=; b=aTz6E/UkhHWnShbV6n2QP4Fs3MiYjvgtd7EzWEDNVdK0VGHaDQil4LTSBMMvEEMsrmYw/dPtESkB6IVaSAICQwz1vnGJ8zCweQ7bSnlDec+neGWwDXbLQ9ToKu41OJCzeEHhWZIdnxZVcC++xnnVrWRZxqV5zvqDyiaAeKZI8PxoaM8rF+keYy8h02RlfS6QEuf5qa4kUYYQgY8ExVCCNwMpwPugWOXWKFgrQKtlhVm5el09W16i62N8cJVw+rXW
DKIM-Signature: v=1; a=rsa-sha256; c=simple; d=taugh.com; h=date:message-id:from:to:cc:subject:in-reply-to:references:mime-version:content-type:user-agent; s=b900.5644cc0b.k1511; bh=MYTcTvDb6aHaXBkx0U+VhFguOzpOg2fLThsgiVjhk4s=; b=SPG8Hluvl+wAlPeoJjMYoe9IjdjKXUSQovOv+N2YmJOaxbOubGsua/OyACXCgO9OL+WGDbukkZTM+u6kOSv4ZULBkv6F6oz0n3ub/xuNE9iTTV8FlyKBVbRt5J8DpJ5onyc7BJKGB7TUkg8mUn91WkkHk/ev/eLA3nZghLiUuh6Nmix1cLeu7ULN/LFVIdPzlrz3R+w8hcbqfsWOC/rH2Ra5CmnNSbUiItJ5spUj1MfjIAADAQ5kNapFbBD2FcE6
Received: from localhost ([IPv6:2001:470:1f07:1126::78:696d:6170]) by imap.iecc.com ([IPv6:2001:470:1f07:1126::78:696d:6170]) with ESMTPS (TLS1.0/X.509/SHA1) via TCP6; 12 Nov 2015 17:27:39 -0000
Date: Thu, 12 Nov 2015 12:27:38 -0500
Message-ID: <alpine.OSX.2.11.1511121225420.8046@ary.lan>
From: John R Levine <johnl@taugh.com>
To: Casey Deccio <casey@deccio.net>
In-Reply-To: <CAEKtLiQwNiod05dhfaLwgv9MME80vDzCXLV4Lp+BiQA-sdom9Q@mail.gmail.com>
References: <alpine.OSX.2.11.1511091838260.92970@ary.local> <20151112021154.2231.qmail@ary.lan> <CAEKtLiQAiQ2gnv5828yifGCZb_0oH1kTSLsx8p0EaPoqA-k=ig@mail.gmail.com> <alpine.OSX.2.11.1511121201440.7480@ary.lan> <CAEKtLiQwNiod05dhfaLwgv9MME80vDzCXLV4Lp+BiQA-sdom9Q@mail.gmail.com>
User-Agent: Alpine 2.11 (OSX 23 2013-08-11)
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset="US-ASCII"; format="flowed"
Archived-At: <http://mailarchive.ietf.org/arch/msg/dbound/HdTNEQuX65GGo3p7VWeRLHrn7u0>
Cc: "dbound@ietf.org" <dbound@ietf.org>
Subject: Re: [dbound] Updated draft-levine-orgboundary-03
X-BeenThere: dbound@ietf.org
X-Mailman-Version: 2.1.15
Precedence: list
List-Id: DNS tree bounds <dbound.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/dbound>, <mailto:dbound-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/dbound/>
List-Post: <mailto:dbound@ietf.org>
List-Help: <mailto:dbound-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/dbound>, <mailto:dbound-request@ietf.org?subject=subscribe>
X-List-Received-Date: Thu, 12 Nov 2015 17:27:41 -0000

>> Wildcards make the lookup O(1) rather than O(N).  I think that's an
>> important difference.
>
> Big-O notation characterizes the upper bound of algorithmic complexity.

Yes, I know.

My scheme will typically make one or two DNS queries regardless of the 
length of the DNS name.  Yours appears to do a tree walk for each name 
component.

My assumption is that each request is likely to be for a particular 
application.  If you need to enumerate the boundaries for M services, that 
will take M times as long but that doesn't seem like a very common 
situation.

Regards,
John Levine, johnl@taugh.com, Taughannock Networks, Trumansburg NY
Please consider the environment before reading this e-mail.

v2.23.0 | Report a Bug | By Email