[bmwg] FW: New Version Notification for draft-ietf-bmwg-mlrsearch-02.txt

["Vratko Polak -X (vrpolak - PANTHEON TECH SRO at Cisco)" <[e-mail]>]

Hello.

This cycle we have started a larger rewrite of the MLRsearch draft,
and we have run out of time sooner than usual.

The text has may TODOs and large chunks
or text that should have been updated (but were not).

Anyway, some of the comments by Gábor and Vladimir
have been addressed (one way or another).

If anybody is interested in background information
that has been commented out (due to not being
relevant enough, or written in an inappropriate language),
you can look at our markdown source here [1].

[1] https://gerrit.fd.io/r/c/csit/+/35539/14/docs/ietf/draft-ietf-bmwg-mlrsearch-02.md

Vratko.

-----Original Message-----
From: [e-mail] <[e-mail]> 
Sent: Monday, 2022-March-07 20:23
To: Maciek Konstantynowicz (mkonstan) <[e-mail]>; Vratko Polak -X (vrpolak - PANTHEON TECH SRO at Cisco) <[e-mail]>
Subject: New Version Notification for draft-ietf-bmwg-mlrsearch-02.txt


A new version of I-D, draft-ietf-bmwg-mlrsearch-02.txt
has been successfully submitted by Vratko Polak and posted to the
IETF repository.

Name:		draft-ietf-bmwg-mlrsearch
Revision:	02
Title:		Multiple Loss Ratio Search for Packet Throughput (MLRsearch)
Document date:	2022-03-07
Group:		bmwg
Pages:		28
URL:            https://www.ietf.org/archive/id/draft-ietf-bmwg-mlrsearch-02.txt
Status:         https://datatracker.ietf.org/doc/draft-ietf-bmwg-mlrsearch/
Htmlized:       https://datatracker.ietf.org/doc/html/draft-ietf-bmwg-mlrsearch
Diff:           https://www.ietf.org/rfcdiff?url2=draft-ietf-bmwg-mlrsearch-02

Abstract:
   TODO: Update after all sections are ready.

   This document proposes changes to [RFC2544], specifically to packet
   throughput search methodology, by defining a new search algorithm
   referred to as Multiple Loss Ratio search (MLRsearch for short).
   Instead of relying on binary search with pre-set starting offered
   load, it proposes a novel approach discovering the starting point in
   the initial phase, and then searching for packet throughput based on
   defined packet loss ratio (PLR) input criteria and defined final
   trial duration time.  One of the key design principles behind
   MLRsearch is minimizing the total test duration and searching for
   multiple packet throughput rates (each with a corresponding PLR)
   concurrently, instead of doing it sequentially.

   The main motivation behind MLRsearch is the new set of challenges and
   requirements posed by NFV (Network Function Virtualization),
   specifically software based implementations of NFV data planes.
   Using [RFC2544] in the experience of the authors yields often not
   repetitive and not replicable end results due to a large number of
   factors that are out of scope for this draft.  MLRsearch aims to
   address this challenge in a simple way of getting the same result
   sooner, so more repetitions can be done to describe the
   replicability.

                                                                                  


The IETF Secretariat