1 / 7

Fixed Point Approximations for TCP Behavior in an AQM Network

Fixed Point Approximations for TCP Behavior in an AQM Network. Tian Bu Don Towsley U. Massachusetts. Challenge. explore alternate network configurations prior to deployment/reconfiguration explore alternate active queue management (AQM), congestion control designs Parameter space:

elvis-barker
Download Presentation

Fixed Point Approximations for TCP Behavior in an AQM Network

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. Fixed Point Approximations for TCP Behavior in an AQM Network Tian Bu Don Towsley U. Massachusetts

  2. Challenge • explore alternate network configurations prior to deployment/reconfiguration • explore alternate active queue management (AQM), congestion controldesigns Parameter space: • 100s - 1000s network elements • 10,000s - 100,000s of flows (TCP, UDP, NG)

  3. TCP throughput New Ideas • use of fixed point methods for on-line evaluation of steady-state behavior of large networks handling responsive flows (e.g., TCP) avg. queue length • can also account for • ECN • non-responsive flows (e.g., UDP). • finite duration flows

  4. N TCP flows throughputs {Bi} V bottlenecked RED routers capacities {Cv } avg. queue lengths {xv } discard prob. {pv (xv )} TCP model: Bi({pv }) bottleneck router model iBi({xv}) = Cv , v =1,…,V V equations, V unknowns Fixed Point Approach TCP flow Bi RED router Cv, pv(xv)

  5. Results: single RED router • Scale the RED parameters with N TCP flows N = 20,40,60, 80

  6. Results: tandem network End-to-end loss probability

  7. Future Research • derive the existence and uniqueness • account for imperfect feedback • account for finite duration flow of non-poisson arrival and non-exponentially distributed transfer size

More Related