Subject: [Mobopts] RE: Using Hashes to Optimize RR

From: "Fan Zhao" <[email-masked]>
Date: Thu, 4 Aug 2005 11:53:47 -0700 (PDT)

HI, Christian, 
 
Thank you very much. I will take a look and comment on that. 
 
Sincerely, 
fan 
 
> 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
[email-masked]
https://www1.ietf.org/mailman/listinfo/mobopts