An Improved Distance Vector Routing Protocol

DVR Protocol presents the routes as distance vector and direction vector. The distance is represented as hop count and metrics while the direction is represented as the exit interface. In distance vector routing, Bellman Ford algorithm is used to calculate the path while the nodes takes the position of the links and the vertices. Talking about distance vector routing, in reaching its destination, a certain distance vector is maintained in the entire node used in the network. How can distance vector such as EIGRP and RIP be applied to improve an existing organisation's network?