• Aucun résultat trouvé

IPv4 IGP Routing Troubleshooting

N/A
N/A
Protected

Academic year: 2022

Partager "IPv4 IGP Routing Troubleshooting"

Copied!
12
0
0

Texte intégral

(1)

http://www.INE.com

CCIE Routing & Switching CCIE Routing & Switching

Advanced Troubleshooting Bootcamp Advanced Troubleshooting Bootcamp

IPv4 IGP Routing Troubleshooting

IPv4 Routing Workflow IPv4 Routing Workflow

• IPv4 routing can be subdivided into three discrete steps

– Routing lookup – Switching method – Layer 2 encapsulation

• Subdividing these functions gives us a

“layered” approach to routing

troubleshooting

(2)

Copyright

Copyright ©©2009 Internetwork Expert, Inc 2009 Internetwork Expert, Inc www.INE.com

www.INE.com

IPv4 Routing Lookup IPv4 Routing Lookup

• Three goals: find the…

– Longest match(es) – Outgoing interface(s) – Next-hop(s)

• Troubleshooting considerations

– Administrative Distance – Metric

– Overlapping routes – Policing routing

• Can override this step

IPv4 Switching Method IPv4 Switching Method

• Goal is to move packets between interfaces

• Medthods are…

– Process – Fast – CEF – Etc.

• Load balancing occurs at this stage – not all hosts use the same routing path – E.g. show ip cef exact-route…

• Troubleshooting considerations – PING result !.!.!

– High CPU utilization

(3)

Copyright

Copyright ©©2009 Internetwork Expert, Inc 2009 Internetwork Expert, Inc www.INE.com

www.INE.com

Layer 2 Encapsulation Layer 2 Encapsulation

• Goal is to build layer 2 frame header

• Multipoint interfaces require layer 3 to layer 2 resolutions

– Point-to-point interfaces do not

• Troubleshooting considerations

– Routing to interface vs. next-hop – ARP, Proxy-ARP, & Inverse-ARP – Subnet mismatches

Further Reading Further Reading

• Troubleshooting Cisco Express Forwarding Routing Loops

• Troubleshooting Incomplete Adjacencies with CEF

• Troubleshooting High CPU Utilization in IP

Input Process

(4)

Copyright

Copyright ©©2009 Internetwork Expert, Inc 2009 Internetwork Expert, Inc www.INE.com

www.INE.com

RIP Workflow RIP Workflow

• RIP operation can be subdivided into three discrete steps

– Receive routing updates – Choose best path

– Advertise routing updates

Receiving RIP Updates Receiving RIP Updates

• Troubleshooting considerations

– UDP 520 transport

• Broadcast vs. multicast vs. unicast

• Filtering

– Not on common subnet

validate update-source – Version mismatches

• Global vs. send/receive – Authentication

• Type vs. key – Distribute lists

(5)

Copyright

Copyright ©©2009 Internetwork Expert, Inc 2009 Internetwork Expert, Inc www.INE.com

www.INE.com

RIP Path Selection RIP Path Selection

• Lowest hop count wins

• 16 = Infinite

– Route poisoning issues

debug ip rip to verify hop counts

Sending RIP Updates Sending RIP Updates

• RIP only advertises what it installs in routing table

• Like receiving, considerations are…

– UDP transport – Common subnets – Version

– Authentication – Filtering

(6)

Copyright

Copyright ©©2009 Internetwork Expert, Inc 2009 Internetwork Expert, Inc www.INE.com

www.INE.com

Common RIP Verification Common RIP Verification

show ip route

show ip rip database

debug ip rip

EIGRP Workflow EIGRP Workflow

• EIGRP operation can be subdivided into four discrete steps…

– Discover EIGRP Neighbors – Exchange Topology Information – Choose Best Path

– Neighbor and Topology Table Maintenance

(7)

Copyright

Copyright ©©2009 Internetwork Expert, Inc 2009 Internetwork Expert, Inc www.INE.com

www.INE.com

Discovering EIGRP Neighbors Discovering EIGRP Neighbors

• EIGRP neighbors discovered through multicast

– Implies bi-directional multicast transport of IP protocol 88 to 224.0.0.10 is needed

– Possible NBMA pseudo-broadcast support issues

– Possible filtering issues

• If neighbor statement configured, only unicast hellos are accepted

– If not agreed upon adjacency cannot continue

Discovering EIGRP Neighbors (cont.) Discovering EIGRP Neighbors (cont.)

• Attributes that must match to proceed

– Common subnet

• Must be primary IP address, not secondary – ASN

– Authentication

– K Values (metric weights)

(8)

Copyright

