This tutorial explains the basic concepts, features, functions, and types of routing protocols. Learn different types of routing protocols and how they work in detail.
Features of routing protocols
Routers use routing protocols: –
- To know all the available paths of the network
- To select the best and fastest path for each destination in the network
- To select a single and fastest path if more than one path exists for a single destination
Functions of routing protocols
The main functions of routing protocols are the following.
- Learn routing information from neighboring routers
- Advertise local routing information to neighboring routers
- Calculate the best route for each subnet of the network
- Provide a virtual map of all routes of the network
- Calculate the cost of each route and help the router choose the best and fastest route
- Detect any change in the network and update all routers about that change
Types of routing protocols
There are three types of routing protocols: distance-vector, link-state, and hybrid. RIPv1 and IGRP are examples of distance-vector routing protocols while OSPF is an example of a link-state routing protocol. Examples of hybrid routing protocols include RIPv2, EIGRP, and BGP.
Let\’s understand how each type of routing protocols work and how it differs from other types.
Distance-vector routing protocols
Routers running distance-vector routing protocols periodically broadcast routing and reachability information from all active interfaces. They also receive the same information from their neighbors on their active interfaces.
Distance-vector protocols use timers to broadcast routing information. Once their periodic timer expires, they broadcast their routing information from all active interfaces, no matter whether the routing information has changed since the previous broadcast or not.
Calculating/selecting the best route
Distance-vector protocols use distance and direction to calculate and select the best route for each subnet of the network. Distance is the number of routers that a packet crosses to reach its destination.
Distance is measured in terms of hops. Each instance where a packet goes through a router is called a hop. For example, if a packet crosses four routers to reach its destination, the number of hops is 4. The route with the least number of hops is selected as the best route.
The vector indicates the direction that a packet uses to reach its destination.
The following figure shows an example of a network running distance victor protocol.
In this network, the router R1 has three routes to the destination network. These routes are the following.
- The four-hop route (distance) through R2 (vector)
- The one-hop route (distance) through R6 (vector)
- The two-hop route (distance) through R7 (vector)
Since the second route has the lowest hop count, the router R1 uses this route to forward all packets of the destination network.
Key points: –
- Distance-vector protocols do not perform any mechanism to know who their neighbors are.
- Distance-vector protocols learn about their neighbors by receiving their broadcasts.
- Distance-vector protocols do not perform any formal handshake or hello process with neighbors before broadcasting routing information.
- Distance-vector protocols do not verify whether neighbors received routing updates or not.
- Distance-vector protocols assume that if a neighbor misses an update, it will learn about the change in the next broadcast update.
Link-state routing protocols
Unlike distance-vector routing protocols, the link-state routing protocols do not share routing and reachability information with anyone. Routers running link-state protocols share routing information only with neighbors. To discover neighbors, link-state protocols use a special protocol known as the hello protocol.
After discovering all neighbors, the link-state protocols create three separate tables. One of these tables keeps track of directly attached neighbors, one determines the topology of the entire internetwork, and one is used as the routing table.
From all available routes, to select the best route for each destination of the network, the link-state protocols use an algorithm called the Shortest Path First (SPF) algorithm.
Differences between distance-vector routing protocols and link-state routing protocols
Unlike distance-vector routing protocols that broadcast the entire routing table periodically whether there are any changes or not, link-state routing protocols do not exchange routing information periodically. They exchange information only when they detect any change in the network.
Distance-vector protocols use local broadcasts, which are processed by every router on the same segment, while link-state protocols use multicasts which are processed only by the routers running the link-state protocol.
Distance-vector protocols do not verify routing broadcasts. They don\’t care whether the neighboring routers received them or not. Link-state protocols verify routing updates. A destination router, when receiving a routing update, will respond to the source router with an acknowledgment.
Hybrid routing protocols
Hybrid routing protocols are the combination of both distance-vector and link-state protocols. Hybrid routing protocols are based on distance-vector routing protocols but contain many of the features and functions of link-state routing protocols.
Hybrid routing protocols are built upon the basic principles of a distance-vector protocol but act like a link-state routing protocol. Hybrid protocols use a Hello protocol to discover neighbors and form neighbor relationships. Hybrid protocols also send updates only when a change occurs.
Hybrid routing protocols reduce the CPU and memory overhead by functioning like a distance-vector protocol when it comes to processing routing updates; but instead of sending out periodic updates like a distance-vector protocol, hybrid routing protocols send out incremental, reliable updates via multicast messages, providing a more network- and router-friendly environment.
That\’s all for this tutorial. If you like this tutorial, please don\’t forget to share it with friends through your favorite social site.
Prerequisites for 200-301
200-301 is a single exam, consisting of about 120 questions. It covers a wide range of topics, such as routing and switching, security, wireless networking, and even some programming concepts. As with other Cisco certifications, you can take it at any of the Pearson VUE certification centers.
The recommended training program that can be taken at a Cisco academy is called Implementing and Administering Cisco Solutions (CCNA). The successful completion of a training course will get you a training badge.
Full Version 200-301 Dumps