1 / 23

Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet

Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet. Outline. Introduction and Contribution An algebra for QoS path problems QoS path computation QoS Hop-by-hop routing QoS Multirouting. Introduction. Shortest path routing: Dijkstra’s Algorithm

tyne
Télécharger la présentation

Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet

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. Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet

  2. Outline • Introduction and Contribution • An algebra for QoS path problems • QoS path computation • QoS Hop-by-hop routing • QoSMultirouting

  3. Introduction • Shortest path routing: Dijkstra’s Algorithm • Hop-by-hop routing: local, depending on destination only • For QoS, both have limitations • Contribution 1) Revise Dijkstra’s algorithm 2) Eliminate loop in hop-by-hop routing

  4. An algebra for QoS path problems

  5. Notations

  6. QoS path computation • Lexicographic-lightest path

  7. S-lightest path

  8. A generalized Dijkstra’s Algorithm

  9. QoS Hop-by-hop routing • Nonoptimality When Isotonicity Fails

More Related