The obvious, and I think best, solution (presuming that distributionThat would be a very large database, hence expensive.
of registration is desirable) is for IANA to generate independent
random prefixes in advance and delegate these en masse. The delegated
registrars can then assign the prefixes they have been given to individual
registrants, either sequentially or randomly. This is not an expensive
operation.
Increasing the size of the blocks to manage the scale of the database increases
the size of the "aggregable chunks".
I oppose your idea of having allocated prefixes be numerically related,Randomly is not the requirement. Non-aggregatable is the requirement.
because it defeats the aim of having no discernable structure in the
prefix IDs. Whoever generates the prefixes must do so randomly and
independently.
If you don't like the simple approach, a collegue of mine came up with the idea of using a perfect hash to do the mapping. In that case there is no mapping. I'll write it up shortly.
- aidan
-------------------------------------------------------------------- IETF IPng Working Group Mailing List IPng Home Page: http://playground.sun.com/ipng FTP archive: ftp://playground.sun.com/pub/ipng Direct all administrative requests to [EMAIL PROTECTED] --------------------------------------------------------------------
