Filter
Top Products
Shortest Path Tree
To build Router A’s shortest path tree for the network diagrammed below, Router A is put at the root of the tree and the smallest cost link to each destination
netw
ork is calculated.
Figur
e 6- 98.
Constructing a Shor
test Path Tree
The diagram above shows the network from the viewpoint of Router A.Router A can reach 192.213.11.0 through Router B with a cost of 10+5=15.Router A
can r
each 222.211.10.0 through Router C with a cost of 10+10=20.Router A can also reach 222.211.10.0 through Router B and Router D with a cost of
10+5+10=25,but the cost is higher than the route through Router C.This higher-cost route will not be included in the Router A’s shortest path tree.The
resulting tree will look like this:
104
Allied Telesyn AT-9724TS High-Density Layer 3 Stackable Gigabit Ethernet Switch
1357
9
11
2
4
6 8 10 12
13 15
14
16
17
19 21
23
18
20
22
24
25 27
26
28
29
31 33
35
30
32
34
36
1
357
9
11
2
4681012
13 15
14
16
17
19 21
23
18
20
22
24
25 27
26
28
29
31 33
35
30
32
34
36
1
357
9
11
2
4 6 8 10 12
13 15
14
16
17
19 21
23
18
20
22
24
25 27
26
28
29
31 33
35
30
32
34
36
1
357
9
11
2
4 6 8 10 12
13 15
14
16
17
19 21
23
18
20
22
24
25 27
26
28
29
31 33
35
30
32
34
36
Router A
Router
B
Router C
Router D
10
8
5
5
10
10
10
128.213.0.0
192.128.11.0
222.211.10.0
Router A
Rout
er B
Rout
er C
Router D
128.213.0.0
192.213.11.0
222.211.10.0
0
10
10
10
5
5
10