Scribd Logo
Upload

Welcome to Scribd!

  • 76 views

    Switching Basics and Intermediate Routing: CNAP Semester 3

    Uploaded by

    Vo Ngoc Hoang
    The document discusses spanning tree protocol (STP) which is used to prevent loops in a redundant switched network topology. STP calculates a loop-free logical topology by electing a root bridge and placing ports on other bridges in forwarding or blocking states. Bridges send BPDUs to share information and determine the spanning tree configuration, with the root port on each bridge forwarding traffic and other ports blocking to avoid broadcast storms from frame looping. STP port states and the algorithm for electing the root bridge and designating ports are also described.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd

    Switching Basics and Intermediate Routing: CNAP Semester 3

    Uploaded by

    Vo Ngoc Hoang
    76 views22 pages
    The document discusses spanning tree protocol (STP) which is used to prevent loops in a redundant switched network topology. STP calculates a loop-free logical topology by electing a root bridge and placing ports on other bridges in forwarding or blocking states. Bridges send BPDUs to share information and determine the spanning tree configuration, with the root port on each bridge forwarding traffic and other ports blocking to avoid broadcast storms from frame looping. STP port states and the algorithm for electing the root bridge and designating ports are also described.

    Original Title

    Cnap 3 07 Spanning Tree Protocol

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses spanning tree protocol (STP) which is used to prevent loops in a redundant switched network topology. STP calculates a loop-free logical topology by electing a root bridge and placing ports on other bridges in forwarding or blocking states. Bridges send BPDUs to share information and determine the spanning tree configuration, with the root port on each bridge forwarding traffic and other ports blocking to avoid broadcast storms from frame looping. STP port states and the algorithm for electing the root bridge and designating ports are also described.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    76 views22 pages

    Switching Basics and Intermediate Routing: CNAP Semester 3

    Uploaded by

    Vo Ngoc Hoang
    The document discusses spanning tree protocol (STP) which is used to prevent loops in a redundant switched network topology. STP calculates a loop-free logical topology by electing a root bridge and placing ports on other bridges in forwarding or blocking states. Bridges send BPDUs to share information and determine the spanning tree configuration, with the root port on each bridge forwarding traffic and other ports blocking to avoid broadcast storms from frame looping. STP port states and the algorithm for electing the root bridge and designating ports are also described.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    of 22

    CNAP Semester 3: Switching Basics and Intermediate Routing

    The Saigon CTT

    Module 7 SPANNING TREE

    PROTOCOL

    Cisco Regional Networking Academy


    mailto: [email protected]
    1

    Version 3.0

    Objectives
    The Saigon CTT

    Define redundancy and its importance in networking


    Describe the spanning tree in a redundant-path

    switched network

    Table of Content
    The Saigon CTT

    1 2

    Redundant topologies Spanning tree protocol

    The Saigon CTT

    REDUNDANT TOPOLOGIES

    Redundant switched topologies


    The Saigon CTT

    Server/Host X

    Router Y

    Segment 1

    Switch A

    Switch B

    Segment 2

    Broadcast storms
    The Saigon CTT

    Server/Host X

    Router Y

    Segment 1

    Switch A

    Switch B

    Segment 2

    Multiple frame transmissions


    The Saigon CTT 7

    Media access control database instability


    The Saigon CTT 8

    The Saigon CTT

    SPANNING TREE PROTOCOL

    Redundant topology and spanning tree


    The Saigon CTT

    Redundant networking topologies are designed to ensure that networks continue to function in the presence of single points of failure. Switches flood traffic out all ports when the traffic is broadcast or multicast or sent to a destination that is not yet known. In the Layer 2 header there is no Time To Live (TTL). If a frame is sent into a Layer 2 looped topology of switches, it can loop forever.

    The solution is to allow physical loops, but create a


    10

    loop free logical topology

    Spanning Tree Protocol


    The Saigon CTT

    The ST Algorithm, implemented by the STP, prevents loops by calculating a stable spanningtree network topology. Spanning-tree frames, called bridge protocol data units (BPDUs), are sent and received by all switches in the network at regular intervals and are used to determine the spanning-tree topology.

    11

    STP port status


    The Saigon CTT

    Blocking:
    No frames forwarded, BPDUs heard

    Listening:
    No frames forwarded, listening for frames.

    Learning:
    No frames forwarded, learning addresses.

    Forwarding:
    Frames forwarded, learning addresses.

    Disabled:
    No frames forwarded, no BPDUs heard.
    12

    Algorithm
    The Saigon CTT

    All bridge interfaces eventually stabilize at either a forwarding or a blocking. One of the bridges is elected as root.
    All root bridge interfaces are in forwarding.

    Each bridge receives BPDU from the root, either directly or forwarded by some other bridge.
    The port in which the least-cost BPDU is received is called the root port of a bridge is placed in forwarding.
    13

    Root Bridge
    The Saigon CTT

    Bridge 1 MAC: 1111.1111.1111 Priority: 32768 Root Bridge

    Root Port

    Root Port

    Bridge 2 MAC: AAAA.AAAA.AAAA Priority: 32768

    Bridge 3 MAC: 8888.8888.8888 Priority: 32768

    14

    Algorithm (cont.)
    The Saigon CTT

    For each LAN segment:


    Designated bridge is one bridge sends the forwarded BPDU with the lowest cost. The designated bridges interface is placed in forwarding state. All interfaces of other bridges are placed in blocking state.

    15

    Port Cost
    The Saigon CTT

    1 65535 Default port cost for Ethernet:


    10Mbps:
    100Mbps: 1Gbps: 4

    100
    19

    10Gbps:

    16

    Designated Bridge
    The Saigon CTT

    Bridge 1 MAC: 1111.1111.1111 Priority: 32768 Root Bridge

    Port: 100Mbps Cost 19 Cost 100

    Port: 10Mbps

    Bridge 2 MAC: AAAA.AAAA.AAAA Priority: 32768

    Bridge 3 MAC: 8888.8888.8888 Priority: 32768

    17

    Algorithm (cont.)
    The Saigon CTT

    Hello Time (2s):


    The root sends BPDU every Hello time All bridges use the same value

    MaxAge time (20s):


    If a bridge does not receive a BPDU for MaxAge time It begins the process of causing the Spanning Tree to change.

    Forward Delay time (15s):


    Listening time between blocking and forwarding. After that, the state is changed to learning.
    18

    Rapid Spanning-Tree Protocol (802.1w)


    The Saigon CTT

    Share link

    Edge link

    Pt-pt link

    19

    Summary
    The Saigon CTT

    The benefits and risks of a redundant topology


    The role of spanning tree in a redundant-path switched network

    20

    21 The Saigon CTT

    Q&A

    22 The Saigon CTT

    You might also like