[Hipsec-rg] Hierarchical HITs

oleg.ponomarev at hiit.fi (Oleg Ponomarev) Thu, 15 January 2009 17:58 UTC

From: "oleg.ponomarev at hiit.fi"
Date: Thu, 15 Jan 2009 19:58:29 +0200
Subject: [Hipsec-rg] Hierarchical HITs
In-Reply-To: <f832b2de31429.31429f832b2de@huawei.com>
References: <f808bd0c3515b.3515bf808bd0c@huawei.com> <alpine.LFD.2.00.0901131526540.17180@stargazer.pc.infrahip.net> <f832b2de31429.31429f832b2de@huawei.com>
Message-ID: <alpine.LFD.2.00.0901151939590.17180@stargazer.pc.infrahip.net>

Hi! On Thu, 15 Jan 2009, JiangSheng 66104 wrote:

> Yes, when one change networks, it need to get a different HIP management 
> domain, even maybe generate a new HIT based on the new HIP management 
> domain.

So this will bind me to one provider forever?


> However, other mechanisms may be used to support the usage of permanent 
> user HITs, mechanisms similar to support CoA and HA in mobile IP 
> senarios.

Or just use mobile IP for this purpose?


>> "For each single looking up operation, one may search through most of 
>> the database, on average, O(number of total global HITs)."
>>
>> Did you mean O(log2(number of HITs)) time, which makes max O(100)?
>
> I actaully refer to the worst senarios, assuming the HIT is stored 
> disorderly in the data base.

Why is it the worst one? What if I use another bad implementation and get 
O(2^(number of HITs))?

P.S. [my basic degree is in math] The number of HITs is finite, therefore 
O(number of total global HITs) equals to O(1)

-- 
Regards, Oleg.