X-Git-Url: https://gerrit.fd.io/r/gitweb?a=blobdiff_plain;f=docs%2Fcontent%2Fmethodology%2Fmeasurements%2Fdata_plane_throughput%2Fplr_search.md;fp=docs%2Fcontent%2Fmethodology%2Fdata_plane_throughput%2Fplrsearch.md;h=529bac1f7ff9a2ebdd3f642bd3b8fa6320c8e461;hb=374954b9d648f503f6783325a1266457953a998d;hp=1facccc63b545d88c6be476f3289485fa93a051c;hpb=46eac7bb697e8261dba5b439a15f5a6125f31760;p=csit.git

diff --git a/docs/content/methodology/data_plane_throughput/plrsearch.md b/docs/content/methodology/measurements/data_plane_throughput/plr_search.md
similarity index 94%
rename from docs/content/methodology/data_plane_throughput/plrsearch.md
rename to docs/content/methodology/measurements/data_plane_throughput/plr_search.md
index 1facccc63b..529bac1f7f 100644
--- a/docs/content/methodology/data_plane_throughput/plrsearch.md
+++ b/docs/content/methodology/measurements/data_plane_throughput/plr_search.md
@@ -1,17 +1,17 @@
 ---
-title: "PLRsearch"
+title: "PLR Search"
 weight: 3
 ---
 
-# PLRsearch
+# PLR Search
 
 ## Motivation for PLRsearch
 
 Network providers are interested in throughput a system can sustain.
 
-`RFC 2544`[^3] assumes loss ratio is given by a deterministic function of
+`RFC 2544`[^1] assumes loss ratio is given by a deterministic function of
 offered load. But NFV software systems are not deterministic enough.
-This makes deterministic algorithms (such as `binary search`[^9] per RFC 2544
+This makes deterministic algorithms (such as `binary search`[^2] per RFC 2544
 and MLRsearch with single trial) to return results,
 which when repeated show relatively high standard deviation,
 thus making it harder to tell what "the throughput" actually is.
@@ -21,8 +21,9 @@ We need another algorithm, which takes this indeterminism into account.
 ## Generic Algorithm
 
 Detailed description of the PLRsearch algorithm is included in the IETF
-draft `draft-vpolak-bmwg-plrsearch-02`[^1] that is in the process
-of being standardized in the IETF Benchmarking Methodology Working Group (BMWG).
+draft `Probabilistic Loss Ratio Search for Packet Throughput`[^3] that is in the
+process of being standardized in the IETF Benchmarking Methodology Working Group
+(BMWG).
 
 ### Terms
 
@@ -372,12 +373,11 @@ or is it better to have short periods of medium losses
 mixed with long periods of zero losses (as happens in Vhost test)
 with the same overall loss ratio?
 
-[^1]: [draft-vpolak-bmwg-plrsearch-02](https://tools.ietf.org/html/draft-vpolak-bmwg-plrsearch-02)
-[^2]: [plrsearch draft](https://tools.ietf.org/html/draft-vpolak-bmwg-plrsearch-00)
-[^3]: [RFC 2544](https://tools.ietf.org/html/rfc2544)
+[^1]: [RFC 2544: Benchmarking Methodology for Network Interconnect Devices](https://tools.ietf.org/html/rfc2544)
+[^2]: [Binary search](https://en.wikipedia.org/wiki/Binary_search_algorithm)
+[^3]: [Probabilistic Loss Ratio Search for Packet Throughput](https://tools.ietf.org/html/draft-vpolak-bmwg-plrsearch-02)
 [^4]: [Lomax distribution](https://en.wikipedia.org/wiki/Lomax_distribution)
-[^5]: [reciprocal distribution](https://en.wikipedia.org/wiki/Reciprocal_distribution)
+[^5]: [Reciprocal distribution](https://en.wikipedia.org/wiki/Reciprocal_distribution)
 [^6]: [Monte Carlo](https://en.wikipedia.org/wiki/Monte_Carlo_integration)
-[^7]: [importance sampling](https://en.wikipedia.org/wiki/Importance_sampling)
-[^8]: [bivariate Gaussian](https://en.wikipedia.org/wiki/Multivariate_normal_distribution)
-[^9]: [binary search](https://en.wikipedia.org/wiki/Binary_search_algorithm)
\ No newline at end of file
+[^7]: [Importance sampling](https://en.wikipedia.org/wiki/Importance_sampling)
+[^8]: [Bivariate Gaussian](https://en.wikipedia.org/wiki/Multivariate_normal_distribution)