Probabilistic Loss Ratio Search for Packet Throughput (PLRsearch)
draft-vpolak-bmwg-plrsearch-03
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Authors | Maciek Konstantynowicz , Vratko Polak | ||
| Last updated | 2020-09-07 (latest revision 2020-03-06) | ||
| Replaces | draft-vpolak-plrsearch | ||
| Stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
pdf
htmlized (tools)
htmlized
bibtex
|
||
| Stream | Stream state | (No stream defined) | |
| Consensus Boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | |||
| Responsible AD | (None) | ||
| Send notices to | (None) | ||
https://www.ietf.org/archive/id/draft-vpolak-bmwg-plrsearch-03.txt
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.
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.)