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

On branches: backup-redmine/2017-07-13,master

commit f9cb8f77242621ae7a96f891a35312f8c5515445 Author: Simon Wunderlich sw@simonwunderlich.de Date: Sat Mar 26 18:11:58 2011 +0000

doc: open-mesh/Routing_scenarios

f9cb8f77242621ae7a96f891a35312f8c5515445 open-mesh/Routing_scenarios.textile | 62 +++++++++++++++++++++++-------------- 1 file changed, 38 insertions(+), 24 deletions(-)

diff --git a/open-mesh/Routing_scenarios.textile b/open-mesh/Routing_scenarios.textile index e6bd3c55..105b0ab2 100644 --- a/open-mesh/Routing_scenarios.textile +++ b/open-mesh/Routing_scenarios.textile @@ -1,55 +1,69 @@ -= Routing scenarios = - -{{{ -#!div style="width: 46em; text-align: justify" +h1. Routing scenarios

This page contains a collection of routing scenarios which all routing protocol changes have to go through to estimate its impact.

-=== Best route === +h2. Best route + + + +h3. Asymmetric link

-==== Asymmetric link ====

The nodes A, B and C are connected via asymmetric links - every node has a good transmit connection to one neighbor and a good receiving connection from the other. The protocol has to detect that the best neighbor towards any destination is the one it rarely gets routing information from.

-[[Image(wiki:routing_scenarios:asym_link.png, 70%25)]] +!asym_link.png! + + +h3. Asymmetric path

-==== Asymmetric path ====

Node A and B are connected via multiple paths with different characteristics: a short asymmetric path and a long path without packet loss. The protocol should choose the long path for traffic traveling from A to B and the short path in the opposite direction.

-[[Image(wiki:routing_scenarios:asym_path.png, 100%25)]] +!asym_path.png! + + +h2. Convergence speed

-=== Convergence speed ===

A and B have 2 possible paths to communicate with each other. One of the nodes that is part of the currently used path dies or one of the links breaks down and the protocol needs to detect the unavailability of the path to switch as fast as possible to the other one.

-==== The triangle ====

-[[Image(wiki:routing_scenarios:triangle.png, 70%25)]] +h3. The triangle + + +!triangle.png!

-==== The circle ====

-[[Image(wiki:routing_scenarios:circle.png, 100%25)]] +h3. The circle

-==== The bottle ====

+!circle.png!

-[[Image(wiki:routing_scenarios:bottle.png, 100%25)]]

-=== Mobility === +h3. The bottle + +!bottle.png! + + +h2. Mobility +

While A is moving through the mesh the route between A and B shall recover as fast as possible.

-==== New neighbor ====

-[[Image(wiki:routing_scenarios:new_neigh.png, 100%25)]] +h3. New neighbor + + +!new_neigh.png! + + +h3. New distant neighbor +

-==== New distant neighbor ==== +!new_dist_neigh.png!

-[[Image(wiki:routing_scenarios:new_dist_neigh.png, 100%25)]]

-==== Mobile Node ==== +h3. Mobile Node

-[[Image(wiki:routing_scenarios:mob_node.png, 100%25)]]

-}}} +!mob_node.png!