The effects of asymmetry on TCP performance
Mobile Networks and Applications
Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit
IEEE/ACM Transactions on Networking (TON)
Using the 802.11e EDCF to Achieve TCP Upload Fairness over WLAN Links
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Wireless Communications & Mobile Computing - Radio Link and Transport Protocol Engineering for Future-Generation Wireless Mobile Data Networks
VQ-RED: An Efficient Virtual Queue Management Approach to Improve Fairness in Infrastructure WLAN
LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
TCP fairness issues in IEEE 802.11 wireless LANs
Computer Communications
IEEE Transactions on Wireless Communications
How network asymmetry affects TCP
IEEE Communications Magazine
| Hi-index | 0.00 |
On a bandwidth asymmetric link, such as an ADSL cable or a wireless link over an IEEE802.11-based wireless LAN, TCP flows are likely either data bottlenecked or ACK bottlenecked, where a data (ACK) bottlenecked flow means the one whose ACK (data) segments are rarely lost but data (ACK) segments are frequently lost. The bandwidth asymmetry causes two types of unfairness problems. One is the unfairness between data- and ACK-bottlenecked flows; ACK bottlenecked flows obtain larger bandwidths than data bottlenecked flows. The other is the unfairness among ACK bottlenecked flows; some of ACK bottlenecked flows consume most of bandwidths. In this article, we propose a buffer management scheme, called the ACK pushout, in order to cope with the two types of unfairness problems simultaneously. To improve the unfairness between data- and ACK-bottlenecked flows, the ACK pushout simply removes an ACK segment from the buffer when a data segment arriving at the buffer finds that it is fully occupied. To improve the unfairness among ACK-bottlenecked flows, the ACK pushout discards one of ACK segments of the flow that has the largest number of ACKs in the buffer when an ACK segment arriving at the buffer finds that it is fully occupied. Through extensive simulation experiments by ns2, we verify that the ACK pushout greatly improves the fairness.