[Mobopts] Re: Using Hashes to Optimize RR

Thanks, Christian.
I will take a look at the draft, and get back to the issue.

Souhwan

----- Original Message ----- 
?? ??: "Christian Vogt" <chvogt@tm.uka.de>
?? ??: <fanzhao@ucdavis.edu>; <sfwu@ucdavis.edu>;
<jyzhou@i2r.a-star.edu.sg>; <souhwanj@ssu.ac.kr>
??: "MOBOPTS" <mobopts@irtf.org>; "Jari Arkko" <jari.arkko@kolumbus.fi>
?? ??: 2005? 8? 4? ??? ?? 8:43
??: Using Hashes to Optimize RR

> Hello,
>
> here is the draft that I mentioned after the presentation "Improvement
> on Security and Performance of MIP6 Return Routability Test", and which
> might be of relevance to the presentors:
>
>    Credit-Based Authorization for Binding Lifetime Extension
>    draft-arkko-mipv6-binding-lifetime-extension-00.txt
>
> The draft describes a hash-based mechanism that allows peers to
> successively prolong the time period between two home-address tests.
> This reduces signaling overhead and the latency associated with frequent
> home-address tests.  A correspondent node can validate from a hash how
> long a MN has already been reachable at a given home address, and it can
> so extend the lifetime of a binding.
>
> The draft above might
>
> Regards,
> - Christian
>
> -- 
> Christian Vogt, Institute of Telematics, University of Karlsruhe
> www.tm.uka.de/~chvogt/pubkey/
>
>
>

_______________________________________________
Mobopts mailing list
Mobopts@irtf.org
https://www1.ietf.org/mailman/listinfo/mobopts