Probabilistic Loss Ratio Search for Packet Throughput (PLRsearch)
draft-vpolak-plrsearch-00

Document Type Replaced Internet-Draft (individual)
Last updated 2018-10-23
Replaced by draft-vpolak-bmwg-plrsearch
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Replaced by draft-vpolak-bmwg-plrsearch
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-vpolak-plrsearch-00.txt

Abstract

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

Authors

Maciek Konstantynowicz (mkonstan@cisco.com)
Vratko Polak (vrpolak@cisco.com)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)