Re: [bmwg] Martin Duke's Discuss on draft-ietf-bmwg-b2b-frame-03: (with DISCUSS and COMMENT)

this would seem to work if 2 seconds is significantly longer than it takes to send the burst - but if it takes 2 second to send the burst 
then 2 seconds extra buffer could easily lose packets - seems to me that he extra time should be related to the time it takes to send the burst

e.g 50% of the burst time but not less than 2 seconds

Scott


> On Dec 12, 2020, at 10:18 AM, MORTON, ALFRED C (AL) <acm@research.att.com> wrote:
> 
> Hi Martin, thanks for your review and comment,
> please see my reply, [acm] below,
> Al
> 
>> -----Original Message-----
> ...
>> 
>> ----------------------------------------------------------------------
>> DISCUSS:
>> ----------------------------------------------------------------------
>> 
>> Thank you for engaging with the TSVART review. Despite the wordsmithing that
>> has gone on, I am not sure that we have captured the correct text.
>> 
>> The proposed change is:
>>> I clarified:
>>> The duration of the trial MUST include at least 2 seconds in addition to the time
>>> required to send and receive each burst of frames, to ensure that DUT buffers to deplete. 
>>> and I'll add: 
>>> The upper search limit for the time to send each burst MUST be configurable as 
>>> high as 30 seconds (buffer time results
>>> reported at the configured upper limit are likely invalid, and the test MUST
>>> be repeated with a higher search limit).
>> 
>> But IIUC it's the additional time that needs to scale up. 
> [acm] 
> 
> In the revised text where David and I reached agreement, we identified 3 time components of the trial duration, making the duration variable: no longer static and at "at least 2 seconds".
> 
> 1. the time to send the burst of frames (at the back-to-back rate), determined by the search algorithm
> 2. the time to receive the transferred burst of frames (at the RFC2544 Throughput rate), possibly truncated by buffer overflow, but certainly including the latency of the DUT with or without buffer-bloat
> 3. at least 2 seconds in addition to the time to receive the burst (2.), to ensure that DUT buffers have depleted.
> 
> So, both components 1. and 2. are variables, and the burst receive time component (2.) compensates for large buffers, non-back-to-back burst egress, and anything else that contributes to DUT latency. The final "at least 2 seconds" is simply about making sure the trial is really over before moving on in an automated test - we won't make an error if frames trickle-out very late for some unfortunate reason.
> 
>> A layman's reading of
>> the document, IMO, suggests that the burst length has a binary search but the 2
>> seconds of waiting can be fixed.
> [acm] 
> Yes, that's right, plus all the other factors above.
> 
> So, let's try this, but I'm trying not to extend or complicate the buffer time << 2 seconds testing for the sake of the buffer-bloat case:
> 
> -=-=-=-=-=-=-
> 
> The duration of the trial includes three REQUIRED components:
> 
> 1. the time to send the burst of frames (at the back-to-back rate), determined by the search algorithm
> 2. the time to receive the transferred burst of frames (at the RFC2544 Throughput rate), possibly truncated by buffer overflow, and certainly including the latency of the DUT 
> 3. at least 2 seconds not overlapping the time to receive the burst (2.), to ensure that DUT buffers have depleted.
> 
> The upper search limit for the time to send each burst MUST be configurable as high as 30 seconds (buffer time results reported at or near the configured upper limit are likely invalid, and the test MUST be repeated with a higher search limit).
> 
> -=-=-=-=-=-=-=-=-
> 
> Does that wording do it?
> 
>> 
>> ----------------------------------------------------------------------
>> COMMENT:
>> ----------------------------------------------------------------------
>> 
>> Other than that, this a well-written document. Thanks!
> [acm] 
> Thank you!
> 
>> 
>> 
> 
> _______________________________________________
> bmwg mailing list
> bmwg@ietf.org
> https://www.ietf.org/mailman/listinfo/bmwg