Distance Vector Routing
Distance Vector Routing is one of the two types of routing protocols in which each router informs its neighbor of its routing table. Basically, Distance Vector protocols reveals the best path on how far the destination is, whereas the Link State protocols, which is the other type of routing protocol, is capable of using more refined methods in context of the link variables, such as delay, bandwidth, reliability and load. Distance Vector protocols judge best path on how far the objective is. Distance can be leaps or a combination of metrics calculated to represent the distance value. Routing Information Protocol (RIP v1 and v2) and Interior Gateway Routing Protocol (IGRP C developed by Cisco) are some of the IP Distance Vector routing protocols which are still being used.
A very simple distance-vector routing protocol works as follows:
1. A first, the router makes a list of which networks are achievable for it, and how many hops it will cost. In this way two or more networks are connected to this router. There would be only one hop for this network. This table is known as routing table.
2. Secondly the routing table is joint with other routers on each of the connected networks through some particular inter-router protocol. This data is only joint in between physically connected routers, so routers on other networks are not accessed by the new routing tables yet.
3. The new routing table is made originating on the directly configured network interfaces with the inclusion of the new information received from all the other routers.
4. All the corrupt routing paths are then cleansed out from the newly made routing table. If there are two similar paths to the same network then only the one with the smallest and the briefest hop-count is kept.