230 likes | 376 Views
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
E N D
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 • QoSMultirouting
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
QoS path computation • Lexicographic-lightest path
QoS Hop-by-hop routing • Nonoptimality When Isotonicity Fails