1 / 26

TCP over 802.11e Doug Leith & Peter Clifford Hamilton Institute, Ireland.

TCP over 802.11e Doug Leith & Peter Clifford Hamilton Institute, Ireland. Overvie w Known that 802.11b TCP uploads exhibit unfairness and sustained lockout. Known that 802.11b unfairness exists between uploads and downloads.

ciqala
Download Presentation

TCP over 802.11e Doug Leith & Peter Clifford Hamilton Institute, Ireland.

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 over 802.11e Doug Leith & Peter Clifford Hamilton Institute, Ireland.

  2. Overview • Known that 802.11b TCP uploads exhibit unfairness and sustained lockout. • Known that 802.11b unfairness exists between uploads and downloads. • Setting 802.11e parameters correctly resolves these problems. • Analytic model of the MAC behaviour of the solution. • Model TCP dynamics in an arbitrary WLAN. • Round Trip Time unfairness for uploads disappears when WLAN is bottleneck. • Convergence rate calculations for competing TCP flows possible. • Setup • 802.11b/e, single cell, infrastructure mode, DCF, TCP SACK, saturated TCP. • Applicable to any situation where WLAN is the bottleneck.

  3. AP Upload ACKs Upload data TCP Upload Unfairness in 802.11b • Usual 802.11b unfairness between upload data and upload ACKs: • MAC ensures fair channel access: Upload data wins n/(n+1) of transmission opportunities, Upload ACKs win only 1/(n+1)  Very few ACKs get through. • AP queue (which is relatively underprovisioned) overflows, drops occur. • [Pilosof, Ramjee, Shavitt, Sinha, INFOCOM 2003] • TCP specific unfairness between competing flows in the same direction: • ACK clocking disrupted, burstiness increased • Congestion window growth hampered • Possible exponential increase in retry timer  flow gets locked out. • [Detti, Graziosi, Minichiello, Salsano, Sangregorio]

  4. TCP Upload Unfairness in 802.11b

  5. Restoring Upload Fairness using 802.11e • Prevent loss of much more ACKs than data: • Use separate queues for ACKs and data, • Set 802.11e AIFS parameter to highly prioritise the queue containing ACKs. • No ACK overload as they are created & limited by data. • High priority will prevent any ACK queues from filling and avoid concerns about correct queue provisioning.

  6. Restoring Upload Fairness using 802.11e

  7. Advantages of the solution ACK prioritisation essentially decouples MAC layer contention from transport layer congestion control. Throughput only slightly reduced. Expected normal TCP behaviour restored. CWmin parameter still available for differential prioritisation of TCP flows.

  8. Analytic MAC Model • Although TCP traffic is not saturated, the rate of ACKs is matched to the rate of data packets. Can use this fact to extend Bianchi type model fairly easily: Assume that a data packet is immediately followed by its TCP ACK, and that the TCP ACK is never involved in a collision. • Agrees well with simulation • ACKs never colliding is not a legitimate assumption (e.g. ACK arrives after data packet has already counted down a lot) • Better to extend Battiti & Li model by using a hold state which data must count down through if there is a TCP ACK present. Replace TCP ACK saturation assumption with rate matching assumption. • Both models easily adjusted to delayed ACK case.

  9. Analytic MAC Model

  10. Analytic MAC Model

  11. TCP Unfairness between uploads and downloads in 802.11b

  12. Restoring Fairness between uploads and downloads using 802.11e • At AP: • Use separate queues for TCP data, • Determine current number nd of destination stations, • Use 802.11e TxOP burst parameter to send first packet to each of the destination stations whenever the AP gains medium access. • Must prioritise the download ACKs using AIFS to avoid same problems as before. • Accommodates both bursty short lived traffic and long lived traffic. • If time sensitive traffic present can use CWmin parameter also to give higher priority smaller bursts. • Can apply Battiti & Li model to calculate correct value of CWmin for the • download ACKs.

  13. Restoring Fairness between uploads and downloads using 802.11e

  14. TCP Congestion Window Model Assumptions • Station interface queues are large enough so that they do not empty when a TCP flow backs off its congestion window following packet loss: • Wireless stations always saturated. • Activity on medium is decoupled from the congestion window size. • The wireless link provides stochastic service: • Random packet losses. • Service and loss rates independent of congestion window size.

  15. TCP Congestion Window Evolution Model [A. Berman, R. Shorten, D. Leith, “Positive Matrices Associated with Synchronised Communications Networks”, Linear Algebra and its Applications 393, 2004]

  16. TCP Congestion Window Evolution Model

  17. TCP congestion window evolution model • Positive real eigenvalues, • Unique largest eigenvalue = 1, • Network dynamics globally exponentially stable, • Equilibrium point equal to eigenvector of eigenvalue 1, • Equilibrium value of congestion window of flow i is • Convergence rate of mean congestion windows bounded above by largest • mean backoff factor.

  18. WLAN bottleneck: Throughput When the WLAN is the bottleneck, the throughput achieved by the competing TCP upload flows is independent of the TCP AIMD parameters:

  19. Varying bottleneck: Upload RTT Fairness When the bottleneck is the WLAN, normal upload TCP Round Trip Time unfairness does not occur.

  20. Varying bottleneck: Changing upload fairness When the bottleneck varies in location, a sharp transition in behaviour occurs.

  21. Convergence Rate: Downloads • Convergence rate is the time that the network takes to reach steady state following • a disturbance. • Download TCP flows’ convergence rate is determined by the AIMD backoff factor. Usual TCP backoff factor .5: Model predicts 4 congestion epochs to convergence.

  22. Convergence Rate: Downloads Unusual TCP backoff factor .8: Model predicts 14 congestion epochs to convergence.

  23. Convergence Rate: Uploads, WLAN bottleneck Instant convergence independent of backoff factor. E.g. backoff factor .5:

  24. Convergence Rate: Uploads, WLAN bottleneck Instant convergence independent of backoff factor. E.g. backoff factor .95:

  25. Conclusions • Using the power of 802.11e and the correct choice of parameters we can restore TCP fairness and expected TCP behaviour to both uploads and downloads. • Analytic MAC model presented. • In any similar asymmetric TCP situation, ACKs should be prioritised. • Modelled TCP dynamics in an arbitrary WLAN. • Round Trip Time unfairness for uploads disappears when WLAN is the bottleneck. • Convergence rate calculations for competing TCP flows possible. • Instant convergence for uploads when WLAN is the bottleneck. • Publications • Modelling TCP Dynamics in Wireless Networks [Wirelesscom 2005]. • TCP Fairness in 802.11e WLANs [Wirelesscom 2005]. • Using the 802.11e EDCF to Achieve TCP Upload Fairness Over WLAN Links [WiOpt 05].

  26. Ongoing Work Mixed voice and data. Results verified experimentally. [D. Malone, A. Ng, D. Leith, SIGCOMM E-WIND ‘05] Prioritisation using CWmin:

More Related