Scribd Logo
Upload

Welcome to Scribd!

  • 23 views

    Root Failure With Loop

    Uploaded by

    SolomonCheruiyot
    The document discusses how the Spanning Tree Protocol (STP) requires multiple seconds to converge on a new spanning tree when the root bridge fails or a link fails. It verifies through simulation that when the root bridge fails, the second bridge with the lower address becomes the new root bridge. However, it still sends BPDUs and doesn't know the root bridge failed until after two lost BPDUs, at which point the new root bridge moves its port to the forwarding state.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Root Failure With Loop

    Uploaded by

    SolomonCheruiyot
    23 views1 page
    The document discusses how the Spanning Tree Protocol (STP) requires multiple seconds to converge on a new spanning tree when the root bridge fails or a link fails. It verifies through simulation that when the root bridge fails, the second bridge with the lower address becomes the new root bridge. However, it still sends BPDUs and doesn't know the root bridge failed until after two lost BPDUs, at which point the new root bridge moves its port to the forwarding state.

    Original Description:

    Root Fail

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses how the Spanning Tree Protocol (STP) requires multiple seconds to converge on a new spanning tree when the root bridge fails or a link fails. It verifies through simulation that when the root bridge fails, the second bridge with the lower address becomes the new root bridge. However, it still sends BPDUs and doesn't know the root bridge failed until after two lost BPDUs, at which point the new root bridge moves its port to the forwarding state.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    23 views1 page

    Root Failure With Loop

    Uploaded by

    SolomonCheruiyot
    The document discusses how the Spanning Tree Protocol (STP) requires multiple seconds to converge on a new spanning tree when the root bridge fails or a link fails. It verifies through simulation that when the root bridge fails, the second bridge with the lower address becomes the new root bridge. However, it still sends BPDUs and doesn't know the root bridge failed until after two lost BPDUs, at which point the new root bridge moves its port to the forwarding state.

    Copyright:

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

    Root failure with loop

    The aim of this scenario that mentioned in a publication paper Error! Reference source not
    found. the RSTP requires multiple seconds to converge on a new spanning tree. Slow
    convergence happens most often when a root bridge fails, but it can also be triggered when a link
    fails. We verify that by simulation: when the root bridge fails as shown in Error! Reference
    source not found., the second bridge which is the lower than old root bridge in address will be
    new root bridge, but it still sends BPDUs. After two lost BPDUs, the new root bridge knows that
    the root bridge failed, resulting that the new root bridge moves the port to forwarding state.

    You might also like