Name:Nithish Srinivasan Reg No: 21BEC0227
Exp 1- Internconnecting Devices
Design & simulate the LAN and analyse the performance with the following
environment.
Number of Nodes = 12
Number of application configured = 6
Central Controlling Device: Hub and Switch
Case 1:
For default values- 1460 bytes and 20000 microseconds
Case 2:
For Inter-arrival time of 1000 microseconds
Aim:
To create the given scenario and analyze the performance of a set of LANs
interconnected by switches and hubs with different inter-arrival time
Tools Required:
NetSim v9.1
Theory:
Hub:
Switch:
Network Diagram:
Name:Nithish Srinivasan Reg No: 21BEC0227
Important Formulae
Payload Received = Packet Received * Packet Size
𝑃𝑎𝑦𝑙𝑜𝑎𝑑 𝑅𝑒𝑐𝑒𝑖𝑣𝑒𝑑∗8
Throughput (Mbps) =
𝑆𝑖𝑚𝑢𝑙𝑎𝑡𝑖𝑜𝑛 𝑇𝑖𝑚𝑒∗106
Case-1 - Default Value
(When Packet Size= 1460 bytes; Inter-arrival time= 20000 µs)
Hub (Complete Table)
Source Destination Packet Packet Payload Payload Throughput Delay
Id Id Transmitted Received Transmitted Received (Mbps) (microsec)
6 7 499 496 728540 724160 0.579328 6687.212903
4 5 499 498 728540 727080 0.581664 6649.008835
8 9 499 499 728540 728540 0.582832 6654.143487
10 11 499 498 728540 727080 0.581664 6647.881124
13 14 499 499 728540 728540 0.582832 6652.466533
2 3 499 498 728540 727080 0.581664 6651.643373
Sum= Sum=
3.489984 39942.35626
Switch (Complete Table)
Name:Nithish Srinivasan Reg No: 21BEC0227
Sourc Destinatio Packet Packet Payload Payload Throughpu Delay
e Id n Id Transmitte Receive Transmitte Received t (Mbps) (microsec
d d d )
2 3 499 499 728540 728540 0.582832 277.9513
4 5 499 499 728540 728540 0.582832 277.9513
6 7 499 499 728540 728540 0.582832 298.0434
8 9 499 499 728540 728540 0.582832 278.0148
10 11 499 499 728540 728540 0.582832 318.1124
12 13 499 499 728540 728540 0.582832 278.0417
Sum= Sum=
3.496992
1728.115
Hub and Switch Comparison
Component Total Throughput Delay (microsec) Packets Collided
(Mbps)
Hub 3.489984 39942.35626 3721
Switch 3.496992 1728.115 0
Thoughput (Mbps)
4.672
Throughput (Mbps)
4.67
4.668
4.666 Thoughput (Mbps)
4.664
4.662
Hub Switch
Name:Nithish Srinivasan Reg No: 21BEC0227
Delay (microsec)
80000
Delay (Microsec)
60000
40000
Delay (microsec)
20000
0
Hub Switch
Case-2
(When Packet Size=1460 bytes; Inter-arrival time=1000 µs)
Hub (Complete Table)
Source Destination Packet Packet Payload Payload Throughput Delay (microsec)
Id Id Transmitted Received Transmitted Received (Mbps)
6 7 9999 4278 14598540 6245880 4.996704 2873953
4 5 499 497 728540 725620 0.580496 20683.86
8 9 499 497 728540 725620 0.580496 21258.4
10 11 499 498 728540 727080 0.581664 23718.85
13 14 499 497 728540 725620 0.580496 21643.8
2 3 499 497 728540 725620 0.580496 18956.37
6 7 9999 4278 14598540 6245880 4.996704 2873953
SUM=7.900352 SUM=2980214
Switch (Complete Table)
Source Destination Packet Packet Payload Payload Throughput Delay
Id Id Transmitted Received Transmitted Received (Mbps) (microsec)
2 3 9999 9999 14598540 14598540 11.67883 421.9771
4 5 9999 9999 14598540 14598540 11.67883 421.9771
6 7 9999 9999 14598540 14598540 11.67883 403.7386
Name:Nithish Srinivasan Reg No: 21BEC0227
8 9 9999 9999 14598540 14598540 11.67883 519.1478
10 11 9999 9999 14598540 14598540 11.67883 443.901
12 13 9999 9999 14598540 14598540 11.67883 369.3136
2 3 9999 9999 14598540 14598540 11.67883 421.9771
SUM=70.07299 SUM=2580.055
Hub and Switch Comparison
Component Total Throughput Delay (sec) Packets Collided
(Mbps)
Hub 3426
7.900352 2980214
Switch 0
70.07299 2580.055
Thoughput(Mbps)
25
20
Throughput (Mbps)
15
Thoughput(Mbps)
10
0
Hub Switch
Name:Nithish Srinivasan Reg No: 21BEC0227
Delay (sec)
250
200
Delay (sec)
150
Delay (sec)
100
50
0
Hub Switch
Inference:
Name: Nithish Srinivasan Register Number:21BEC0227
Exp 2
Analyze and Compute the Spanning Tree for the extended LAN
Analyze and rectify the Spanning Tree for the extended LAN given below.
For the following bridged LAN, assume that LANs 1, 3, 5 and 7 are Gigabit
Ethernets (Cost=4) and the rest are Fast Ethernets (Cost=19). Switches
are labelled with S followed by their IDs. Compute and draw the spanning
tree and label the Root Switch, root ports, and designated ports.
A1(Source) - A2(Destination)
BECE401P/Lab/ WINTER SEM 2024-25 Page 1
Name: Nithish Srinivasan Register Number:21BEC0227
Aim:
To Compute the Spanning Tree for the given extended LAN and analyse the looping
problem
Tools Required:
Net Sim Software
Theory:
Tabulation of Port Address (Bridges)
Port ID Switch
Switch # Port Priority MAC Address (Priority + (Lowest in
MAC) Port ID)
1 P11 1 EFBE 1EFBE 1C8AD
P12 1 C8AD 1C8AD
2 P3 2 2AD7 22AD7 22AD7
P4 2 766B 2766B
P5 2 E064 2E064
P14 2 831D 2831D
3 P6 3 3F97 33F97 33F97
P7 3 D5CB 3D5CB
P8 3 A087 3A087
4 P9 4 F67E 4F67E 402EC
P10 4 6595 46595
P13 4 02EC 402EC
5 P1 5 AC94 5AC94 57684
P2 5 7684 57684
BECE401P/Lab/ WINTER SEM 2024-25 Page 2
Name: Nithish Srinivasan Register Number:21BEC0227
Manual Computation of Spanning Tree
BECE401P/Lab/ WINTER SEM 2024-25 Page 3
Name: Nithish Srinivasan Register Number:21BEC0227
Spanning Tree Diagram
Inference:
From the Spanning tree algorithm we are able to deduce the network Lan we don’t need to for 2
wires L2, L5 and L6
BECE401P/Lab/ WINTER SEM 2024-25 Page 4
Name: Nithish Srinivasan Register Number: 21BEC0227
Exp 2
Analyze and Compute the Spanning Tree for the extended LAN
Analyze and rectify the Spanning Tree for the extended LAN given below.
For the following Switched LAN, assume equal Cost. Switches are labelled
with S followed by their IDs (Priority +MAC address). Compute and draw
the spanning tree and label the Root Switch, root ports, and designated
ports.
A1(Source) - A2(Destination)
BECE401P/Lab/ WINTER SEM 2024-25 Page 1
Name: Nithish Srinivasan Register Number: 21BEC0227
Aim:
To Compute the Spanning Tree for the given extended LAN and analyse the looping
problem
Tools Required:
Net Sim Software
Theory:
Tabulation of Port Address (Bridges)
Port ID Switch
Switch # Port Priority MAC Address (Priority + (Lowest in
MAC) Port ID)
1 P1 1 4749 14749 14749
P2 1 1D8A 11D8A
P0 1 5239 15239
2 P3 2 E971 2 E971 21004
P4 2 BE3C 2 BE3C
P5 2 1004 21004
3 P6 3 4E11 34E11 3269B
P7 3 269B 3269B
P8 3 3B89 33B89
4 P9 4 3871 43871 42288
P10 4 2288 42288
P13 4 6DE4 46DE4
5 P11 5 8E76 58E76 58E76
P12 5 EDA7 5EDA7
5
BECE401P/Lab/ WINTER SEM 2024-25 Page 2
Name: Nithish Srinivasan Register Number: 21BEC0227
Manual Computation of Spanning Tree
BECE401P/Lab/ WINTER SEM 2024-25 Page 3
Name: Nithish Srinivasan Register Number: 21BEC0227
Spanning Tree Diagram
Inference:
From the Spanning tree algorithm we are able to deduce the network Lan we
don’t need to for 2 wires L3 and L5
BECE401P/Lab/ WINTER SEM 2024-25 Page 4
