Ordered from the most preferable to the least preferable. On Mon, 26 May 2003, Gert Doering wrote:
[ ] something else
Something else: allocate bigger chunks IANA->RIR and allocate as before. That seems pretty close to the third option.
[ ] allocate bigger chunks IANA->RIR (/8 ?) and inside those chunks, use a binary chop algorithm similar to the one described in RIPE-261
So this is the second preference, I guess (but there is not enough detail to say whether the binary chop etc. is actually what we want.)
[ ] continue the IANA->RIR->LIR allocation as it is now
Current is OK, except IANA gives way too small blocks.
[ ] accept RIPE-261
Whole 2000 seems like a lot, and I fail to see any need to lose the RIR separation here.
[ ] go for a full multi-level regional distribution, down to "one /32 per LIR per country" (as detailed by Michael Py)
This seems to have issues e.g. for multinational LIR's as well as when new countries are born and die. But maybe the issues could be worked out.. -- Pekka Savola "You each name yourselves king, yet the Netcore Oy kingdom bleeds." Systems. Networks. Security. -- George R.R. Martin: A Clash of Kings