Distance Vector Routing Algorithm
We first discuss distance vector routing. This method sees an AS, with all routers and networks, as a graph, a set of nodes and lines (edges) connecting the nodes. A router can normally be represented by a node and a network by a link connecting two nodes, although other representations are also possible. The graph
Distance Vector Routing Algorithm Read More »

