Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • Task 2

    Uploaded by

    vansh.jain2021
    4 views6 pages
    Vansh Jain submitted Lab Task 2 for the subject CCN. The task involves analyzing and computing the spanning tree for an extended LAN network. Spanning tree protocol (STP) is used to prevent loops by computing a tree structure. STP exchanges BPDU messages containing bridge IDs and port IDs. The document shows the tabulated port addresses and bridge IDs for switches in the network. It also includes the manual computation and simulated spanning tree diagram using NetSim software. The spanning tree algorithm was used to determine which ports are blocked and which paths are used to traverse the network without loops.

    Original Description:

    Original Title

    Task-2

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Vansh Jain submitted Lab Task 2 for the subject CCN. The task involves analyzing and computing the spanning tree for an extended LAN network. Spanning tree protocol (STP) is used to prevent loops by computing a tree structure. STP exchanges BPDU messages containing bridge IDs and port IDs. The document shows the tabulated port addresses and bridge IDs for switches in the network. It also includes the manual computation and simulated spanning tree diagram using NetSim software. The spanning tree algorithm was used to determine which ports are blocked and which paths are used to traverse the network without loops.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    4 views6 pages

    Task 2

    Uploaded by

    vansh.jain2021
    Vansh Jain submitted Lab Task 2 for the subject CCN. The task involves analyzing and computing the spanning tree for an extended LAN network. Spanning tree protocol (STP) is used to prevent loops by computing a tree structure. STP exchanges BPDU messages containing bridge IDs and port IDs. The document shows the tabulated port addresses and bridge IDs for switches in the network. It also includes the manual computation and simulated spanning tree diagram using NetSim software. The spanning tree algorithm was used to determine which ports are blocked and which paths are used to traverse the network without loops.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 6

    Name: VANSH JAIN Register Number:21BEC0705 Reg: 21BEC0705

    CCN
    Lab Task Submission: 2

    Name: Vansh Jain


    Registration Number: 21BEC0705
    Subject: CCN
    Faculty: Prof. Velmurugan T
    Subject Code: BECE401P
    Lab Slot: L55 + L56
    Class Room: TT 134

    BECE401P/Lab/ WINTER SEM 2023-24 Page 1


    Name: VANSH JAIN Register Number:21BEC0705

    Exp 2
    Analyze and Compute the Spanning Tree for the extended LAN
    Analyse and Compute the Spanning Tree for the extended LAN given below. For
    the following bridged LAN, assume that LANs 2, 4 and 5 are Gigabit Ethernets
    (Cost=4) and the rest are Fast Ethernets (Cost=19). Bridges are labelled with
    B1, B2, etc. Use the LAN costs to determine the least cost path.

    • S1-S2
    • S2-S3
    • S3-S1

    BECE401P/Lab/ WINTER SEM 2023-24 Page 2


    Name: VANSH JAIN Register Number:21BEC0705

    Aim:
    To Compute the Spanning Tree for the given extended LAN and analyse the looping
    problem

    Tools Required:
    Net Sim Software

    Theory:

    Spanning Tree Protocol (STP) is a protocol that prevents Layer 2 loops or Bridging
    loops by computing a tree structure of nodes in a network. It also prevents MAC
    Flapping (an event that occurs when a switch receives packets on different interfaces
    with the same source MAC address)

    Spanning Tree Communication:


    STP exchanges its data messages in the form BPDU’s (Bridge Protocol Data Units).
    Since the switch is unaware of the other switches around it, so it sends BPDU frames
    with the source MAC address of its port, and the destination MAC address is the STP
    Multicast address, i.e., 0180.C200.0000.
    Bridge ID is an 8-byte unique identity of each switch in an STP topology. It consists
    of two things: –

    Bridge Priority: ranges from 0 to 65535 (default is 32768) + VLAN-id.


    Base MAC Address: hard coded and unique for every switch.

    BECE401P/Lab/ WINTER SEM 2023-24 Page 3


    Name: VANSH JAIN Register Number:21BEC0705

    Tabulation of Port Address (Bridges)


    Pri
    Brid Po Port ID (Priority + Switch /Bridge ID
    ori MAC Address
    ge # rt MAC) (Lowest in Port ID)
    ty
    S1 1 1 1F345CE59E6B 11F345CE59E6B 104DC7EEDD3A1
    2 1 40FC22A81B58 140FC22A81B58
    3 1 04DC7EEDD3A1 104DC7EEDD3A1
    S2 1 2 37D5E5A2D0B0 237D5E5A2D0B0 236433A77FB28
    2 2 36433A77FB28 236433A77FB28
    S3 1 3 7A3C3FC4F825 37A3C3FC4F825 312408C67833D
    2 3 912D0F48546E 3912D0F48546E
    3 3 12408C67833D 312408C67833D
    S4 1 4 3EB5A543DFE4 43EB5A543DFE4 4CC79F62AAF59
    2 4 CC79F62AAF59 4CC79F62AAF59
    S5 1 5 6AF7BA6FAE09 56AF7BA6FAE09 560402F2D3BFC
    2 5 60402F2D3BFC 560402F2D3BFC
    3 5 78ED4D0DF7DD 578ED4D0DF7DD
    S6 1 6 E2394E05C2E5 6E2394E05C2E5 6B7255CF4FE94
    2 6 CD8775DDC0E3 6CD8775DDC0E3
    3 6 B7255CF4FE94 6B7255CF4FE94
    S7 1 7 04E888834A1B 704E888834A1B 704E888834A1B
    2 7 AD01DA5DD69D 7AD01DA5DD69D
    3 7 FDAC1F59EF03 7FDAC1F59EF03
    4 7 7CEDBED1A398 77CEDBED1A398
    S8 1 8 9452BA1569EB 89452BA1569EB 89452BA1569EB
    2 8 9B5AE213060F 89B5AE213060F
    3 8 C10198DE17A7 8C10198DE17A7
    S9 1 9 847DAA29B0B4 9847DAA29B0B4 96B829AE010EB
    2 9 C45408718261 9C45408718261
    3 9 6B829AE010EB 96B829AE010EB
    S10 1 9 C8405A307B86 9C8405A307B86 9BC655AAF985F
    2 9 BC655AAF985F 9BC655AAF985F

    BECE401P/Lab/ WINTER SEM 2023-24 Page 4


    Name: VANSH JAIN Register Number:21BEC0705

    Manual Computation of Spanning Tree

    BECE401P/Lab/ WINTER SEM 2023-24 Page 5


    Name: VANSH JAIN Register Number:21BEC0705

    Spanning Tree Diagram


    (Simulated Using NetSim)

    Inference:
    Thus, we used the spanning tree algorithm to find which ports are blocked and which
    blocks are used to traverse the network.

    BECE401P/Lab/ WINTER SEM 2023-24 Page 6

    You might also like