Download
1 / 10
100 likes | 180 Views
This text compares Link State (LS) and Distance Vector (DV) routing algorithms based on message complexity, convergence speed, and robustness. LS is more complex due to sending link changes to all nodes, while DV only sends messages for new cost paths. DV converges slower, encountering the "count to infinity" issue and spread of errors. LS is more robust as each node calculates its own routes, unlike DV where errors propagate network-wide.
E N D
D(v): the cost from the source node to destination that has currently the least cost. p(v): previous node along current least cost path from source to dest. N: set of nodes whose shortest path from the source is definitively known
Comparison between algorithms • Message complexity • LS is more complex since changes in the links needs to be sent to all nodes. • DV sends message only if the new link cost results in a changed cost path for nodes attached to that link. • Speed of convergence • DV converges slower. • DV do not scale well because of the "count to infinity problem”. • Robustness • DV is less robust since an incorrect node calculation can spread through the whole network. • LS is more robust since each node only calculus it's own routes. LS: Link state algorithm DV: Distance vector algorithm
