1 / 17

Quality of Service Based Routing

Quality of Service Based Routing. Ziv Kedem. Introduction. QoS Routing can improve network performance The price is an increase in protocol and computational complexity Stale link information can degrade network performance. QoS Routing. Free. Busy. Very Busy. Stale Link Information.

kdeane
Download Presentation

Quality of Service Based Routing

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. Quality of Service Based Routing Ziv Kedem

  2. Introduction • QoS Routing can improve network performance • The price is an increase in protocol and computational complexity • Stale link information can degrade network performance

  3. QoS Routing Free Busy Very Busy

  4. Stale Link Information

  5. Topics of Discussion • Different routing policies • Protocol overhead • Performance analysis • Processing cost • Improvements

  6. Different Routing Policies • Static / dynamic routing • Clamp-down timer • Quantization of values • Pruning / no pruning

  7. Protocol Overhead • Large value of clamp-down timer can decrease overhead • Overhead can be similar to OSPF • Quantization has little effect on the number of updates

  8. Protocol Overhead

  9. Performance Analysis • Large values of clamp-down timer • Comparison with static QoS routing • Non-pruning policies are more stable • Quantization introduces ties

  10. Performance Analysis

  11. Improvements • Randomization • Depends on length and width • Useful in hot-spot traffic • Hybrid solution • Long lived flows are more stable • No need for explicit flow request

  12. Randomization

  13. Improvements • Randomization • Depends on length and width • Useful in hot-spot traffic • Hybrid solution • Long lived flows are more stable • No need for explicit flow request

  14. Hybrid Solution

  15. Processing Cost • Calculation for each flow request is expensive • Pre-computation • Periodic • On each update

  16. Processing Cost

  17. Conclusions • QoS routing can improve network performance • Large clamp down timer is necessary • Stale link information requires use of stable policies • Randomization / hybrid solutions can improve performance

More Related