Copyright ©©2009 Internetwork Expert, Inc 2009 Internetwork Expert, Inc www.INE.com

www.INE.com

Exchanging EIGRP Topology Info Exchanging EIGRP Topology Info

• Topology info exchanged through unicast, not multicast

– Implies bi-directional unicast transport of IP protocol 88 needed

– Multicast still required unless neighborstatement used

• EIGRP only advertises what it installs in routing table

– Troubleshooting considerations

• Auto-summary

• Split-horizon

• Duplicate Router-IDs for external routes

• No seed metric for external routes

• Distribute-list filters

EIGRP Path Selection EIGRP Path Selection

• Feasible distance must be finite to use and advertise a path

show ip eigrp topology

• Unequal cost load balancing only supported for Feasible Successors

– IF Advertised Distance < Feasible Distance, Feasible Successor = TRUE

• Modifying bandwidth for path selection can starve EIGRP updates of bandwidth

ip bandwidth percent eigrp

(9)

Copyright

Copyright ©©2009 Internetwork Expert, Inc 2009 Internetwork Expert, Inc www.INE.com

www.INE.com

Common EIGRP Verifications Common EIGRP Verifications

show ip route

show ip eigrp neighbor

show ip eigrp topology

show ip eigrp topology all- links

debug eigrp packet hello

debug eigrp packet query reply

• More info at Troubleshooting EIGRP

Troubleshooting RIP & EIGRP Advertisement Troubleshooting RIP & EIGRP Advertisement

R2

R4

R1 R3

EIGRP

RIP EIGRP

RIP OSPF

OSPF

OSPF

(10)

Copyright

Copyright ©©2009 Internetwork Expert, Inc 2009 Internetwork Expert, Inc www.INE.com

www.INE.com

OSPF Workflow OSPF Workflow

• OSPF operation can be subdivided into four discrete steps…

– Discover OSPF Neighbors

– Exchange Topology Information – Choose Best Path

– Neighbor and Topology Table Maintenance

Discovering OSPF Neighbors Discovering OSPF Neighbors

• Requires IP protocol 89 multicast

(224.0.0.5/224.0.0.5) or unicast transport depending on network type

– Possible NBMA pseudo-broadcast support issues

– Possible filtering issues

(11)

Copyright

Copyright ©©2009 Internetwork Expert, Inc 2009 Internetwork Expert, Inc www.INE.com

www.INE.com

Discovering OSPF Neighbors (cont.) Discovering OSPF Neighbors (cont.)

• Attributes that must be unique to proceed – IP address

– Router-ID

• Attributes that must match to proceed – Subnet

– Area

– Compatible Network Types – Timers

– MTU – Stub Flags – Authentication

Exchanging OSPF Topology Info Exchanging OSPF Topology Info

• Intra-area routes flooded via LSA 1 & LSA 2 – Duplicate router-id issues

– DR/BDR on NBMA issues

• Inter-area routes flooded via LSA 3 by ABR – Discontiguous area 0 issue

• External routes flooded via LSA 4, and 5 or 7 – Duplicate router-id issues

– NSSA connectivity issues

– Forward address issue on translated 7 to 5 LSA

(12)

Copyright

Copyright ©©2009 Internetwork Expert, Inc 2009 Internetwork Expert, Inc www.INE.com

www.INE.com

Common OSPF Verifications Common OSPF Verifications

show ip route

show ip ospf neighbor

show ip ospf database

debug ip ospf adj

• More info at Troubleshooting OSPF

Références

Documents relatifs

Aspin-Welch and Kolmogorov-Smirnov figure 9(b) give the same results: most relevant model is topology 2, Baum-Welch learning algorithm with Forward Variable decoding is the

Information topology provides a synthesis of the main models of consciousness (Neural Assemblies, Integrated Information, Global Neuronal Workspace, Free Energy Principle) within

12) We recall that a topological space is a Baire space if all countable intersection of dense open sets is dense. Show that a topological space is a Baire space if and only if

Using in an essential way the theory developed in Section 6 and the theory of Gromov hyperbolicity, not only we give an affirmative answer to the Muir and Suffridge conjecture in

It covers subdivision, regular neighbourhoods, general position, en- gulfing, embeddings , isotopies and handle-body theory, including a complete proof of t h e

Since our main purpose is not to model the evolution of a real social network, we provide only a quantitative comparison for reciprocity and clustering values in real and

One can obtain Definition 1.4.3 as a particular case of Definition 1.4.1 as follows. Denote by X e the space X endowed with the new topology for which the open subsets are ∅ and

Example 1.3.21. We endow N with the following topology.. Denote by X e the space X endowed with the new topology for which the open subsets are ∅ and the open sets which contain