cnap 3 07 spanning tree protocol

Upload: vo-ngoc-hoang

Post on 03-Apr-2018

223 views

Category:

Documents


0 download

TRANSCRIPT

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    1/22

    The

    SaigonCTT

    1

    CNAP Semester 3: Switching Basics and

    Intermediate Routing

    Module 7

    SPANNING

    TREEPROTOCOL

    Version 3.0Cisco Regional Networking Academymailto: [email protected]

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    2/22

    The

    SaigonCTT

    2

    Objectives

    Define redundancy and its importance in networking

    Describe the spanning tree in a redundant-pathswitched network

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    3/22

    The

    SaigonCTT

    3

    Table of Content

    1 Redundant topologies2 Spanning tree protocol

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    4/22

    The

    SaigonCTT

    4

    REDUNDANT TOPOLOGIES

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    5/22

    The

    SaigonCTT

    5

    Redundant switched topologies

    Segment 1

    Segment 2

    Switch A Switch B

    Router YServer/Host X

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    6/22

    The

    SaigonCTT

    6

    Broadcast storms

    Segment 1

    Segment 2

    Switch A Switch B

    Router YServer/Host X

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    7/22

    The

    SaigonCTT

    7

    Multiple frame transmissions

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    8/22

    The

    SaigonCTT

    8

    Media access control database instability

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    9/22

    The

    SaigonCTT

    9

    SPANNING

    TREE PROTOCOL

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    10/22

    The

    Saigon

    CTT

    10

    Redundant topology and spanning tree

    Redundant networking topologies are designed toensure that networks continue to function in thepresence of single points of failure.

    Switches flood traffic out all ports when the traffic isbroadcast or multicast or sent to a destination thatis not yet known.

    In the Layer 2 header there is no Time To Live

    (TTL). If a frame is sent into a Layer 2 loopedtopology of switches, it can loop forever.

    The solution is to allow physical loops, but create a

    loop free logical topology

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    11/22

    The

    Saigon

    CTT

    11

    Spanning Tree Protocol

    The ST Algorithm, implemented by the STP,

    prevents loops by calculating a stable spanning-tree network topology.

    Spanning-tree frames, called bridge protocol dataunits (BPDUs), are sent and received by all

    switches in the network at regular intervals andare used to determine the spanning-tree topology.

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    12/22

    The

    Saigon

    CTT

    12

    STP port status

    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.

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    13/22

    The

    Saigon

    CTT

    13

    Algorithm

    All bridge interfaces eventually stabilize at either aforwarding 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.

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    14/22

    The

    Saigon

    CTT

    14

    Root Bridge

    Bridge 1

    MAC: 1111.1111.1111Priority: 32768

    Bridge 2

    MAC: AAAA.AAAA.AAAAPriority: 32768

    Bridge 3

    MAC: 8888.8888.8888Priority: 32768

    Root Bridge

    Root PortRoot Port

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    15/22

    The

    Saigon

    CTT

    15

    Algorithm (cont.)

    For each LAN segment:

    Designated bridge is one bridge sends the forwardedBPDU with the lowest cost.

    The designated bridges interface is placed in forwardingstate.

    All interfaces of other bridges are placed in blockingstate.

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    16/22

    The

    Saigon

    CTT

    16

    Port Cost

    1 65535

    Default port cost for Ethernet:

    10Mbps: 100

    100Mbps: 19

    1Gbps: 4 10Gbps: 2

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    17/22

    The

    Saigon

    CTT

    17

    Designated Bridge

    Bridge 1

    MAC: 1111.1111.1111Priority: 32768

    Bridge 2

    MAC: AAAA.AAAA.AAAAPriority: 32768

    Bridge 3

    MAC: 8888.8888.8888Priority: 32768

    Root Bridge

    Port: 10MbpsPort: 100MbpsCost 19 Cost 100

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    18/22

    The

    Saigon

    CTT

    18

    Algorithm (cont.)

    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 tochange.

    Forward Delay time (15s): Listening time between blocking and forwarding. After

    that, the state is changed to learning.

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    19/22

    The

    Saigon

    CTT

    19

    Rapid Spanning-Tree Protocol (802.1w)

    Pt-pt link

    Share link

    Edge link

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    20/22

    The

    Saigon

    CTT

    20

    Summary

    The benefits and risks of a redundant topology

    The role of spanning tree in a redundant-path switchednetwork

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    21/22

    The

    SaigonC

    TT

    21

    Q&A

  • 7/27/2019 Cnap 3 07 Spanning Tree Protocol

    22/22

    The

    SaigonC

    TT

    22