Subject: [bmwg] Fwd: New Version Notification for draft-vpolak-bmwg-plrsearch-02.txt

From: "Maciek Konstantynowicz (mkonstan)" <[email-masked]>
Date: Mon, 8 Jul 2019 22:26:31 +0000

Dear BMWG,
We have just posted updated version of plrsearch draft.
We are looking for comments and adoption of the draft as BMWG document.

Dear BMWG Chairs,
We would like to ask for a slot during the upcoming IETF105 meeting,
to present this work and ask for BMWG adoption. We will be presenting
remotely. Thanks in advance for accommodating.

Regards,
-Maciek (on behalf of draft authors)

Begin forwarded message:

From: <[email-masked]<mailto:[email-masked]>>
Subject: New Version Notification for draft-vpolak-bmwg-plrsearch-02.txt
Date: 8 July 2019 at 23:24:12 BST
To: Vratko Polak <[email-masked]<mailto:[email-masked]>>, Maciek Konstantynowicz <[email-masked]<mailto:[email-masked]>>

A new version of I-D, draft-vpolak-bmwg-plrsearch-02.txt
has been successfully submitted by Maciek Konstantynowicz and posted to the
IETF repository.

Name: draft-vpolak-bmwg-plrsearch
Revision: 02
Title: Probabilistic Loss Ratio Search for Packet Throughput (PLRsearch)
Document date: 2019-07-08
Group: Individual Submission
Pages: 22
URL:            https://www.ietf.org/internet-drafts/draft-vpolak-bmwg-plrsearch-02.txt
Status:         https://datatracker.ietf.org/doc/draft-vpolak-bmwg-plrsearch/
Htmlized:       https://tools.ietf.org/html/draft-vpolak-bmwg-plrsearch-02
Htmlized:       https://datatracker.ietf.org/doc/html/draft-vpolak-bmwg-plrsearch
Diff:           https://www.ietf.org/rfcdiff?url2=draft-vpolak-bmwg-plrsearch-02

Abstract:
  This document addresses challenges while applying methodologies
  described in [RFC2544] to benchmarking software based NFV (Network
  Function Virtualization) data planes over an extended period of time,
  sometimes referred to as "soak testing".  Packet throughput search
  approach proposed by this document assumes that system under test is
  probabilistic in nature, and not deterministic.

Please note that it may take a couple of minutes from the time of submission
until the htmlized version and diff are available at tools.ietf.org<http://tools.ietf.org>.

The IETF Secretariat

On 27 Mar 2019, at 09:30, Maciek Konstantynowicz (mkonstan) <[email-masked]<mailto:[email-masked]>> wrote:

Hello BMWG!

We would like to gather feedback for PLRsearch draft, specifically
related to its applicability to throughput soak test:

1. PLRsearch can be used for a soak test with specified total test
duration. What are the common soak test criteria that need to be met?

2. How does one validate the critical load (maximum throughput) found by
a discovery test (e.g. with PLRsearch)? For example single trial with
long duration and measuring total loss, or multiple shorter trials
looking at maximum loss per trial.

3. Assuming a single test methodology combines critical load discovery
and validation, what would be the quantitive criteria to communicate
reliable vs. not reliable results?

Looking forward to the discussion in the meetings later today...

Cheers,
Vratko&Maciek