Re: IP namespace (Was: Re: root knowledge)

Christian Huitema <Christian.Huitema@sophia.inria.fr> Thu, 14 May 1992 17:18 UTC

Received: from nri.nri.reston.va.us by ietf.NRI.Reston.VA.US id aa02618; 14 May 92 13:18 EDT
Received: from nri.reston.va.us by NRI.Reston.VA.US id aa20157; 14 May 92 13:24 EDT
Received: from bells.cs.ucl.ac.uk by NRI.Reston.VA.US id aa20153; 14 May 92 13:24 EDT
Via: mhs-relay.ac.uk; Thu, 14 May 1992 15:55:18 +0100
X400-Received: by mta mhs-relay.ac.uk in /PRMD=UK.AC/ADMD= /C=GB/; Relayed; Thu, 14 May 1992 09:04:14 +0100
X400-Received: by /PRMD=inria/ADMD=atlas/C=FR/; Relayed; Thu, 14 May 1992 09:06:16 +0100
Date: Thu, 14 May 1992 08:04:14 +0000
X400-Originator: huitema@mitsou.inria.fr
X400-MTS-Identifier: [/PRMD=inria/ADMD=atlas/C=FR/;705830800@kwai.inria.fr]
X400-Content-Type: P2-1984 (2)
Content-Identifier: Re: IP namesp...
From: Christian Huitema <Christian.Huitema@sophia.inria.fr>
Message-ID: <199205140806.AA19369@mitsou.inria.fr>
To: osi-ds@cs.ucl.ac.uk
Cc: yeongw@psi.com
In-Reply-To: <9205131240.AA00325@spartacus.psi.com>
Subject: Re: IP namespace (Was: Re: root knowledge)
X-Mts: smtp
Sender: huitema@mitsou.inria.fr

Hello,

I see that you are investigating various ways to represent the IP address space in
the DNS. Let me tell you of three possible criterias:

1) It shall be directly based on the address itself, not on a DNS representation
of the address,

2) It shall be distributed. Storing tens of millions of entries in a single space
is not an alternative.

3) The distribution shall be independant of the address format. Class A, B and C
are used now, but a new "CIDR" format is just being defined for coping with the
"address exhaustion" problem.

This is in fact a case where you would like to use "longest match" searches, i.e.
select all possible entries in the database where attribute X contains the "first
bits" (yes, I said BIT, not octet) of the target Y, then select the "longest X"
and continue the search. Similar searches would be absolutely needed for NSAP
resolution.

There is no "longest match" operation defined in X.500 -- too bad! We could
however define a particular syntax (subtype of bit string, or of octet string),
and specify that the "<" and ">" operation refer to the partial order:

  X < Y  <=> (length of X, lx =< length of Y) and (X == firsts "lx" bits of Y).
  X > Y  <=>  Y < X

Playing indexing games with this would be relatively easy...

Christian Huitema