Distance-vector routing protocol: Difference between revisions

Revision as of 15:30, 13 May 2005

Revision as of 22:11, 16 June 2005

Line 9:

The description below describes a very simple distance-vector routing protocol:

#InitiallyIn the first stages, the router makes a list of which networks it can reach, and how many ''hops'' it will cost. In the outset this will be the two or more networks to which this router is connected. The number of hops for these networks will be 1. This table is called a [[routing table]].

#Periodically (typically every 30 seconds) the routing table is shared with other routers on each of the connected networks via some specified inter-router protocol. These routers will add 1 to every hop-count in the table, as it associates a hop cost of 1 for reaching the router that sent the table. This information is just shared inbetween physically connected routers ("neighbors"), so routers on other networks are not reached by the new routing tables yet.

#A new routing table is constructed based on the directly configured network interfaces, as before, with the addition of the new information received from other routers. The hop-count is used as a cost measure for each path. The table also contains a column stating which router offered this hop count, so that the router knows who is next in line for reaching a certain network.