- •Warning and Disclaimer
- •Feedback Information
- •Trademark Acknowledgments
- •About the Author
- •About the Technical Reviewers
- •Dedication
- •Acknowledgments
- •Contents at a Glance
- •Contents
- •Icons Used in This Book
- •Command Syntax Conventions
- •Cisco’s Motivation: Certifying Partners
- •Format of the CCNA Exams
- •What’s on the CCNA Exams
- •ICND Exam Topics
- •Cross-Reference Between Exam Topics and Book Parts
- •CCNA Exam Topics
- •INTRO and ICND Course Outlines
- •Objectives and Methods
- •Book Features
- •How This Book Is Organized
- •Part I: LAN Switching
- •Part II: TCP/IP
- •Part III: Wide-Area Networks
- •Part IV: Network Security
- •Part V: Final Preparation
- •Part VI: Appendixes
- •How to Use These Books to Prepare for the CCNA Exam
- •For More Information
- •Part I: LAN Switching
- •“Do I Know This Already?” Quiz
- •Foundation Topics
- •Brief Review of LAN Switching
- •The Forward-Versus-Filter Decision
- •How Switches Learn MAC Addresses
- •Forwarding Unknown Unicasts and Broadcasts
- •LAN Switch Logic Summary
- •Basic Switch Operation
- •Foundation Summary
- •Spanning Tree Protocol
- •“Do I Know This Already?” Quiz
- •Foundation Topics
- •Spanning Tree Protocol
- •What IEEE 802.1d Spanning Tree Does
- •How Spanning Tree Works
- •Electing the Root and Discovering Root Ports and Designated Ports
- •Reacting to Changes in the Network
- •Spanning Tree Protocol Summary
- •Optional STP Features
- •EtherChannel
- •PortFast
- •Rapid Spanning Tree (IEEE 802.1w)
- •RSTP Link and Edge Types
- •RSTP Port States
- •RSTP Port Roles
- •RSTP Convergence
- •Edge-Type Behavior and PortFast
- •Link-Type Shared
- •Link-Type Point-to-Point
- •An Example of Speedy RSTP Convergence
- •Basic STP show Commands
- •Changing STP Port Costs and Bridge Priority
- •Foundation Summary
- •Foundation Summary
- •Virtual LANs and Trunking
- •“Do I Know This Already?” Quiz
- •Foundation Topics
- •Review of Virtual LAN Concepts
- •Trunking with ISL and 802.1Q
- •ISL and 802.1Q Compared
- •VLAN Trunking Protocol (VTP)
- •How VTP Works
- •VTP Pruning
- •Foundation Summary
- •Part II: TCP/IP
- •IP Addressing and Subnetting
- •“Do I Know This Already?” Quiz
- •Foundation Topics
- •IP Addressing Review
- •IP Subnetting
- •Analyzing and Interpreting IP Addresses and Subnets
- •Math Operations Used to Answer Subnetting Questions
- •Converting IP Addresses from Decimal to Binary and Back Again
- •The Boolean AND Operation
- •How Many Hosts and How Many Subnets?
- •What Is the Subnet Number, and What Are the IP Addresses in the Subnet?
- •Finding the Subnet Number
- •Finding the Subnet Broadcast Address
- •Finding the Range of Valid IP Addresses in a Subnet
- •Finding the Answers Without Using Binary
- •Easier Math with Easy Masks
- •Which Subnet Masks Meet the Stated Design Requirements?
- •What Are the Other Subnet Numbers?
- •Foundation Summary
- •“Do I Know This Already?” Quiz
- •Foundation Topics
- •Extended ping Command
- •Distance Vector Concepts
- •Distance Vector Loop-Avoidance Features
- •Route Poisoning
- •Split Horizon
- •Split Horizon with Poison Reverse
- •Hold-Down Timer
- •Triggered (Flash) Updates
- •RIP and IGRP
- •IGRP Metrics
- •Examination of RIP and IGRP debug and show Commands
- •Issues When Multiple Routes to the Same Subnet Exist
- •Administrative Distance
- •Foundation Summary
- •“Do I Know This Already?” Quiz
- •Foundation Topics
- •Link-State Routing Protocol and OSPF Concepts
- •Steady-State Operation
- •Loop Avoidance
- •Scaling OSPF Through Hierarchical Design
- •OSPF Areas
- •Stub Areas
- •Summary: Comparing Link-State and OSPF to Distance Vector Protocols
- •Balanced Hybrid Routing Protocol and EIGRP Concepts
- •EIGRP Loop Avoidance
- •EIGRP Summary
- •Foundation Summary
- •“Do I Know This Already?” Quiz
- •Foundation Topics
- •Route Summarization and Variable-Length Subnet Masks
- •Route Summarization Concepts
- •VLSM
- •Route Summarization Strategies
- •Sample “Best” Summary on Seville
- •Sample “Best” Summary on Yosemite
- •Classless Routing Protocols and Classless Routing
- •Classless and Classful Routing Protocols
- •Autosummarization
- •Classful and Classless Routing
- •Default Routes
- •Classless Routing
- •Foundation Summary
- •Advanced TCP/IP Topics
- •“Do I Know This Already?” Quiz
- •Foundation Topics
- •Scaling the IP Address Space for the Internet
- •CIDR
- •Private Addressing
- •Network Address Translation
- •Static NAT
- •Dynamic NAT
- •Overloading NAT with Port Address Translation (PAT)
- •Translating Overlapping Addresses
- •Miscellaneous TCP/IP Topics
- •Internet Control Message Protocol (ICMP)
- •ICMP Echo Request and Echo Reply
- •Destination Unreachable ICMP Message
- •Time Exceeded ICMP Message
- •Redirect ICMP Message
- •Secondary IP Addressing
- •FTP and TFTP
- •TFTP
- •MTU and Fragmentation
- •Foundation Summary
- •Part III: Wide-Area Networks
- •“Do I Know This Already?” Quiz
- •Foundation Topics
- •Review of WAN Basics
- •Physical Components of Point-to-Point Leased Lines
- •Data-Link Protocols for Point-to-Point Leased Lines
- •HDLC and PPP Compared
- •Looped Link Detection
- •Enhanced Error Detection
- •Authentication Over WAN Links
- •PAP and CHAP Authentication
- •Foundation Summary
- •“Do I Know This Already?” Quiz
- •Foundation Topics
- •ISDN Protocols and Design
- •Typical Uses of ISDN
- •ISDN Channels
- •ISDN Protocols
- •ISDN BRI Function Groups and Reference Points
- •ISDN PRI Function Groups and Reference Points
- •BRI and PRI Encoding and Framing
- •PRI Encoding
- •PRI Framing
- •BRI Framing and Encoding
- •DDR Step 1: Routing Packets Out the Interface to Be Dialed
- •DDR Step 2: Determining the Subset of the Packets That Trigger the Dialing Process
- •DDR Step 3: Dialing (Signaling)
- •DDR Step 4: Determining When the Connection Is Terminated
- •ISDN and DDR show and debug Commands
- •Multilink PPP
- •Foundation Summary
- •Frame Relay
- •“Do I Know This Already?” Quiz
- •Foundation Topics
- •Frame Relay Protocols
- •Frame Relay Standards
- •Virtual Circuits
- •LMI and Encapsulation Types
- •DLCI Addressing Details
- •Network Layer Concerns with Frame Relay
- •Layer 3 Addressing with Frame Relay
- •Frame Relay Layer 3 Addressing: One Subnet Containing All Frame Relay DTEs
- •Frame Relay Layer 3 Addressing: One Subnet Per VC
- •Frame Relay Layer 3 Addressing: Hybrid Approach
- •Broadcast Handling
- •Frame Relay Service Interworking
- •A Fully-Meshed Network with One IP Subnet
- •Frame Relay Address Mapping
- •A Partially-Meshed Network with One IP Subnet Per VC
- •A Partially-Meshed Network with Some Fully-Meshed Parts
- •Foundation Summary
- •Part IV: Network Security
- •IP Access Control List Security
- •“Do I Know This Already?” Quiz
- •Foundation Topics
- •Standard IP Access Control Lists
- •IP Standard ACL Concepts
- •Wildcard Masks
- •Standard IP ACL: Example 2
- •Extended IP Access Control Lists
- •Extended IP ACL Concepts
- •Extended IP Access Lists: Example 1
- •Extended IP Access Lists: Example 2
- •Miscellaneous ACL Topics
- •Named IP Access Lists
- •Controlling Telnet Access with ACLs
- •ACL Implementation Considerations
- •Foundation Summary
- •Part V: Final Preparation
- •Final Preparation
- •Suggestions for Final Preparation
- •Preparing for the Exam Experience
- •Final Lab Scenarios
- •Scenario 1
- •Scenario 1, Part A: Planning
- •Solutions to Scenario 1, Part A: Planning
- •Scenario 2
- •Scenario 2, Part A: Planning
- •Solutions to Scenario 2, Part A: Planning
- •Part VI: Appendixes
- •Glossary
- •Answers to the “Do I Know This Already?” Quizzes and Q&A Questions
- •Chapter 1
- •“Do I Know This Already?” Quiz
- •Chapter 2
- •“Do I Know This Already?” Quiz
- •Chapter 3
- •“Do I Know This Already?” Quiz
- •Chapter 4
- •“Do I Know This Already?” Quiz
- •Chapter 5
- •“Do I Know This Already?” Quiz
- •Chapter 6
- •“Do I Know This Already?” Quiz
- •Chapter 7
- •“Do I Know This Already?” Quiz
- •Chapter 8
- •“Do I Know This Already?” Quiz
- •Chapter 9
- •“Do I Know This Already?” Quiz
- •Chapter 10
- •“Do I Know This Already?” Quiz
- •Chapter 11
- •“Do I Know This Already?” Quiz
- •Chapter 12
- •“Do I Know This Already?” Quiz
- •Using the Simulation Software for the Hands-on Exercises
- •Accessing NetSim from the CD
- •Hands-on Exercises Available with NetSim
- •Scenarios
- •Labs
- •Listing of the Hands-on Exercises
- •How You Should Proceed with NetSim
- •Considerations When Using NetSim
- •Routing Protocol Overview
- •Comparing and Contrasting IP Routing Protocols
- •Routing Through the Internet with the Border Gateway Protocol
- •RIP Version 2
- •The Integrated IS-IS Link State Routing Protocol
- •Summary of Interior Routing Protocols
- •Numbering Ports (Interfaces)
Distance Vector Concepts 157
Now Router C has an infinite-distance (metric 16 for RIP) route to 162.11.7.0, but Router B has a route to the same subnet, metric 2, pointing through Router C. So Router B now thinks that 162.11.7.0 can be reached through Router C, and Router C thinks that 162.11.7.0 is unreachable.
Because Routers B and C use the same update interval between updates, this process repeats itself with the next routing update. This time, Router B advertises metric 3, and Router C advertises an infinite (bad) metric for subnet 162.11.7.0. This continues until both numbers reach infinity, so this phenomenon is often called counting to infinity. Thankfully, each distance vector routing protocol implementation sets a metric value for which the number is considered infinite; otherwise, this process would continue indefinitely.
Split horizon solves the counting-to-infinity problem between two routers. Split horizon can be briefly summarized as follows:
All routes with outgoing interface x are not included in updates sent out that same interface x.
For example, in Figure 5-6, Router C’s route to subnet 162.11.7.0 points out Serial1, so Router C’s updates sent out Serial1 do not advertise subnet 162.11.7.0. Therefore, when Routers B and C’s updates pass each other, one update shows the route with an infinite metric, and the other says nothing about the route, so the counting-to-infinity problem goes away.
Figure 5-6 Complete Routing Update with Split Horizon Enabled
|
S1 |
162.11.6.0 |
S1 |
|
Router C |
|
|
Router B |
|
|
|
|
||
|
|
|
|
|
|
|
162.11.7.0 |
16 |
|
162.11.10.0 |
162.11.10.0 |
2 |
|
162.11.7.0 |
|
|
Because of split-horizon rules, Router B does not advertise routes to subnets 162.11.6.0 or 162.11.10.0 in updates it sends to Router C. Similarly, Router C does not advertise routes to subnet 162.11.7.0 in updates sent to Router B. Because Router C does not advertise a route to 162.11.7.0 out its Serial1 interface, the counting-to-infinity problem over the serial link no longer occurs.
Split Horizon with Poison Reverse
So far, you have read about how split horizon and route poisoning work. However, Cisco distance vector routing protocols actually use a variant of split horizon called split horizon with poison reverse (or simply poison reverse). When the network is stable, it works just like plain old split horizon. When a route fails, the router advertises an infinite-metric route about
158 Chapter 5: RIP, IGRP, and Static Route Concepts and Configuration
that subnet out all interfaces—including interfaces previously prevented by split horizon. Figure 5-7 shows the pertinent contents of the routing update from Router C, using split horizon with poison reverse.
Figure 5-7 Split Horizon Enabled with Poison Reverse
|
S1 |
162.11.6.0 |
|
S1 |
Router B |
Router C |
|
|
|
||
|
|
|
|
||
|
2 |
|
162.11.7.0 |
16 |
|
|
|
|
|
||
162.11.10.0 |
162.11.10.0 |
2 |
1 |
|
162.11.7.0 |
|
|
162.11.7.016
As Figure 5-7 illustrates, after Router C hears of the infinite metric (metric 16 for RIP) route to 162.11.7.0, it then ignores split-horizon rules for that route and advertises the subnet back to Router B with an infinite metric. Using split horizon prevents counting to infinity, and adding poison reverse ensures that all routers know for sure that the route has failed. Both RIP and IGRP use split horizon with poison reverse by default in a Cisco router.
Hold-Down Timer
Split horizon solves the counting-to-infinity problem over a single link. However, counting to infinity can occur in redundant networks (networks with multiple paths) even with split horizon enabled. The hold-down timer defeats the counting-to-infinity problem when networks have multiple paths to many subnets.
Figure 5-8 shows the version of the counting-to-infinity problem that split horizon does not solve but that holddown does solve. Subnet 162.11.7.0 fails again (someone should check the cabling on that Ethernet!), and Router B advertises an infinite-metric route for subnet 162.11.7.0 to both Router A and Router C. However, Router A’s update timer expires at the same time as Router B’s timer (shown as the circled number 1s in the figure), so the updates sent by Routers A and B occur at the same time. Therefore, Router C hears of an infinitedistance metric to that subnet from Router B, and a metric 2 route from Router A, at about the same time. Router C correctly chooses to use the metric 2 route through Router A. Table 5-7 lists the pertinent information about Router C’s routing table entry for subnet 162.11.7.0 after the updates shown in Figure 5-8.
After the updates labeled with a 1 in Figure 5-8, Router C thinks it has a valid route to 162.11.7.0, pointing back to Router A. So, on Router C’s next update (the circled 2 in Figure 5-8), it does not advertise subnet 162.11.7.0 out S0 because of split-horizon rules. However, Router C does advertise 162.11.7.0 out Serial1 with metric 3. Now Router B believes it has a valid route, metric 3, to subnet 162.11.7.0. Router B, in its next update (not shown in the figure), also tells Router A that it has a route to 162.11.7.0, this time with metric 4. So counting to infinity occurs even though split horizon is enabled.
Distance Vector Concepts 159
Figure 5-8 Counting to Infinity with a Need for Holddown
162.11.9.251 |
Router A |
||
|
|||
162.11.7.0 |
2 |
S1 |
|
S0 |
|||
|
|
||
1 |
|
|
|
|
|
1 |
|
|
|
|
|
|
162.11.7.0 |
16 |
|
S0 |
|
|
S0 |
|
Router C |
S1 |
|
S1 |
Router B |
|
|
|
||||
|
2 |
|
|
|
|
|
|
162.11.7.0 |
16 |
|
|
|
162.11.7.0 |
3 |
|
162.11.7.0 |
|
|
|
|
|
||
|
|
1 |
|
|
|
Table 5-7 Router C Routing Table After the Updates Shown in Step 1 of Figure 5-8 Are Received
|
Outgoing |
|
|
|
Group |
Interface |
Next-Hop Router |
Metric |
Comments |
|
|
|
|
|
162.11.7.0 |
S0 |
162.11.9.251 |
2 |
Formerly the route pointed |
|
|
|
|
directly to Router B. Now the |
|
|
|
|
route points through Router A, |
|
|
|
|
metric 2. |
|
|
|
|
|
Distance vector protocols use a hold-down timer to defeat these types of counting-to-infinity problems. The concept is simple—as soon as you see the problem. Holddown is defined as follows:
When learning that a route has failed, ignore any information about an alternative route to that subnet for a time equal to the hold-down timer.
With holddown enabled, Router C does not believe the metric 2 route learned from Router A in Step 1 of Figure 5-8 for some period of time. During the same time, Router B advertises infinite-metric routes to 162.11.7.0 to Routers A and C, and then Router A starts advertising an infinite-distance route to Router C. In effect, all routers ignore good routing information about that subnet until enough time passes so that everyone has heard the old, bad information. Essentially, the hold-down timer means that the routers just need to exercise a little patience while everyone learns that the route has failed, preventing loops. It is much better to wait a little longer for convergence to prevent the problems caused by looping packets.