Analysis of the Early Flow Discard (EFD) discipline in 802.11 wireless LANs

Size-based scheduling improves data transfer response times by favoring flows at an early stage. Although appealing, these techniques raise concerns as they require to keep track of the volume of data sent by each and every ongoing connections and they may starve long-lived flows even if they use up limited bandwidth. Early Flow Discard (EFD) scheduling addresses these issues and we present its adaptation to infrastructure 802.11 networks where the access point downlink queue naturally builds up. To deal with this problem, EFD needs to take into account bi-directional traffic, so that it effectively controls uploads and downloads even though EFD applies to the downlink buffer only. It appears that even with limited buffers, which translates into limited memory of flows for EFD, the most simple flavor of bidirectional EFD -a simple pair of FIFO queues and tracking flow transferred volumes with a packet granularity-enables to rip the full benefit of size-based scheduling, without any of the aforementioned drawbacks.

[1]  Guillaume Urvoy-Keller,et al.  Performance analysis of LAS-based scheduling disciplines in a packet switched network , 2004, SIGMETRICS '04/Performance '04.

[2]  Guillaume Urvoy-Keller,et al.  On Profiling Residential Customers , 2011, TMA.

[3]  Guillaume Urvoy-Keller,et al.  Least attained recent service for packet scheduling over wireless LANs , 2010, 2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM).

[4]  Robert B. Cooper,et al.  Queueing systems, volume II: computer applications : By Leonard Kleinrock. Wiley-Interscience, New York, 1976, xx + 549 pp. , 1977 .

[5]  Prasun Sinha,et al.  Understanding TCP fairness over wireless LAN , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[6]  Marco Bottigliengo,et al.  Short-term fairness for TCP flows in 802.11b WLANs , 2004, IEEE INFOCOM 2004.

[7]  Yan Grunenberger,et al.  An Asymmetric Access Point for Solving the Unfairness Problem in WLANs , 2008, IEEE Transactions on Mobile Computing.

[8]  Guillaume Urvoy-Keller,et al.  Layer 2 vs. layer 3 mechanisms for improving TCP performance in 802.11 wireless LANs , 2009, 2009 21st International Teletraffic Congress.

[9]  Jonathan Chan,et al.  Computer applications , 1986 .

[10]  Guillaume Urvoy-Keller,et al.  EFD: An Efficient Low-Overhead Scheduler , 2011, Networking.

[11]  Christian M. Ernst,et al.  Multi-armed Bandit Allocation Indices , 1989 .

[12]  J. Bather,et al.  Multi‐Armed Bandit Allocation Indices , 1990 .

[13]  Wushow Chou,et al.  Queueing Systems, Volume II: Computer Applications - Leonard Kleinrock , 1977, IEEE Transactions on Communications.

[14]  Konstantin Avrachenkov,et al.  Differentiation between short and long TCP flows: predictability of the response time , 2004, IEEE INFOCOM 2004.

[15]  Guillaume Urvoy-Keller,et al.  LAS scheduling to improve the performance of short TCP Flows , 2004 .

[16]  Guillaume Urvoy-Keller,et al.  Improving flow level fairness and interactivity in WLANs using size-based scheduling policies , 2008, MSWiM '08.

[17]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[18]  Songwu Lu,et al.  Characterizing flows in large wireless data networks , 2004, MobiCom '04.

[19]  Mor Harchol-Balter,et al.  Web servers under overload: How scheduling can help , 2006, TOIT.

[20]  Leonard Kleinrock,et al.  Mean Packet Queueing Delay in a Buffered Two-User CSMA/CD System , 1985, IEEE Trans. Commun..

[21]  Marco Bottigliengo,et al.  Enhancing Fairness for Short-Lived TCP Flows in 802.11b WLANs , 2007, IEEE Transactions on Vehicular Technology.