distance vector routing algorithm program in java

In addition to updating their list of distances when they receive updates, the nodes need to keep track of which node told them about the path that they used to calculate the cost, so that they can create their forwarding table.After every node has exchanged a few updates with its directly connected neighbors, all nodes will know the least-cost path to all the other nodes.B records that it can reach E at a cost of 2 by going through A.) ( node B learns from A that node E can be reached at a cost of 1 B also knows it can reach A at a cost of 1, so it adds these to get the cost of reaching E by means of A. If any of the recipients of the information from A find that A is advertising a path shorter than the one they currently know about, they update their list to give the new path length and note that they should send packets for that destination through A.( for example, A sends its information to its neighbors B,C,E, and F. Every node sends a message to its directly connected neighbors containing its personal list of distance.Note that each node only knows the information in one row of the table. We can represent each node's knowledge about the distances to all other nodes as a table like the one given in Table 1. Initial distances stored at each node(global view). A link that is down is assigned an infinite cost.The starting assumption for distance-vector routing is that each node knows the cost of the link to each of its directly connected neighbors.

: Each node constructs a one-dimensional array containing the 'distances'(costs) to all other nodes and distributes that vector to its immediate neighbors.

Distance vector routing algorithm program in java