Hi Rémi,

Please see inline.

Cheers,
Med 

-----Message d'origine-----
De : Rémi Després [mailto:[email protected]] 
Envoyé : mercredi 7 septembre 2011 10:56
À : BOUCADAIR Mohamed OLNC/NAD/TIP
Cc : GangChen; [email protected]; Wojciech Dec
Objet : Re: [Softwires] Analysis of Port Indexing Algorithms 
(draft-bsd-softwire-stateless-port-index-analysis)

Med,

More comments in line.

Le 7 sept. 2011 à 07:35, <[email protected]> 
<[email protected]> a écrit :

> Dear Gang,
> 
> As per the following property:
> 
>   o  Complexity: Complexity level of the algorithm
> 
> I agree this can be split into several sub items but in -00 we used it to 
> reflect the level of complexity to understand the algorithm and to configure 
> it.

These are two different subjects.

"Difficulty to understand" can be due to insufficient quality of explanations.
In this respect, I know what I have written in the past was quite perfectible.
I expect the 4rd-addmapping draft to be clearer on several points, but it 
certainly can be clarified further. Questions raised in the WG are helpful for 
that.

Med: This is IMHO an important aspect for the operational teams who are in 
charge of dimensioning the A+P space. Easiness of usability is important.

"Difficulty to configure" is rather minimal with solutions that are completely 
stateless.
Having "High" complexity for 4rd-addmapping can therefore be misleading.

Med: Not all the port indexing schemes on the table have the same complexity 
level. As I mentioned earlier, we need to depict this somehow. I would really 
appreciate if you can evaluate other port algorithms and share your evaluation.

(The Complexity criterion is also commented in my previous mail.)

Cheers,
RD

> I know Nejc had some experience in configuring for instance Murakami's 4rd 
> implementation. He found that it was much more complex to understand than the 
> portrange algorithm and the modulo algorithm. 
> 
> The text will be clarified.
> 
> Cheers,
> Med
> 
> -----Message d'origine-----
> De : GangChen [mailto:[email protected]] 
> Envoyé : mardi 6 septembre 2011 18:10
> À : BOUCADAIR Mohamed OLNC/NAD/TIP
> Cc : [email protected]; Wojciech Dec
> Objet : Re: [Softwires] Analysis of Port Indexing Algorithms 
> (draft-bsd-softwire-stateless-port-index-analysis)
> 
> Hello Authors,
> 
> I think the draft did really good analysis on several mapping
> algorithm, especially properties evaluation part.
> 
> One question for clarification:
> I saw several properties are COMPLEXITY related.
> Just wondering to know what kind of criteria you adopt to judge
> different levels(i.e. Low, Medium, High) ?
> I guess it would be beneficial if you could take some words to
> describe the criteria.
> 
> Many thanks
> 
> Gang
> 
> 
> 2011/9/6, [email protected]
> <[email protected]>:
>> Dear all,
>> 
>> We have just submitted an I-D analysing the port set algorithms we have on
>> the table. A set of properties are used to characterize the port set
>> algorithms.
>> 
>> This is a call for review. In particular, we invite authors of the following
>> proposals to review their section:
>> 
>>   o  [I-D.boucadair-behave-ipv6-portrange]
>>   o  [I-D.xli-behave-divi]
>>   o  [I-D.murakami-softwire-4v6-translation]
>>   o  [I-D.murakami-softwire-4rd]
>>   o  [I-D.despres-softwire-4rd-addmapping]
>> 
>> Questions, suggestions, corrections and contributions are more than
>> welcome.
>> 
>> Thank you.
>> Cheers,
>> Med
>> 
>> 
>> -----Message d'origine-----
>> De : [email protected] [mailto:[email protected]] De
>> la part de [email protected]
>> Envoyé : lundi 5 septembre 2011 18:33
>> À : [email protected]
>> Objet : I-D Action: draft-bsd-softwire-stateless-port-index-analysis-00.txt
>> 
>> A New Internet-Draft is available from the on-line Internet-Drafts
>> directories.
>> 
>>      Title           : Analysis of Port Indexing Algorithms
>>      Author(s)       : Mohamed Boucadair
>>                          Nejc Skoberne
>>                          Wojciech Dec
>>      Filename        : 
>> draft-bsd-softwire-stateless-port-index-analysis-00.txt
>>      Pages           : 25
>>      Date            : 2011-09-05
>> 
>>   This document analyzes various algorithm proposals for building port
>>   sets.  These algorithms are used to encode the range of ports in an
>>   IPv6 address and prefix in the context of stateless solutions.  The
>>   ultimate goal of this analysis is to converge on one or a set of
>>   algorithms to be used by all stateless solutions.
>> 
>>   This is a companion document to
>>   [I-D.boucadair-softwire-stateless-rfc6052-update].
>> 
>> 
>> A URL for this Internet-Draft is:
>> http://www.ietf.org/internet-drafts/draft-bsd-softwire-stateless-port-index-analysis-00.txt
>> 
>> Internet-Drafts are also available by anonymous FTP at:
>> ftp://ftp.ietf.org/internet-drafts/
>> 
>> This Internet-Draft can be retrieved at:
>> ftp://ftp.ietf.org/internet-drafts/draft-bsd-softwire-stateless-port-index-analysis-00.txt
>> _______________________________________________
>> I-D-Announce mailing list
>> [email protected]
>> https://www.ietf.org/mailman/listinfo/i-d-announce
>> Internet-Draft directories: http://www.ietf.org/shadow.html
>> or ftp://ftp.ietf.org/ietf/1shadow-sites.txt
>> _______________________________________________
>> Softwires mailing list
>> [email protected]
>> https://www.ietf.org/mailman/listinfo/softwires
>> 
> _______________________________________________
> Softwires mailing list
> [email protected]
> https://www.ietf.org/mailman/listinfo/softwires

_______________________________________________
Softwires mailing list
[email protected]
https://www.ietf.org/mailman/listinfo/softwires

Reply via email to