1 / 9

Link Reversal Routing Algorithm: Directing Routes Efficiently

Explore how the Link Reversal Routing Algorithm determines optimal routes for specific destinations. Learn about the directed acyclic graph maintenance and link reversal process for efficient routing.

imogenet
Download Presentation

Link Reversal Routing Algorithm: Directing Routes Efficiently

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. Link Reversal Routing

  2. “Full” Link Reversal Algorithm • The algorithm determines routes to one specific destination • When there are multiple destination, one instance of the algorithm is used for each destination separately • These slides focus on one instance of the algorithm • In the example that follows, D is the chosen destination

  3. Link Reversal Algorithm A B F Links are bi-directional But algorithm imposes logical directions on them C E G Maintain a directed acyclic graph (DAG) for each destination, with the destination being the onlysink This DAG is fordestination node D D

  4. Link Reversal Algorithm A B F C E G Link (G,D) broke D Any node, other than the destination, that has no outgoing links reverses all its incoming links. Node G has no outgoing links

  5. Link Reversal Algorithm A B F C E G Represents a link that was reversed recently D Now nodes E and F have no outgoing links

  6. Link Reversal Algorithm A B F C E G Represents a link that was reversed recently D Now nodes B and G have no outgoing links

  7. Link Reversal Algorithm A B F C E G Represents a link that was reversed recently D Now nodes A and F have no outgoing links

  8. Link Reversal Algorithm A B F C E G Represents a link that was reversed recently D Now all nodes (other than destination D) have an outgoing link

  9. Link Reversal Algorithm A B F C E G D DAG has been restored with only the destination as a sink

More Related