I-D Action:draft-azinger-scalable-addressing-00.txt

Tony Li tony.li at tony.li
Thu Sep 30 17:45:33 CEST 2010


>>>>> Have the practical problems "how do I find the combination of source + 
>>>>> destination IP out of a set of N possible sources and M destination 
>>>>> addresses that works 'best' for me" (with locally varying metrics for
>>>>> what is 'better' - latency, throughput, price, firewall policies, 
>>>>> upstream RPF) been solved by now?
>>>> 
>>>> This is an orthogonal problem.  PI doesn't solve it either.
>>> 
>>> With PI (on both ends), there is only one combination of source and
>>> destination IP address.  Which makes this quite easy - try this 
>>> combination, and if it works, it's the best possible option.  Sounds
>>> "solved" to me.
>> 
>> No, you only tried one path.  There's no way to say that this is 'best'.
> 
> If there is a single path, it's by definition the "best".  (It's also 
> the worst, for sure, but we're not looking for that).


If that's an acceptable solution, then pick any arbitrary path from the N*M possible address pairs and use that.  Same result.

Tony




More information about the ipv6-ops mailing list