DISTANCE VECTOR ROUTING
Distance Vector Routing Algorithm The Distance Vector Routing algorithm generates the routing tables for each router. The steps of the algorithm are as follows. STEP 01: Each router prepares its routing table using the knowledge of its immediate neighbor. STEP 02: Each router exchanges its distance vector obtained in Step-01 with its neighbors. After exchanging the distance vectors, each router prepares a new routing table. To understand these steps, we will consider the internetwork as shown below. Initially, the routing tables were empty. The first step states that Each router prepares its routing table using the knowledge of its immediate neighbor. The routing tables will get updated based on the knowledge of the distance of routers directly connected to it. Consider the A’s routing table. The image below shows the A’s routing table after executing the first step. The first row states that to transmit the data from A to A, it needs a distance ...