Copyright 2003 CCNA 4 Chapter 20 CCNA Certification Exam Review By Your Name
Copyright 2003 OSI Model
Copyright 2003 Layer 1 Versus Layer 2
Copyright 2003 OSI Versus Ethernet Standards
Copyright 2003 Creating Subnets How to create a subnet Subnet planning
Copyright 2003 LAN Switching Full-duplex and half-duplex Ethernet operations Configuring both ends Configuring a router Mismatch between two switches
Copyright 2003 Comparing LAN Standards
Copyright 2003 LANs and Devices
Copyright 2003 Full Duplex and Half Duplex
Copyright 2003 The Data Link Layer Logical Link Control Ethernet Token Ring
Copyright 2003 Ethernet and IEEE Frame Formats Type (Ethernet) Specifies the upper-layer protocol to receive the data after Ethernet processing. Length (IEEE 802.3) The number of bytes of data that follows this field. Data (Ethernet) Ethernet version 2 does not specify any padding. Data (IEEE 802.3) Upper-layer protocol, is defined (LLC) in the data portion of the frame. If data is insufficient to fill the frame to the minimum 64-byte size, padding bytes are added. Preamble Alternating pattern of 1s and 0s (up to 31 pairs) tells receiving station that a data frame is coming.
Copyright 2003 MAC Addresses
Copyright 2003 Token Ring Frame Format
Copyright 2003 FDDI Frame Format
Copyright 2003 Ethernet Family Tree
Copyright 2003 LAN Segmentation
Copyright 2003 Layer 2 and Layer 3 Switching
Copyright 2003 Collision Domains
Copyright 2003 Symmetric Switching
Copyright 2003 Asymmetric Switching
Copyright 2003 Memory Buffering Port-based memory buffering –Packets are stored in queues that are linked to specific incoming ports. –It is possible for a single packet to block all other packets because its destination port is busy (even if the other packets could be delivered). Shared-memory buffering –All packets use a common memory buffer. –Packets in the buffer are then linked (mapped) dynamically to the appropriate destination port. –Helps balance between 10- and 100-Mbps ports.
Copyright 2003 Switching Methods
Copyright 2003 Redundancy and Loops Newer switched networks include redundant links to increase reliability and reduce single points of failure. With that comes the potential for data loops.
Copyright 2003 Spanning Tree Protocol Multiple paths to a destination provide redundancy and make a network robust. STP uses spanning-tree algorithm (STA). STP is a switched Ethernet network solution to deal with potential for data loops introduced by multiple paths. –Routers can manage multiple paths to avoid loops. –Hub networks would stop immediately with multiple paths. STP detects potential loops and blocks one path. –Blocked path can be quickly activated if other link fails. –Uses Layer 2 BPDUs (bridge protocol data units) to communicate between switches and detect potential loops.
Copyright 2003 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 Ports typically progress from Blocking > Listening > Learning > Forwarding. The Five STP States
Copyright 2003 WANs and Devices
Copyright 2003 WAN Physical Layer Standards
Copyright 2003 WAN Data Link Layer Protocols
Copyright 2003 WAN Encapsulation Formats (HDLC)
Copyright 2003 WAN Link Options
Copyright 2003 Point-to-Point Links Leased Lines
Copyright 2003 Packet-Switched Connections
Copyright 2003 Frame Relay
Copyright 2003 Circuit-Switched Connections
Copyright 2003 Dial-on-Demand Routing
Copyright 2003 ISDN