Development of distance-vector routing
RIP is an interior gateway protocol, so it can be used in local area networks (LANs) on interior or border routers. Routers with RIPv1 implementation exchange their routing tables with neighbouring routers by broadcasting a RIPv1 packet every 30 second into all connected networks.
How do you find the distance vector routing algorithm?
With the Distance Vector Routing algorithm, the node x contains the following routing information:
- For each neighbor v, the cost c(x,v) is the path cost from x to directly attached neighbor, v.
- The distance vector x, i.e., Dx = [ Dx(y) : y in N ], containing its cost to all destinations, y, in N.
What is an example of a distance vector routing protocol?
RIP, IGRP and EIGRP are examples. A distance vector protocol routinely sends its neighboring routers copies of its routing tables to keep them up-to-date. Distance vector protocols date back to the ARPAnet network in the early 1970s.
