More Books
Routing TCP IP Volume I CCIE Professional Development
Routing TCP/IP, Volume I (CCIE Professional Development)
Table of Contents
Copyright
About the Author
About the Reviewers
Introduction
Objectives
Audience
Organization
Conventions and Features
Foreword
Part I: Routing Basics
Chapter 1. Basic Concepts: Internetworks, Routers, and Addresses
Bicycles with Motors
Data Link Addresses
Repeaters and Bridges
Routers
Network Addresses
Looking Ahead
Recommended Reading
Review Questions
Chapter 2. TCP/IP Review
The TCP/IP Protocol Layers
The IP Packet Header
IP Addresses
ARP
ICMP
The Host-to-Host Layer
Looking Ahead
Summary Table: Chapter 2 Command Review
Recommended Reading
Review Questions
Configuration Exercises
Troubleshooting Exercises
Chapter 3. Static Routing
The Route Table
Configuring Static Routes
Troubleshooting Static Routes
Looking Ahead
Summary Table:Chapter 3 Command Review
Review Questions
Configuration Exercises
Troubleshooting Exercises
Chapter 4. Dynamic Routing Protocols
Routing Protocol Basics
Distance Vector Routing Protocols
Link State Routing Protocols
Interior and Exterior Gateway Protocols
Static or Dynamic Routing?
Looking Ahead
Recommended Reading
Review Questions
Part II: Interior Routing Protocols
Chapter 5. Routing Information Protocol (RIP)
Operation of RIP
Configuring RIP
Troubleshooting RIP
Looking Ahead
Summary Table: Chapter 5 Command Review.
Recommended Reading
Review Questions
Configuration Exercises
Troubleshooting Exercises
Chapter 6. Interior Gateway Routing Protocol (IGRP)
Operation of IGRP
Configuring IGRP
Troubleshooting IGRP
Looking Ahead
Summary Table: Chapter 6 Command Review
Recommended Reading
Review Questions
Configuration Exercises
Troubleshooting Exercises
Chapter 7. Routing Information Protocol Version 2
Operation of RIPv2
Configuring RIPv2
Troubleshooting RIPv2
Looking Ahead
Summary Table:Chapter 7 Command Review
Recommended Reading
Review Questions
Configuration Exercises
Troubleshooting Exercises
Chapter 8. Enhanced Interior Gateway Routing Protocol (EIGRP)
Figure 8.1. The four major components of EIGRP. RTP and neighbor discovery are lower-level protocols that enable the correct operation of DUAL. DUAL can perform route computations for multiple routed protocols.
Configuring EIGRP
Troubleshooting EIGRP
Looking Ahead
Summary Table:Chapter 8 Command Review
Review Questions
Configuration Exercises
Troubleshooting Exercises
Chapter 9. Open Shortest Path First
Neighbors and Adjacencies
Configuring OSPF
Troubleshooting OSPF
Looking Ahead
Summary Table: Chapter 9 Command Review
Recommended Reading
Review Questions
Configuration Exercises
Troubleshooting Exercises
Chapter 10. Integrated IS-IS
Operation of Integrated IS-IS
Configuring Integrated IS-IS
Troubleshooting Integrated IS-IS
Looking Ahead
Summary Table: Chapter 10 Command Review
Review Questions
Configuration Exercises
Troubleshooting Exercises
Part III: Route Control and Interoperability
Chapter 11. Route Redistribution
Principles of Redistribution
Configuring Redistribution
Looking Ahead
Summary Table: Chapter 11 Command Review
Review Questions
Configuration Exercises
Troubleshooting Exercises
Chapter 12. Default Routes and On-Demand Routing
Fundamentals of Default Routes
Fundamentals of On-Demand Routing
Configuring Default Routes and ODR
Looking Ahead
Summary Table: Chapter 12 Command Review
Review Questions
Chapter 13. Route Filtering
Configuring Route Filters
Looking Ahead
Summary Table: Chapter 13 Command Review
Configuration Exercises
Troubleshooting Exercises
Chapter 14. Route Maps
Basic Uses of Route Maps
Configuring Route Maps
Looking Ahead
Summary Table: Chapter 14 Command Review
Review Questions
Configuration Exercises
Troubleshooting Exercises
Part IV: Appendixes
Appendix A. Tutorial: Working with Binary and Hex
Working with Binary Numbers
Working with Hexadecimal Numbers
Appendix B. Tutorial: Access Lists
Access List Basics
Standard IP Access Lists
Extended IP Access Lists
Calling the Access List
Keyword Alternatives
Named Access Lists
Filter Placement Considerations
Access List Monitoring and Accounting
Appendix C. CCIE Preparation Tips
Laying the Foundations
Hands-On Experience
Intensifying the Study
The Final Six Months
Exam Day
Appendix D. Answers to Review Questions
Chapter 1
Chapter 2
Chapter 3
Chapter 4
Chapter 5
Chapter 6
Chapter 7
Chapter 8
Chapter 9
Chapter 10
Chapter 11
Chapter 12
Chapter 14
Appendix E. Solutions to Configuration Problems
Chapter 2
Chapter 3
Chapter 5
Chapter 6
Chapter 7
Chapter 8
Chapter 9
Chapter 10
Chapter 11
Chapter 13
Chapter 14
Appendix F. Solutions to Troubleshooting Exercises
Chapter 2
Chapter 3
Chapter 5
Chapter 6
Chapter 7
Chapter 8
Chapter 9
Chapter 10
Chapter 11
Chapter 13
Chapter 14
Index
index_SYMBOL
index_A
index_B
index_C
index_D
index_E
index_F
index_G
index_H
index_I
index_K
index_L
index_M
index_N
index_O
index_P
index_Q
index_R
index_S
index_T
index_U
index_V
index_W
index_Z
 

