Skip to content

Commit

Permalink
theory
Browse files Browse the repository at this point in the history
  • Loading branch information
joelb123 committed Feb 11, 2024
1 parent c6d7b74 commit 1634635
Show file tree
Hide file tree
Showing 4 changed files with 9 additions and 9 deletions.
6 changes: 3 additions & 3 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -231,11 +231,11 @@ against four limits:
- In the updated state with per-server stats available, the
per-server queue depth must be less than the calculated critical
per-server queue depth $D_{{\rm crit}_j}$, as discussed
in the [theory section.]
in the [theoretical] section.
- In the updated state, the total queue depth must be less than
the saturation queue depth, $D_{\rm sat}$, at which the
current download bit rate $B_{\rm cur}$ saturates, as calculated
in the [theory] section.
in the [theoretical] section.

If any of the limits are exceeded, a stochastic wait period
at the inverse of the current per-server rate $k_j$ is added
Expand Down Expand Up @@ -306,7 +306,7 @@ _Flardl_ was written by Joel Berendzen.
[pypi]: https://pypi.org/
[file an issue]: https://github.com/hydrationdynamics/flardl/issues
[pip]: https://pip.pypa.io/
[theory]: https://github.com/hydrationdynamics/flardl/blob/main/THEORY.md
[theoretical]: https://github.com/hydrationdynamics/flardl/blob/main/THEORY.md

<!-- github-only -->

Expand Down
9 changes: 5 additions & 4 deletions THEORY.md
Original file line number Diff line number Diff line change
Expand Up @@ -41,13 +41,14 @@ expression are also difficult and overkill, when all we wish
is a crude estimate of the sweet spot in queue depth. A simple
heuristic can be found in the analogy of chemical kinetics where
distributed rates are common. In that situation, a well-known
trick is to use the depth where the double-exponential derivative
of bit-rate versus queue depth is maximized:
trick is to take the saturation depth as where the double-exponential
derivative of bit-rate $B$ versus average queue depth $\overline{D}$
is maximized:

$`
\begin{equation}
D_{\rm crit} = c \overbar{D} \backepsilon
\max{\frac{d(\log{B}}{d(\log{\overbar{D}})}}
D_{\rm sat} = c \overline{D} \backepsilon
\max{\frac{d(\log{B})}{d(\log{\overline{D}})}}
\end{equation}
`$

Expand Down
1 change: 1 addition & 0 deletions docs/index.md
Original file line number Diff line number Diff line change
Expand Up @@ -16,6 +16,7 @@ hidden:
maxdepth: 1
---
theory <theory>
reference
contributing
Funding <funding>
Expand Down
2 changes: 0 additions & 2 deletions docs/theory.md
Original file line number Diff line number Diff line change
Expand Up @@ -3,5 +3,3 @@
end-before: <!-- github-only -->
---
```

[theory]: theory

0 comments on commit 1634635

Please sign in to comment.