Throughput-optimal scheduling has been heavily investigated given its ability to fully utilize network resources and maintain network stability. Most of the existing throughput-optimal algorithms, including the classic queue-length based MaxWeight algorithm and flow-delay-based MaxWeight algorithm, however, may bring a severe unfairness problem when scheduling transmission control protocol (TCP) controlled flows. As TCP is the dominant transport layer protocol in the Internet and it controls the majority of Internet traffic, we study how to design the scheduling algorithm that can ensure both throughput optimality and be compatible to TCP flows. In this paper, we analyze the reason behind the incompatibility between the existing scheduling algorithms and TCP, and then investigate the properties of the head-of-line access delay-based scheduling algorithm (HOLD) we proposed. We prove that the proposed HOLD can fairly schedule TCP flows in wireless networks with time-varying channel conditions and achieve throughput optimality with flow-level dynamics. Simulations using OMNeT++ 4 have been conducted to validate our analytical results, and compare the performance of different scheduling algorithms comprehensively.
['Yi Chen', 'Xuan Wang', 'Lin Cai']
On Achieving Fair and Throughput-Optimal Scheduling for TCP Flows in Wireless Networks