COMPUTER - COMMUNICATION

LAB - ASSESSMENT = 02

Programme B.Tech-ECE Semester WINTER-(2019-20)

Name Pranav Kumar Course Code ECE4008

REG-NO. 17BEC0473 Slot L29+L30

Faculty Prof. Nandakumar S Max. Marks 10

 Experiment - 02
Application of Spanning Tree Algorithm.

# Aim:- To construct and simulate Network model and

applying Spanning Tree algorithm to get the path with the least
cost and to view the spanning tree to determine the root,
designated and blocked ports.

# Tools Required:- NetSim Academic Software

# Theory:- The Spanning Tree Protocol (STP) is a network

protocol that builds a loop-free logical topology for Ethernet networks.
The basic function of STP is to prevent bridge loops and the broadcast
radiation that results from them. Spanning tree also allows a network
design to include backup links providing fault tolerance if an active link
fails.
As the name suggests, STP creates a spanning tree that characterizes
the relationship of nodes within a network of connected layer-2 bridges,
and disables those links that are not part of the spanning tree, leaving a
single active path between any two network nodes.
# Block Diagram:-
1. Scenario -1 (Equal-Priority) - (Finding Root Bridge and
Blocked Ports):-

# Analysis:-
1. Switch-E
(Interface-1)
MAC-Address:- 577329913ED9
Switch-ID:- 13C3E862DCB12

(Interface-2)
MAC-Address:- B16938E042C9
Switch-ID:- 13C3E862DCB12
 (Interface-3)
MAC-Address:- 3C3E862DCB12
Switch-ID:- 13C3E862DCB12

2. Switch-F
(Interface-1)
MAC-Address:- A4434A1734C1
Switch-ID:- 17F30F5A4BD32

(Interface-2)
MAC-Address:- 8142FBC23BF9
Switch-ID:- 17F30F5A4BD32

(Interface-3)
MAC-Address:- 7F30F5A4BD32
Switch-ID:- 17F30F5A4BD32

3. Switch-G
(Interface-1)
MAC-Address:- 83432591751A
Switch-ID:- 17F83BBF86325

(Interface-2)
MAC-Address:- A5F8785B4CA7
Switch-ID:- 17F83BBF86325

(Interface-3)
MAC-Address:- 7F83BBF86325
Switch-ID:- 17F83BBF86325
 4. Switch-H (ROOT-BRIDGE)
(Interface-1)
MAC-Address:- 2283C62CCDC0
Switch-ID:- 1207EDBE75EC6
(Interface-2)
MAC-Address:- 207EDBE75EC6
Switch-ID:- 1207EDBE75EC6
(Interface-3)
MAC-Address:- E74138F71810F
Switch-ID:- 1207EDBE75EC6
From the above Switches , Switch-H is assigned as the Root Switch
because it’s interface (Interface-2) has least MAC-Address and
corresponding Switch-ID.
Hence, the corresponding blocked ports are shown below:-
i.e., the corresponding blocked ports are coming in Switch-E and
Switch-G.

2. Block-Diagram (Spanning-Tree Diagram with Blocked Ports)

Scenario -2 (Unequal-Priority) - (Finding Root Bridge and
Blocked Ports):-

# Analysis:-
1. Switch-E (Root-Switch) (STP Cost = 19 , Speed = 100 Mbps)

Interface Priority MAC-Address (1st

four bits)
I1 1 87A4
I2 1 51F9 (least)
I3 1 B298
 2. Switch-F (STP Cost = 19 , Speed = 100 Mbps)
Interface Priority MAC-Address (1st
four bits)
I1 2 4AB2 (least)
I2 2 64AE
I3 2 D6A5

3. Switch-G (STP Cost = 19 , Speed = 100 Mbps)

Interface Priority MAC-Address (1st
four bits)
I1 3 418C (least)
I2 3 7A86
I3 3 A50F

4. Switch-H (STP Cost = 19 , Speed = 100 Mbps)

Interface Priority MAC-Address (1st
four bits)
I1 4 5DCF (least)
I2 4 C1E3
I3 4 80C0

From the above Switches , Switch-E is assigned as the Root Switch

because it’s interface (Interface-2) has least priority and MAC-
Address among all the 4 switches.
Hence, the corresponding blocked ports are coming in Switch-G and
Switch-H.
 3. Block-Diagram (Spanning-Tree Diagram with Blocked Ports)
Scenario -3 (Unequal-Priority) - (Finding Root Bridge and
Blocked Ports):-

(All links’ STP Cost = 19 , Speed = 100 Mbps)

Similarly , it is found that Switch-H is coming to be the Root Switch

because it’s interface has least priority and MAC-Address among all
the 4 switches.
Hence, the corresponding blocked ports are coming in Switch-E and
Switch-G.
4. Block-Diagram (Spanning-Tree Diagram with Blocked Ports)
Scenario -4 (Unequal Link Cost) - (Finding Root Bridge and
Blocked Ports):-

➔ (Between Switch-E and Switch-F , between Switch-F and

Switch-H , between Switch-G and Switch-H)

