Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Improving TCP throughput over two-way asymmetric links: analysis and solutions
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
The effects of asymmetry on TCP performance
Mobile Networks and Applications
Improving the performance of interactive TCP applications using service differentiation
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Towards a new internet architecture
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
The War between Mice and Elephants
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Performance analysis of LAS-based scheduling disciplines in a packet switched network
Proceedings of the joint 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
Using the 802.11e EDCF to Achieve TCP Upload Fairness over WLAN Links
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Idle sense: an optimal access method for high throughput and fairness in rate diverse wireless LANs
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
DRR-SFF: A Practical Scheduling Algorithm to Improve the Performance of Short Flows
ICNS '07 Proceedings of the Third International Conference on Networking and Services
Experience with an implementation of the Idle Sense wireless access method
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
An Asymmetric Access Point for Solving the Unfairness Problem in WLANs
IEEE Transactions on Mobile Computing
Improving flow level fairness and interactivity in WLANs using size-based scheduling policies
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Buffer management schemes for supporting TCP in gigabit routers with per-flow queueing
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We consider the case of scheduling packets over access links for which traditional FIFO scheduling leads to significant performance problems especially when flows in opposite directions interfere with each other. We propose a new packet scheduling scheme called Least Attained Recent Service (LARS) that schedules packets by giving higher priority to packets of flows with less transferred traffic over a limited period. LARS is tunable and it can pace flows in opposite directions even if operating only on one side of the link, so it is particularly suitable for deployment in a wireless access point or an ADSL box. It has similar advantages to LAS, but it avoids long connection lock-outs.