1 / 16

Presented by H. Han ECE at UMass-Amherst

TCP Networks Stabilized by Buffer-Based AQMs Huaizhong Han, C. V. Hollot, Yossi Chait (University of Massachusetts at Amherst), Vishal Misra (Columbia University) Thanks to NSF Grant #ANI-0125979. Presented by H. Han ECE at UMass-Amherst. router. Buffer-based AQM. Internet. Background (I).

willa-poole
Télécharger la présentation

Presented by H. Han ECE at UMass-Amherst

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. TCP Networks Stabilized by Buffer-Based AQMsHuaizhong Han, C. V. Hollot, Yossi Chait (University of Massachusetts at Amherst), Vishal Misra (Columbia University)Thanks to NSF Grant #ANI-0125979 Presented by H. Han ECE at UMass-Amherst INFOCOM'04

  2. router Buffer-based AQM Internet Background (I) TCP TCP INFOCOM'04

  3. x fwd delay q aqm router AQM bwd delay p Background (II) x q p AQM tcp sources u lpf lpf INFOCOM'04

  4. Network Congestion TCP congested links TCP INFOCOM'04

  5. x R(s) tcp sources aqm routers RT(-s) u p Linearized Model of Network Congestion lpf INFOCOM'04

  6. buffer based rate based G(s) Linear Stability R(s) AQM routers F(s) RT(-s) TCP INFOCOM'04

  7. Im not encircling -1+j0linear closed-loop stability Generalized Nyquist Theorem Re -1+j0 INFOCOM'04

  8. Main Result (I) routinggain INFOCOM'04

  9. Illustration (two-source, two links) INFOCOM'04

  10. Re -1+j0 Main Result (II) Im linear closed-loop stability INFOCOM'04

  11. Impact of Routing Matrix R (I) INFOCOM'04

  12. Impact of Routing Matrix R (II) INFOCOM'04

  13. Network Simulation INFOCOM'04

  14. Uncertainty in Routing Gain measure of routing gain uncertainty m = # of tcp sources n = # of congested liks A = binary full rank matrices robustness decreases with # of tcp sources and congested links INFOCOM'04

  15. Contribution of Work • Stability condition for buffer-based AQMs • RED, REM, PI … • Connection between routing and stability • “Gain of Routing” as robustness measure -expressed in terms of numbers of sources and links. INFOCOM'04

  16. Future Research • In practice how many congested links do sources • encounter? • Do present routing algorithms result in specific pattern of routing matrices R(0)? For example: how does shortest-path routing impact congestion control? INFOCOM'04

More Related