Repository : ssh://git@open-mesh.org/doc

On branches: backup-redmine/2019-09-17,master

commit 3053ce371150364835c9116d20ecd0b0e9617224 Author: Sven Eckelmann sven@narfation.org Date: Tue Sep 17 10:27:48 2019 +0000

doc: batman-adv/Network-wide-multi-link-optimization

3053ce371150364835c9116d20ecd0b0e9617224 .../Network-wide-multi-link-optimization.textile | 18 +++++++++--------- 1 file changed, 9 insertions(+), 9 deletions(-)

diff --git a/batman-adv/Network-wide-multi-link-optimization.textile b/batman-adv/Network-wide-multi-link-optimization.textile index 4ada8fb..b42b8e6 100644 --- a/batman-adv/Network-wide-multi-link-optimization.textile +++ b/batman-adv/Network-wide-multi-link-optimization.textile @@ -10,8 +10,8 @@ h2. Routing Table Per Interface

The main idea is to use n + 1 routing tables instead of just one, with n being the number of configured interfaces:

- * a routing table per incoming interface - * an additional 'default' routing table for packets generated locally (e.g. from the soft-interface) +* a routing table per incoming interface +* an additional 'default' routing table for packets generated locally (e.g. from the soft-interface)

The routing table is chosen based on the interface the packet entered the system by.

@@ -20,9 +20,9 @@ h2. OGM forwarding and penalties

To propagate different paths, the OGM forwarding is changed:

- * When there are multiple interfaces and an OGM is forwarded on the same interface, an additional penalty (e.g. "half duplex penalty) when re-forwarding the OGM on the same interface +* When there are multiple interfaces and an OGM is forwarded on the same interface, an additional penalty (e.g. "half duplex penalty) when re-forwarding the OGM on the same interface -> the metric with the *applied* penalty is stored locally - * apply the strict "forward only from best neighbor" per interface +* apply the strict "forward only from best neighbor" per interface

+Path Metric computation+ Each node, creates and sends its own OGMs to let all the other peers in the network build their routing table @@ -48,11 +48,11 @@ For example, consider the following illustration:

We consider all link qualities equal. What should happen according to the rules (after some OGMs):

- * OGMs from A are sent via A1 and A2 - * B applies the new penalty when forwarding packets from A1 again on B1, and also when forwarding from A2 on B2 - * therefore, As OGM received on B1 are only forwarded on B2 (because no penalty is applied here). They are not re-forwarded on B1 because for this interface, the packets received on B2 have a better quality. - * finally (assuming equal link qualities everywhere), the TQ values in the OGMs from A forwarded by B are equal too - but the internal routing table include the interface switching - * putting it all together and assuming the other nodes behave the same way: If a packet is sent by D on D1, it will follow the dashed path. If it is sent on D2, it will follow the solid path. The interface alternation was implemented by local routing table decisions but forwarded information (unlike the original local-only interface alternation). +* OGMs from A are sent via A1 and A2 +* B applies the new penalty when forwarding packets from A1 again on B1, and also when forwarding from A2 on B2 +* therefore, As OGM received on B1 are only forwarded on B2 (because no penalty is applied here). They are not re-forwarded on B1 because for this interface, the packets received on B2 have a better quality. +* finally (assuming equal link qualities everywhere), the TQ values in the OGMs from A forwarded by B are equal too - but the internal routing table include the interface switching +* putting it all together and assuming the other nodes behave the same way: If a packet is sent by D on D1, it will follow the dashed path. If it is sent on D2, it will follow the solid path. The interface alternation was implemented by local routing table decisions but forwarded information (unlike the original local-only interface alternation).

h3. Another example: path diversity