1 / 36

Smart forwarding technique for routing with multiple QoS constraints

Smart forwarding technique for routing with multiple QoS constraints. Fei, A.; Gerla, M. Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA. Outline. Introduction Smart forwarding Qos metrics Classification and Definition Routing Algorithms Based On Smart Forwarding

herman
Download Presentation

Smart forwarding technique for routing with multiple QoS constraints

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. Smart forwarding technique for routing with multiple QoS constraints Fei, A.; Gerla, M.Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA

  2. Outline • Introduction • Smart forwarding • Qos metrics Classification and Definition • Routing Algorithms Based On Smart Forwarding • Simulation Results • Conclusion

  3. Introduction • QoS-constrained routing is a key components to support QoS in next-generation data networks • QoS routing consists of finding paths subject to different often multiple Qos constraints to satisfy application requirements. • Optimal routing problem subject to multiple constraints is NP-hard

  4. Introduction (cont.) • Some heuristic algorithms only find an approximate solution by considering one metric. • Some research in this area .There is an effort to extend OSPF routing protocol .

  5. Introduction (cont.) Routing approaches : • Centralized source-based routing (ex:RSVP) • Distributed hop-by-hop

  6. Smart forwarding • Construction an end-to-end path. • Make smart decision on select next hop to satisfy the constraints and min cost . • Crank-back approach • Flooding forwarding

  7. Smart forwarding (cont.) • Use a pre-computed table (updated periodically) • Can be applied in a centralized source-based routing and distributed hop-by-hop

  8. Qos metrics Classification and Definition

  9. Qos metrics Classification and Definition (cont.) Operator : Addition (+)

  10. Qos metrics Classification and Definition (cont.) Operator : transitive (⊕)

  11. Qos metrics Classification and Definition (cont.) Operator : multiplicative (⊕)

  12. Qos metrics Classification and Definition (cont.) Qos descriptor : QD Qos Requirement : QR

  13. Qos metrics Classification and Definition (cont.)

  14. Qos metrics Classification and Definition (cont.)

  15. Qos metrics Classification and Definition (cont.)

  16. Routing Algorithms Based On Smart Forwarding Problem statement • Find a path “p” from source S to destination D such that : • QR<=QD(p) • C(p)<=C(p’) for any p’ with QR<=QD(p’)

  17. Smart Flooding (0) S D Routing message

  18. Smart Flooding (1) NO path satisfy S failure D DROP

  19. Smart Flooding (2) path AB is good path BD is good S ACK A B D C

  20. Smart Flooding (3) Success ACK S Select one (best) path D

  21. Smart Flooding (4) Success ACK S get one (best) path S-A-C-D AC is better than ABC A B D C

  22. Bounded Smart Flooding(0) Success ACK Select one (best) path S 5 3 3 D 2 2

  23. Bounded Smart Flooding(1) Success ACK Select one (best) path S If token = 1 , only 1 flood 2 1 1 D 1

  24. Crank-Back (0) Success ACK S FORK node Select one (best) path D

  25. Crank-Back (1) Success ACK S FORK node Select one (best) path failure D

  26. Crank-Back (2) Success ACK S Select one (best) path FORK node1 A B D FORK node2 C E

  27. Crank-Back (3) Success ACK S Select one (best) path FORK node1 A B D FORK node2 C E

  28. Bounded Crank-Back Success ACK S 5 FORK node Select one (best) path 4 D

  29. Bounded Crank-Back(cont.) Success ACK S 5 FORK node Select one (best) path failure 3 D

  30. Source-Base Routing • queue floodingcentralized • stackforkhop-by-hop

  31. Computation and Processing Complexity (1) • QD table update :

  32. Computation and Processing Complexity (2)

  33. Simulation results (1)

  34. Simulation results (2)

  35. Simulation results (3)

  36. Conclusion • Flooding based and crank-back based distributed routing environments, and also in centralized source-based routing.

More Related