Size-based scheduling to improve web performance
ACM Transactions on Computer Systems (TOCS)
Analysis of LAS scheduling for job size distributions with high variance
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Characterizing flows in large wireless data networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Performance modelling and measurements of TCP transfer throughput in 802.11-based WLAN
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Spatio-temporal modeling of traffic workload in a campus WLAN
WICON '06 Proceedings of the 2nd annual international workshop on Wireless internet
The Foreground-Background queue: A survey
Performance Evaluation
An Asymmetric Access Point for Solving the Unfairness Problem in WLANs
IEEE Transactions on Mobile Computing
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Size-based and direction-based TCP fairness issues in IEEE 802.11 WLANs
EURASIP Journal on Wireless Communications and Networking
EFD: an efficient low-overhead scheduler
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
Fast track article: Least attained recent service for packet scheduling over access links
Pervasive and Mobile Computing
| Hi-index | 0.00 |
In this paper, we investigate the use of a size-based scheduling policy, LASTOTAL, inWLANs. A size-based scheduling policy is a priority policy where the priority of a flow is based on its size. LASTOTAL replaces the legacy IP level FIFO scheduler at the access point. The lower protocol layers, and especially the MAC 802.11 layer are left unchanged. We demonstrate using realistic synthetic workloads, that LAS-TOTAL solves the unfairness issue due to DCF in 802.11 WLANs and ensures small response times to the majority of the flows under any load conditions. The latter property is desirable as short flows correspond to interactive applications and maintaining low response times for those flows despite load variations, significantly improves user experience. We also introduce and validate Markovian queuing models to assess the response time of the access point for both FIFO and LASTOTAL.