Erik,
I don't understand the last point. A KHI couldn't be used in
referrals unless we have a ubiquitous and scalable KHI->locator
lookup system, and I don't think we know how to build such a thing
(yet).
I think we know, at least for some value of "know". We can use
DHTs. What we don't apparently know are how to secure them against
freeloading in the case of multi-operator DHTs and how fast/slow they
will be in widespread use. But there are experiments and lots of
research going on in those areas.
http://www.opendht.org/
http://www.cs.cornell.edu/people/egs/beehive/codons.php
Some of the existing HIP implementations already support HIT->IP
address lookups from OpenDHT.
I think there is also a 2c to explore, which hasn't been talked
about much.
Instead of doing KHI, define Hierarchically allocated 128-bit
identifiers (hereby named HAI). If we have those we can use
existing scalable infrastructure for lookups (defining some new DNS
RR, or perhaps just use PTR and AAAA).
This would still be more heavyweight than SHIM6, since the lookup
of the locators is needed before communication can start.
But it would run on top shim6 for the locator agility part.
Yes, that would be an interesting area to explore. But that would
also create yet another hierarchy, and in my current "slash all
hierarchies from the Internet" attitude I would rather not go
there. :-)
More seriously, I would rather see the Internet to develop towards
fewer contention points (like the current DNS and IP address
assignments) rather than towards more of them.
--Pekka
_______________________________________________
Int-area mailing list
[email protected]
https://www1.ietf.org/mailman/listinfo/int-area
