TAILIEUCHUNG - Lecture LAN Switching and Wireless - Chapter 5: Implement Spanning Tree Protocols

In this chapter: Explain the role of redundancy in a converged network, summarize how STP works to eliminate Layer 2 loops in a converged network, explain how the STP algorithm uses three steps to converge on a loop-free topology, explain how the STP algorithm uses three steps to converge on a loop-free topology. | Implement Spanning Tree Protocols LAN Switching and Wireless – Chapter 5 Objectives Explain the role of redundancy in a converged network Summarize how STP works to eliminate Layer 2 loops in a converged network Explain how the STP algorithm uses three steps to converge on a loop-free topology Implement rapid per VLAN spanning tree (rapid PVST+) in a LAN to prevent loops between redundant switches. Explain the Role of Redundancy in a Converged Switched Network Describe the role redundancy in a hierarchical network Explain the Role of Redundancy in a Converged Switched Network Describe how redundancy can disable a hierarchical network Explain the Role of Redundancy in a Converged Switched Network Explain how Layer 2 loops occur in well managed networks Summarize How STP works to Eliminate Layer 2 Loops in a Converged Network Describe the STP algorithm Summarize How STP works to Eliminate Layer 2 Loops in a Converged Network Explain the role of the BPDU in STP Summarize How STP works to Eliminate Layer 2 Loops in a Converged Network Explain the role of the BID in STP Summarize How STP works to Eliminate Layer 2 Loops in a Converged Network Describe the how port roles support the operation of STP Summarize How STP works to Eliminate Layer 2 Loops in a Converged Network Describe the role of STP port states and BPDU timers in the operation of STP Explain How the STP Algorithm Uses Three Steps to Converge on a Loop-Free Topology Define convergence for a switched network and summarize the 3 step process STP uses to create a loop free topology Explain How the STP Algorithm Uses Three Steps to Converge on a Loop-Free Topology Explain the STP decision sequence is used to elect a root bridge for a network Explain How the STP Algorithm Uses Three Steps to Converge on a Loop-Free Topology Describe the process of electing a root port on a switch Explain How the STP Algorithm Uses Three Steps to Converge on a Loop-Free Topology Describe the process of electing designated ports and non-designated ports on a switch Implement Rapid per VLAN Spanning Tree (rapid PVST+) in a LAN Summarize the features of the PVST+, RSTP and rapid PVST+ variants of STP Implement Rapid per VLAN Spanning Tree (rapid PVST+) in a LAN Describe the features of PVST+ Implement Rapid per VLAN Spanning Tree (rapid PVST+) in a LAN Describe the features of RSTP Implement Rapid per VLAN Spanning Tree (rapid PVST+) in a LAN Describe RSTP edge ports Implement Rapid per VLAN Spanning Tree (rapid PVST+) in a LAN Describe the RSTP link types Implement Rapid per VLAN Spanning Tree (rapid PVST+) in a LAN Describe the RSTP port states and port roles Implement Rapid per VLAN Spanning Tree (rapid PVST+) in a LAN Describe how to configure rapid PVST+ Implement Rapid per VLAN Spanning Tree (rapid PVST+) in a LAN Describe how to design STP to avoid problems Implement Rapid per VLAN Spanning Tree (rapid PVST+) in a LAN Describe how to identify and solve the key STP configuration issues Summary Spanning Tree Protocol (STP) is used to prevent loops from being formed on redundant networks STP uses different port states & timers to logically prevent loops There is at least one switch in a network that serves as the root bridge Root bridge is elected using information found in BPDU frames Root ports are determined by the spanning tree algorithm and are closest to the root bridge Summary STP lengthy convergence time (50 seconds) facilitated the development of: RSTP convergence time is slightly over 6 seconds Rapid PVST+ adds VLAN support to RSTP is the preferred spanning-tree protocol on a Cisco switch netowrk

TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.