STP Cost = 19 , Speed = 100 Mbps

➔ (Between Switch-E and Switch-G)

STP Cost = 4 (i.e., for link cost = 15) , Speed = 1000 Mbps
Similarly , it is found that Switch-H is coming to be the Root Switch
because it’s interface has least priority and MAC-Address among all
the 4 switches.
Hence, the corresponding blocked ports are coming in Switch-E and
Switch-F.
5. Block-Diagram (Spanning-Tree Diagram with Blocked Ports)
Scenario -5 (Equal Link/LAN Cost) - (Finding Root Bridge and
Blocked Ports):-
# Analysis:-
(All LAN’s/Links’ STP Cost = 19 , Speed = 100 Mbps)

1. LS1 (LAN)
MAC-Address:- 807B58F9E069F
2. LS2 (LAN)
MAC-Address:- 80AD7B51B40F9
3. LS3 (LAN)
MAC-Address:- 80D52D0E3474E
4. LS4 (LAN)
MAC-Address:- 8279A9A91C822
5. LS5 (LAN)
MAC-Address:- 83BA9A687639F
6. LS6 (LAN)
MAC-Address:- 8006B400BD863

1. B1 (Bridge)
MAC-Address:- 10D8F2E2D9751
2. B2 (Bridge)
MAC-Address:- 28533F1369C3F
3. B3 (Bridge)
MAC-Address:- 325A35750724F
4. B4 (Bridge)
MAC-Address:- 44DF0D5912A4B
5. B5 (Bridge)
MAC-Address:- 5341B77E73D1C
6. B6 (Bridge)
MAC-Address:- 66E56136777BE
7. B7 (Bridge)
MAC-Address:- 73FACB3C0FFD6
All the LAN Switches are assigned the Priority = 8 starting from LS1
to LS6. And the intermediate switches (Bridges) are assigned Priority
as:- B1 = 1, B2 = 2, B3 = 3, B4 = 4, B5 = 5, B6 = 6 and B7 = 7
respectively.
# Spanning-Tree Table:-
Name Switch-ID Interface-ID Role Status Cost
LS1 807B58F9E069F 3 DESG FORWARDING 19

LS1 807B58F9E069F 4 DESG FORWARDING 19

LS3 80D52D0E3474E 1 ALTN BLOCKED 19

LS3 80D52D0E3474E 2 DESG FORWARDING 19

LS3 80D52D0E3474E 5 DESG FORWARDING 19

LS3 80D52D0E3474E 6 DESG FORWARDING 19

LS3 80D52D0E3474E 7 DESG FORWARDING 19

LS5 83BA9A687639F 1 DESG FORWARDING 95

LS4 8279A9A91C822 1 ALTN BLOCKED 57

LS4 8279A9A91C822 2 DESG FORWARDING 57

LS4 8279A9A91C822 3 ALTN BLOCKED 57

LS4 8279A9A91C822 6 DESG FORWARDING 57

B6 66E56136777BE 1 DESG FORWARDING 76

B6 66E56136777BE 2 DESG FORWARDING 76

B2 28533F1369C3F 1 DESG FORWARDING 38

B2 28533F1369C3F 2 ALTN BLOCKED 38

B1 10D8F2E2D9751 1 Root FORWARDING 0

B1 10D8F2E2D9751 2 Root FORWARDING 0

B1 10D8F2E2D9751 3 Root FORWARDING 0

Name Switch-ID Interface-ID Role Status Cost
LS2 80AD7B51B40F9 3 DESG FORWARDING 19

LS2 80AD7B51B40F9 4 DESG FORWARDING 19

B7 73FACB3C0FFD6 1 DESG FORWARDING 38

B7 73FACB3C0FFD6 2 ALTN BLOCKED 38

LS6 8006B400BD863 1 ALTN BLOCKED 57

LS6 8006B400BD863 4 DESG FORWARDING 57

B4 44DF0D5912A4B 1 DESG FORWARDING 38

B4 44DF0D5912A4B 2 ALTN BLOCKED 38

B3 325A35750724F 1 DESG FORWARDING 38

B3 325A35750724F 2 DESG FORWARDING 38

B5 5341B77E73D1C 1 DESG FORWARDING 38

B5 5341B77E73D1C 2 ALTN BLOCKED 38

B5 5341B77E73D1C 3 DESG FORWARDING 38

From the above Scenario , B1 is assigned as the Root Bridge because it

has the least priority and MAC-Address among all the 7 bridges and 6
LAN Switches.
Hence, the corresponding blocked ports are as follows:-
Between LS1-LS3 :- B2-P2(Port)
Between LS2-LS6 :- B7-P2
Between LS3-LS4 :- B4-P2 and B5-P3
6. Block-Diagram (Spanning-Tree Diagram with Blocked Ports)
Scenario -6 (Unequal Link/LAN Cost) - (Finding Root Bridge
and Blocked Ports):-
# Analysis:-
➔ For LAN-1, LAN-3 and LAN-5 (Gigabit-Ethernets)
STP Cost = 4 (i.e., for LAN cost = 15) , Speed = 1000 Mbps

