A scheduling algorithm for improving fairness between uplink TCP flows

Authors:
Xueyong Li;Jiawei Huang;Jianxin Wang;Jin Ye
Affiliations:
School of Information Science and Engineering, Central South University, ChangSha, China and Department of Mathematics and Information Science, Changsha University, Changsha, China;School of Information Science and Engineering, Central South University, ChangSha, China and College of Computer and Engineering, Hunan Radio TV University, Changsha, China;School of Information Science and Engineering, Central South University, ChangSha, China;College of Information Science and Engineering, Guilin university of Electronic Technology, Guilin, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 4
Cited 0

Analysis of the increase and decrease algorithms for congestion avoidance in computer networks

Computer Networks and ISDN Systems
Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
A rate-adaptive MAC protocol for multi-Hop wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Significant TCP unfairness in wireless local networks has been reported during the past several years. This unfairness results from the greedy TCP protocol and shared wireless medium. To solve the unfairness problem between uplink TCP flows, we proposed a scheduling algorithm called Uplink Weighted Fair Queueing (UWFQ). By adjusting the service weight of ACK packets, UWFQ achieves the channel adaptive fairness between uplink TCP flows. Analysis and simulation results show that UWFQ not only improves the fairness greatly, but also achieves higher total network throughput.