Re: [rrg] Aggregatable EIDs

> -----邮件原件-----
> 发件人: rrg-bounces@irtf.org [mailto:rrg-bounces@irtf.org] 代表 Brian E
> Carpenter
> 发送时间: 2009年12月26日 3:32
> 收件人: wei zhang
> 抄送: rrg@irtf.org
> 主题: [rrg] Aggregatable EIDs
> 
> On 2009-12-26 05:52, wei zhang wrote:
> ...
> > A good answer is that the EID should also be aggregateable,
> 
> I may be missing what you mean, because it seems to me that
> any set of bit strings (even of variable length) is aggregatable
> to an arbitrary extent. Just build a binary tree and chop it
> off at whatever level you want (/N if you want 2^N aggregates).

Agree. Even the EID is a flat label, the corresponding ID->Locator mapping
system could scale well by using some methods, e.g., DHT.

IMO, a major reason that the EID should be hierarchical is as follows: 

The resolution infrastructure for flat names has no "pay-for-your-own”
model, as the flat names are stored at essentially random nodes. In
contrast, the resolution infrastructure for the hierarchical host
identifiers has reasonable business models and clear trust boundaries. Since
the hierarchical host identifiers have clear organization affiliation, the
identifier resources and the corresponding mappings can be managed by
different bodies with clear administrative boundaries.

Xiaohu

> (The equivalent has to be true for namespaces using n-ary instead of
> binary symbols.)
> 
>     Brian
> _______________________________________________
> rrg mailing list
> rrg@irtf.org
> http://www.irtf.org/mailman/listinfo/rrg