Probabilistic Loss Ratio Search for Packet Throughput (PLRsearch)
draft-vpolak-plrsearch-00
| Document | Type |
Replaced Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Maciek Konstantynowicz , Vratko Polák | ||
| Last updated | 2018-10-23 | ||
| Replaced by | draft-vpolak-bmwg-plrsearch | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Replaced by draft-vpolak-bmwg-plrsearch | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
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
Vratko Polák
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)