Troubleshooting IGRP

Like RIP, troubleshooting IGRP is usually an easy task. In most cases, it is a matter of following a route through the internetwork and examining the routing tables at each hop until the source of the trouble is discovered. The trouble is usually related to a misconfigured address or mask or to discontiguous addressing.

When the timers and other variables of the IGRP process are changed from their defaults, the likelihood of causing problems increases. This is especially true if these values are changed without fully understanding the effects the changes will have. The first case study demonstrates this situation; IGRP is doing what it should, but the trouble is due to "cockpit error." The second case study demonstrates that a discontiguous range of addresses does not always result from a configuration error.

Case Study: Unequal-Cost Load Balancing, Again

The entire internetwork of Figure 6.20 is routed with a single IGRP process, and the bandwidths for the serial links are configured to the numbers shown. Default delays are used. Notice that the addresses of the link between Lovett and Harriman are different from the previous examples. Because network 10.0.0.0 can be reached from Acheson not only by the two serial links but also via the Ethernet to Lovett, the network administrator wants to distribute the traffic proportionately among all three routes:

The access points to network 10.0.0.0 are:

  • Kennnan's Token Ring interface

  • Kennan's Ethernet interface

  • Harriman's Token Ring interface

Figure 6.20. This internetwork has three paths from Acheson to network 10.0.0.0.

graphics/06fig20.gif

Of Kennan's two interfaces to network 10.0.0.0, the lowest delay will be advertised, which is on the Token Ring interface. The minimum bandwidths of all three routes are the bandwidths of the serial interfaces. The metrics of the three routes from Acheson are:

  • Via S0: 6476 + (2000 + 63) = 8539

  • Via S1: 39062 + (2000 + 63) = 41125

  • Via E1: 6476 + (100 + 2000 + 63) = 8639

The highest metric is 4.8 times the lowest metric, so variance will be five.

The variance is configured, but the administrator finds that load balancing is not working as expected (Figure 6.21). The routing table shows only the two routes via Kennan; the route via Lovett is between the highest and lowest metrics, but is not included.

Figure 6.21. The route to 10.0.0.0 via Lovett is not included in the table for load sharing.

graphics/06fig21.gif

Recall the three rules for including a route in a load sharing "group," as noted in the configuration case study on unequal-cost load balancing. In this example, the second rule, which says that the next-hop router must be metrically closer to the destination than the local best route, is being violated. At Lovett, the metric to 10.0.0.0 is 6476 + (2000 + 63) = 8539. This is equal to, but not better than, Acheson's best route.

The metric at Lovett can be made lower than 8539 by slightly increasing the bandwidth or slightly decreasing the delay on the serial interface. In this case, the delay is decreased by 10 microseconds:


Lovett(config)#interface serial 0
Lovett(config-if)#delay 1999

The resulting routing table is shown in Figure 6.22.

Figure 6.22. After the delay on Lovett's serial interface is decreased by 10mS, Acheson will accept Lovett's route to 10.0.0.0.

graphics/06fig22.gif

When manipulating metrics, pay close attention to the results. If the cost of a path does not reasonably reflect its actual capacity, the traffic load may be distorted—a low-bandwidth link may be overloaded, or a high-bandwidth link may be underutilized.

Case Study: A Segmented Network

Some time after the internetwork of Figure 6.20 has been up and running, with load sharing working properly, users begin to complain that traffic to subnet 10.108.14.0 through Acheson is intermittent. When the network administrator sends 100 pings to an address on this network, they confirm that traffic is indeed intermittent (Figure 6.23).

Figure 6.23. The intermittent behavior of traffic to subnet 10.108.14.0 can be observed with these pings. Only 45% are successful.

graphics/06fig23.gif

There is a nonrandom pattern to the ping results: five successful pings alternating with six timeouts. Enabling packet debugging and sending more pings reveals what is happening (Figure 6.24). Acheson is load balancing as it should, with a pattern of 5/5/1 (five packets via E1, five packets via S0, one packet via S1). The packets sent via E1 are successful, but all packets sent across the serial links fail.

Figure 6.24. Sending 15 pings with packet debugging turned on reveals a large clue. Packets taking the route via Lovett successfully reach their destination, whereas all packets through Kennan fail.

graphics/06fig24.gif

Further investigation uncovers a disconnected lobe cable at Kennan's Token Ring interface, and the problem is repaired. The question remains: Why did the routes via the serial interfaces stay up? They were not marked unreachable, because Kennan's ethernet interface was still good. The router is summarizing network 10.0.0.0 to network 172.16.0.0, so there is no way for it to communicate the failed subnet.