Introduction Routing Protocol
Introduction Routing Protocol
• With distance vector routing, each node has information only about
the next hop:
• Node A: to reach F go to B
• Node B: to reach F go to D
• Node D: to reach F go to E
• Node E: go directly to F AA BB CC
• If parts of the directions incorrect, the routing may be incorrect until the
routing algorithms has re-converged.
10
Distance Vector vs. Link State Routing
• In link state routing, each node has a complete map of the topology
A B C A B C A B C
D E F D E F D E F
D E F
D E F D E F
11
Classifying Routing Protocols
https://support.huawei.com/enterprise/en/doc/
EDOC1100086956#EN-US_TOPIC_0291822205
Summary
• Dynamic routing protocols fulfill the following functions
•-Dynamically share information between routers
•-Automatically update routing table when topology changes
•-Determine best path to a destination
• Routing protocols are grouped as either
•-Interior gateway protocols (IGP)Or
•-Exterior gateway protocols(EGP)
• Types of IGPs include
•-Classless routing protocols - these protocols include subnet mask in routing
updates
•-Classful routing protocols - these protocols do not include subnet mask in
routing update
Summary
• Metrics are used by dynamic routing protocols to calculate the best
path to a destination.
• Preference is an integer value that is used to indicate a router’s
“trustworthiness”
• Components of a routing table include:
•-Route source
•-Preference
•-Metric