➔ For LAN-2, LAN-4 and LAN-6 (Fast-Ethernets)

STP Cost = 19 , Speed = 100 Mbps

1. LS1 (LAN)
MAC-Address:- 807B58F9E069F
2. LS2 (LAN)
MAC-Address:- 80AD7B51B40F9
3. LS3 (LAN)
MAC-Address:- 80D52D0E3474E
4. LS4 (LAN)
MAC-Address:- 8279A9A91C822
5. LS5 (LAN)
MAC-Address:- 83BA9A687639F
6. LS6 (LAN)
MAC-Address:- 8006B400BD863

1. B1 (Bridge)
MAC-Address:- 10D8F2E2D9751
2. B2 (Bridge)
MAC-Address:- 28533F1369C3F
3. B3 (Bridge)
MAC-Address:- 325A35750724F
4. B4 (Bridge)
MAC-Address:- 44DF0D5912A4B
5. B5 (Bridge)
MAC-Address:- 5341B77E73D1C
 6. B6 (Bridge)
MAC-Address:- 66E56136777BE
7. B7 (Bridge)
MAC-Address:- 73FACB3C0FFD6
All the LAN Switches are assigned the Priority = 8 starting from LS1
to LS6. And the intermediate switches (Bridges) are assigned Priority
as:- B1 = 1, B2 = 2, B3 = 3, B4 = 4, B5 = 5, B6 = 6 and B7 = 7
respectively.

# Spanning-Tree Table:-
Name Switch-ID Interface-ID Role Status Cost
LS1 807B58F9E069F 3 DESG FORWARDING 19

LS1 807B58F9E069F 4 DESG FORWARDING 19

LS3 80D52D0E3474E 1 ALTN BLOCKED 19

LS3 80D52D0E3474E 2 DESG FORWARDING 19

LS3 80D52D0E3474E 5 DESG FORWARDING 19

LS3 80D52D0E3474E 6 DESG FORWARDING 19

LS3 80D52D0E3474E 7 DESG FORWARDING 19

LS5 83BA9A687639F 1 DESG FORWARDING 80

LS4 8279A9A91C822 1 ALTN BLOCKED 42

LS4 8279A9A91C822 2 DESG FORWARDING 42

LS4 8279A9A91C822 3 ALTN BLOCKED 42

LS4 8279A9A91C822 6 DESG FORWARDING 42

B6 66E56136777BE 1 DESG FORWARDING 61

B6 66E56136777BE 2 DESG FORWARDING 61

Name Switch-ID Interface-ID Role Status Cost
B2 28533F1369C3F 1 DESG FORWARDING 23

B2 28533F1369C3F 2 ALTN BLOCKED 23

B1 10D8F2E2D9751 1 Root FORWARDING 0

B1 10D8F2E2D9751 2 Root FORWARDING 0

B1 10D8F2E2D9751 3 Root FORWARDING 0

LS2 80AD7B51B40F9 3 DESG FORWARDING 19

LS2 80AD7B51B40F9 4 DESG FORWARDING 19

B7 73FACB3C0FFD6 1 DESG FORWARDING 38

B7 73FACB3C0FFD6 2 ALTN BLOCKED 38

LS6 8006B400BD863 1 ALTN BLOCKED 42

LS6 8006B400BD863 4 DESG FORWARDING 42

B4 44DF0D5912A4B 1 DESG FORWARDING 23

B4 44DF0D5912A4B 2 ALTN BLOCKED 23

B3 325A35750724F 1 DESG FORWARDING 23

B3 325A35750724F 2 DESG FORWARDING 23

B5 5341B77E73D1C 1 DESG FORWARDING 23

B5 5341B77E73D1C 2 ALTN BLOCKED 23

B5 5341B77E73D1C 3 DESG FORWARDING 23

From the above Scenario , B1 is assigned as the Root Bridge because it

has the least priority and MAC-Address among all the 7 bridges and 6
LAN Switches.
Hence, the corresponding blocked ports are as follows:-
Between LS1-LS3 :- B2-P2(Port)
Between LS2-LS6 :- B7-P2
Between LS3-LS4 :- B4-P2 and B5-P3

# Inference:- Hence the Spanning Tree Algorithm has been

successfully implemented for the given network which gives the shortest
route from all the different bridges to the root bridge and hence it avoids
the chance of looping problem in a network . The blocked ports will not
be used.

1. The bridge with minimum Switch-ID has been chosen as the root
bridge.
2. The manually calculated Spanning Tree and Spanning Tree
compiled by NetSim are the same.
3. The use of Spanning Tree has made sure that looping is avoided
while calculating the minimum cost path.

# Conclusion:- Hence, the network model for all the 6 scenarios have
been simulated in the software and the corresponding Spanning Tree
has been analyzed to determine the Root Bridge , Root Ports ,
Designated Bridges , Designated Ports and Blocked Ports.