Priority scheduling algorithm to improve short-term fairness for TCP flows in WLAN
Xiaofei Guo, Ge Wei-min, Zhigang Jin, Kang Yang · 2011
There is an unfairness between long-term TCP flows and short-term TCP flows because of the single queue and first-in-first-out scheduling algorithm in access point (AP) in WLAN. This paper suggests a priority scheduling algorithm. In the algorithm AP maintains one queue with a timer for each TCP flow. The scheduled orders of queues are based on values of timers. Network Simulator (NS) is used to simulate the algorithm Simulation results show that data transfer volume of short-term TCP flows is increased and RTT of short-term TCP flows is also reduced without significantly impairing the throughput of long-term TCP flows by the priority scheduling algorithm. The algorithm can improve the fairness between long-term and short-term TCP flows.