Size: 1220
Comment:
|
Size: 4156
Comment:
|
Deletions are marked like this. | Additions are marked like this. |
Line 13: | Line 13: |
=== Be Quick or Be Stable Test === To be performed on a subset of the nodes and repeated only 1x for each protocol {{{ +----+ | L1 |-----(A) : : : : : : (B) +----+ : r1 | : | : | : r2 | : | : +----+ (C)-----------| L2 | +----+ }}} * L1, L2: laptops * A, B, C: wireless nodes * link A-B uses association rate r1 * link A-C uses association rate r2 * r2 > r1 * - and | are cables * : are wireless links Steps: 1. perform a continuous traceroute (mtr or wathever) from L1 to L2 1. load the network with TCP (iperf or wathever) from L1 to L2 1. see how many times (if any) the route flaps in 21 minutes |
|
Line 15: | Line 47: |
To be performed on a subset of the nodes and repeated 3x for each protocol | |
Line 16: | Line 49: |
=== Be Quick or Be Stable Test === | {{{ +----+ | L1 |-----(A) : : : : : : (B) +----+ : x : : : x : : x : : : : : : (C) (E) | | +----+ (D) : : : : : : (F)-------| L2 | y +----+ }}} * L1, L2: laptops * A, B, C, E: nodes set on channel x * D, F: nodes set on channel y * - and | are cables * : are wireless links Steps: 1. load the network with TCP (iperf or wathever) from L1 to L2 1. sleep for 3 minutes 1. perform a traceroute from L1 to L2 and see if the routing protocol chooses the best route (L1->A->C->D->F->L2) |
Line 23: | Line 81: |
{{{ .~.~.~.~.~.~.~.~.~.~.~. (A) : ( ) ( ) ( ) ( (N) ) ( ) ( ) ( ) : (B) ( MESH CLOUD ) .~.~.~.~.~.~.~.~.~.~.~.~. }}} |
|
Line 26: | Line 97: |
1. has good quality links with its neighbors (possibly more than one) 1. if shut down the network does not split |
a. has good quality links with its neighbors (possibly more than one) a. if shut down the network does not split |
Line 34: | Line 105: |
1. start a continuous traceroute (e.g. mtr) from node ''A'' to node ''B'' | 1. start a continuous traceroute (mtr or wathever) from node ''A'' to node ''B'' |
Line 36: | Line 107: |
1. measure the time needed to get the node N (back) into the traceroute | 1. measure the time needed to get the node ''N'' (back) into the traceroute |
Line 40: | Line 111: |
{{{ +----+ .~.~.~.~.~.~.~.~.~.~.~. +----+ | L1 |-----(A) : ( ) : (C)-----| L3 | +----+ ( ) +----+ ( ) ( MESH ) ( CLOUD ) +----+ ( ) +----+ | L4 |-----(D) : ( ) : (B)-----| L2 | +----+ ( ) +----+ .~.~.~.~.~.~.~.~.~.~.~.~. }}} * L1, L2, L3, L4: laptops * A, B, C, D: edge wireless nodes Steps: 1. start, at the same time: a. a TCP stream between L1 to L2 a. a TCP stream between L3 to L4 a. a stopwatch 1. sleep for 21 minutes 1. measure the total number of bytes transferred |
BattleMeshV5 Tests
Contents
General Rules
- routing protocol configuration shall be the same for every test
- routing protocols are tested in turn (i.e. not altogether)
- cpu and memory consumption will be tracked during each test
- no points, just results and a final analysis
Tests
Be Quick or Be Stable Test
To be performed on a subset of the nodes and repeated only 1x for each protocol
+----+ | L1 |-----(A) : : : : : : (B) +----+ : r1 | : | : | : r2 | : | : +----+ (C)-----------| L2 | +----+
- L1, L2: laptops
- A, B, C: wireless nodes
- link A-B uses association rate r1
- link A-C uses association rate r2
r2 > r1
- - and | are cables
- : are wireless links
Steps:
- perform a continuous traceroute (mtr or wathever) from L1 to L2
- load the network with TCP (iperf or wathever) from L1 to L2
- see how many times (if any) the route flaps in 21 minutes
The ZooBab Test
To be performed on a subset of the nodes and repeated 3x for each protocol
+----+ | L1 |-----(A) : : : : : : (B) +----+ : x : : : x : : x : : : : : : (C) (E) | | +----+ (D) : : : : : : (F)-------| L2 | y +----+
- L1, L2: laptops
- A, B, C, E: nodes set on channel x
- D, F: nodes set on channel y
- - and | are cables
- : are wireless links
Steps:
- load the network with TCP (iperf or wathever) from L1 to L2
- sleep for 3 minutes
perform a traceroute from L1 to L2 and see if the routing protocol chooses the best route (L1->A->C->D->F->L2)
Convergence Time Test
To be performed on the whole mesh and repeated 3x for each protocol
.~.~.~.~.~.~.~.~.~.~.~. (A) : ( ) ( ) ( ) ( (N) ) ( ) ( ) ( ) : (B) ( MESH CLOUD ) .~.~.~.~.~.~.~.~.~.~.~.~.
Part 1
traceroute from one end (node A) to the other (node B) of the mesh until the path is stable
find a critical node N in the path so that
- has good quality links with its neighbors (possibly more than one)
- if shut down the network does not split
start a ping from A to B
turn off N
- count the number of pings from the first lost ping to the first subsequent successful ping
Part 2
start a continuous traceroute (mtr or wathever) from node A to node B
turn back on node N and start a stopwatch
measure the time needed to get the node N (back) into the traceroute
Don't Cross the Streams Test
+----+ .~.~.~.~.~.~.~.~.~.~.~. +----+ | L1 |-----(A) : ( ) : (C)-----| L3 | +----+ ( ) +----+ ( ) ( MESH ) ( CLOUD ) +----+ ( ) +----+ | L4 |-----(D) : ( ) : (B)-----| L2 | +----+ ( ) +----+ .~.~.~.~.~.~.~.~.~.~.~.~.
- L1, L2, L3, L4: laptops
- A, B, C, D: edge wireless nodes
Steps:
- start, at the same time:
- a TCP stream between L1 to L2
- a TCP stream between L3 to L4
- a stopwatch
- sleep for 21 minutes
- measure the total number of bytes transferred