1 / 10

Routing algorithms

Routing algorithms. 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.

kelly-kirk
Télécharger la présentation

Routing algorithms

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Routing algorithms

  2. 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

  3. 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

More Related