I-D Action: draft-vpolak-mkonstan-mlrsearch-00.txt

internet-drafts@ietf.org Tue, 23 October 2018 16:18 UTC

Return-Path: <internet-drafts@ietf.org>
X-Original-To: i-d-announce@ietf.org
Delivered-To: i-d-announce@ietfa.amsl.com
Received: from ietfa.amsl.com (localhost [IPv6:::1]) by ietfa.amsl.com (Postfix) with ESMTP id AF356130E69 for <i-d-announce@ietf.org>; Tue, 23 Oct 2018 09:18:13 -0700 (PDT)
MIME-Version: 1.0
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: 7bit
From: internet-drafts@ietf.org
To: i-d-announce@ietf.org
Subject: I-D Action: draft-vpolak-mkonstan-mlrsearch-00.txt
X-Test-IDTracker: no
X-IETF-IDTracker: 6.87.1
Auto-Submitted: auto-generated
Precedence: bulk
Message-ID: <154031149369.31305.3330885185234998707@ietfa.amsl.com>
Date: Tue, 23 Oct 2018 09:18:13 -0700
Archived-At: <https://mailarchive.ietf.org/arch/msg/i-d-announce/ESEdKqo6EYpzXBwRgpClmEFUjOs>
X-BeenThere: i-d-announce@ietf.org
X-Mailman-Version: 2.1.29
List-Id: Internet Draft Announcements only <i-d-announce.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/i-d-announce>, <mailto:i-d-announce-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/i-d-announce/>
List-Post: <mailto:i-d-announce@ietf.org>
List-Help: <mailto:i-d-announce-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/i-d-announce>, <mailto:i-d-announce-request@ietf.org?subject=subscribe>
X-List-Received-Date: Tue, 23 Oct 2018 16:18:14 -0000

A New Internet-Draft is available from the on-line Internet-Drafts directories.


        Title           : Multiple Loss Ratio Search for Packet Throughput (MLRsearch)
        Authors         : Maciek Konstantynowicz
                          Vratko Polak
	Filename        : draft-vpolak-mkonstan-mlrsearch-00.txt
	Pages           : 10
	Date            : 2018-10-23

Abstract:
   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
   MLSsearch 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 chalenge and define a common (standard?) way to evaluate
   NFV packet throughput performance that takes into account varying
   characteristics of NFV systems under test.


The IETF datatracker status page for this draft is:
https://datatracker.ietf.org/doc/draft-vpolak-mkonstan-mlrsearch/

There are also htmlized versions available at:
https://tools.ietf.org/html/draft-vpolak-mkonstan-mlrsearch-00
https://datatracker.ietf.org/doc/html/draft-vpolak-mkonstan-mlrsearch-00


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.

Internet-Drafts are also available by anonymous FTP at:
ftp://ftp.ietf.org/internet-drafts/