Routing Protocol

What does Routing Protocol mean?

A routing protocol uses software and routing algorithms to determine optimal network data transfer and communication paths between network nodes. Routing protocols facilitate router communication and overall network topology understanding. A routing protocol is also known as a routing policy.

Routing Protocol Evolution

What does Dynamic Routing mean?

Dynamic routing is a networking technique that provides optimal data routing. Unlike static routing, dynamic routing enables routers to select paths according to real-time logical network layout changes. In dynamic routing, the routing protocol operating on the router is responsible for the creation, maintenance and updating of the dynamic routing table. In static routing, all these jobs are manually done by the system administrator.

Dynamic routing uses multiple algorithms and protocols. The most popular are Routing Information Protocol (RIP) and Open Shortest Path First (OSPF).

 

What is IGP (Interior Gateway Protocol)? 

An IGP (Interior Gateway Protocol) is a protocol for exchanging routing information between gateways (hosts with routers) within an autonomous network (for example, a system of corporate local area networks). The routing information can then be used by the Internet Protocol (IP) or other network protocols to specify how to route transmissions. 

What is distance vector routing protocol? 

Distance Vector Routing Protocol (DVRP) is one of two major routing protocols for communications methods that use data packets sent over Internet Protocol (IP). DVRP requires routing hardware to report the distances of various nodes within a network or IP topology in order to determine the best and most efficient routes for data packets.

Examples of distance-vector routing protocols:

Routing Information Protocol (RIP).

Routing Information Protocol Version 2 (RIPv2).

Routing Information Protocol Next Generation (RIPng), it is an extension of RIP version 2 with support for IPv6.

Interior Gateway Routing Protocol (IGRP).

What is link state routing protocol?

In link-state routing protocols, each router possesses information about the complete network topology. Each router then independently calculates the best next hop from it for every possible destination in the network using local information of the topology. The collection of best-next-hops forms the routing table.

Link state protocols, sometimes called shortest path first or distributed database protocols, are built around a well-known algorithm from graph theory, E. W. Dijkstra'a shortest path algorithm. 

Examples of link state routing protocols are:

Open Shortest Path First (OSPF) for IP.

The ISO's Intermediate System to Intermediate System (IS-IS).

 

 

Rishav

Author & Editor

About Me