Repository : ssh://git@open-mesh.org/doc
On branches: backup-redmine/2019-09-17,master
commit 136f795e074d9b3f32d90cbc95dbdf9ed0125e59 Author: Sven Eckelmann sven@narfation.org Date: Tue Sep 17 10:22:21 2019 +0000
doc: batman-adv/Broadcast-Avoidances-NHH-Assessment
136f795e074d9b3f32d90cbc95dbdf9ed0125e59 .../Broadcast-Avoidances-NHH-Assessment.textile | 42 +++++++++++----------- 1 file changed, 21 insertions(+), 21 deletions(-)
diff --git a/batman-adv/Broadcast-Avoidances-NHH-Assessment.textile b/batman-adv/Broadcast-Avoidances-NHH-Assessment.textile index 529a595..d948596 100644 --- a/batman-adv/Broadcast-Avoidances-NHH-Assessment.textile +++ b/batman-adv/Broadcast-Avoidances-NHH-Assessment.textile @@ -105,9 +105,9 @@ h3. Simplification
Instead of performing all the checks described above, the modified rules are used in the implementation with the following goals:
- * Less information to exchange - * Less computational overhead - * Supposed to work even with large neighborhoods +* Less information to exchange +* Less computational overhead +* Supposed to work even with large neighborhoods
Performing the checks stated above has the following disadvantages: For one thing, the computational overhead could be significant for neighborhoods of a certain size. For another, B does not even know the throughput from A to B or A to C (or C to A or C to B - we will see later why we might need those). B only knows its own TX throughput towards other neighbors and not the other way around.
@@ -125,13 +125,13 @@ h4. Proof: Ingress TX (bcast)
We want to proof:
- * p(Amax) < Amin => p(AB) < ACn for any Cn. +* p(Amax) < Amin => p(AB) < ACn for any Cn.
One has:
- * a ≤ b => p(a) ≤ p(b) - * AB ≤ Amax - * Amin ≤ ACn +* a ≤ b => p(a) ≤ p(b) +* AB ≤ Amax +* Amin ≤ ACn
<pre> AB ≤ Amax @@ -148,13 +148,13 @@ h4. Proof: Egress TX (bcast)
We want to proof:
- * p(Bmax) < Amin => p(BCn) < ACn +* p(Bmax) < Amin => p(BCn) < ACn
One has:
- * a ≤ b => p(a) ≤ p(b) - * BCn ≤ Bmax - * Amin ≤ ACn +* a ≤ b => p(a) ≤ p(b) +* BCn ≤ Bmax +* Amin ≤ ACn
<pre> BCn ≤ Bmax @@ -171,12 +171,12 @@ h4. Proof: Ingress RX (OGM2)
We want to proof:
- * p(AB) < MIN<code></code>(Amin, Cn-min) => p(AB) < CnA for any Cn. +* p(AB) < MIN<code></code>(Amin, Cn-min) => p(AB) < CnA for any Cn.
One has:
- * MIN<code></code>(a, b) ≤ b - * Cn-min ≤ CnA +* MIN<code></code>(a, b) ≤ b +* Cn-min ≤ CnA
<pre> p(AB) < MIN(Amin, Cn-min) @@ -190,15 +190,15 @@ h4. Proof: Egress RX (OGM2)
We want to proof:
- * p(MAX<code></code>(Amax, Cn-max)) < MIN<code></code>(Amin, Cn-min) => p(AB) < CnA for any Cn. +* p(MAX<code></code>(Amax, Cn-max)) < MIN<code></code>(Amin, Cn-min) => p(AB) < CnA for any Cn.
One has:
- * a ≤ b => p(a) ≤ p(b) - * MIN<code></code>(a, b) ≤ b - * a ≤ MAX<code></code>(a, b) - * AB ≤ Amax - * Cn-min ≤ CnA +* a ≤ b => p(a) ≤ p(b) +* MIN<code></code>(a, b) ≤ b +* a ≤ MAX<code></code>(a, b) +* AB ≤ Amax +* Cn-min ≤ CnA
<pre> Amax ≤ MAX(Amax, Cn-max) @@ -222,4 +222,4 @@ This number of inputs would be reached if over 500 years a new neighborhood were
See also:
- * https://en.wikipedia.org/wiki/Birthday_attack \ No newline at end of file +* https://en.wikipedia.org/wiki/Birthday_attack \ No newline at end of file