A size-based scheduling approach to improve fairness over 802 . 11 wireless networks
A size-based scheduling approach to improve fairness over 802 . 11 wireless networks
复制标题
DOI：
--
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
Diego Ferrero;G. Urvoy-Keller
中科院分区：
文献类型：
--
作者：
Diego Ferrero;G. Urvoy-Keller
Fairness over 802.11 wireless networks has been studied by several researchers. Most solutions involve modifications of the MAC protocol, e.g. [4], but only few work has focused on fairness at the TCP level. In [11], the authors study the unfairness between simultaneous TCP uploads and downloads for the case of a multi-hop ad-hoc network connected to the wired Internet. They propose to replace the FIFO scheduling discipline at the MAC layer by a non work-conserving discipline that accounts for the level of contention experienced previously by a node. Their solution addresses the exposed node problem. In [10], a RED-based solution that involves the cooperation of neighboring nodes is proposed to enforce fairness among TCP flows. In [9], the authors focus on the case of an 802.11 hotspot with simultaneous uploads and downloads. They propose to enforce fairness by adjusting the advertised window of TCP connections. More generally, it has been observed that the size of the advertised window of TCP greatly impacts the performance and consequently the achievable fairness [1]. Experimental studies, e.g. [2, 5], have confirmed the impact of the advertised window on the performance of TCP. In [3], the authors study the optimal advertised window for TCP and a chain topology. In this work, we propose to replace the FIFO policy by LAS (Least Attained Service [6], page 172). LAS has been shown to solve most of the fairness issues faced by TCP in a wired environment [8]. With the present work, we aim at investigating the ability of LAS to solve some of the fairness issues encountered in wireless environment using simulations in ns2.
