XSelect a record to create:
5 Popular Routing Protocols
Published on 02/23/2016 | IoT Index
There are hundreds of different network protocols that support the communication between computers or other electronic devices. Routing protocols are in the family of network protocols and enable computer routers to communicate with each other. Therefore, they are able to intelligently forward traffic between their respective networks.
How do Routing Protocols work?
All Routing Protocols perform three very basic functions:
1. Discovery - they identify other routers on the network
2. Route Management - they keep track of all the possible destinations (for network messages) along with some data describing the pathway of each
3. Path Determination - they make dynamic decisions for where to send each network message
A few routing protocols(called link state protocols) enable a router to build and track a full map of all network links in a region while others (called distance vector protocols) allow routers to work with less information about the network area.
Researchers developed Routing Information Protocol in the 1980s for use on small- or medium-sized internal networks that connected to the early Internet. RIP is capable of routing messages across networks up to a maximum of 15 hops. RIP-enabled routers discover the network by first sending a message requesting router tables from neighboring devices. Neighbor routers running RIP respond by sending the full routing tables back to the requestor, whereupon the requestor follows an algorithm to merge all of these updates into its own table. At scheduled intervals, RIP routers then periodically send out their router tables to their neighbors so that any changes can be propagated across the network. Traditional RIP supported only IPv4 networks but the newer RIPng standard also supports IPv6. RIP utilizes either UDP ports 520 or 521 (RIPng) for its communication.
Open Shortest Path First was created to overcome some of its limitations of RIP including the 15 hop count restriction the inability to organize networks into a routing hierarchy, important for manageability and performance on large internal networks the significant spikes of network traffic generated by repeatedly re-sending full router tables at scheduled intervals. As the name suggests, OSPF is an open public standard with widespread adoption across many industry vendors. OSPF-enabled routers discover the network by sending identification messages to each other followed by messages that capture specific routing items rather than the entire routing table. It is the only link state routing protocol listed in this category.
3. EIGRP and IGRP
Cisco developed Internet Gateway Routing Protocol as another alternative to RIP. The newer Enhanced IGRP (EIGRP) made IGRP obsolete starting in the 1990s. EIGRP supports classless IP subnets and improves the efficiency of the routing algorithms compared to older IGRP. It does not support routing hierarchies, like RIP. Originally created as a proprietary protocol runnable only on Cisco family devices. EIGRP was designed with the goals of easier configuration and better performance than OSPF.
The Intermediate System to Intermediate System protocol functions similarly to OSPF. While OSPF became the more popular choice overall, IS-IS remains in widespread use by service providers who have benefitted from the protocol being more easily adaptable to their specialized environments. Unlike the other protocols in this category, IS-IS does not run over Internet Protocol (IP) and uses its own addressing scheme.
5. BGP and EGP
The Border Gateway Protocol is the Internet standard External Gateway Protocol (EGP). BGP detects modifications to routing tables and selectively communicates those changes to other routers over TCP/IP. Internet providers commonly use BGP to join their networks together. Additionally, larger business sometimes also use BGP to join together multiple of their internal networks. Professionals consider BGP the most challenging of all routing protocols to master due to its configuration complexity.