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
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
Web servers under overload: How scheduling can help
ACM Transactions on Internet Technology (TOIT)
Combining opportunistic and size-based scheduling in wireless systems
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
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
Impact of size-based scheduling on flow level performance in wireless downlink data channels
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Least attained recent service for packet scheduling over wireless LANs
WOWMOM '10 Proceedings of the 2010 IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
Size-based scheduling to improve the performance of short TCP flows
IEEE Network: The Magazine of Global Internetworking
A spike-detecting AQM to deal with elephants
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Size-based scheduling methods receive a lot of attention as they can greatly enhance the responsiveness perceived by the users. In effect, they give higher priority to small interactive flows which are the important ones for a good user experience. In this paper, we propose a new packet scheduling method, Early Flow Discard (EFD), which belongs to the family of Multi-Level Processor Sharing policies. Compared to earlier proposals, the key feature of EFD is the way flow bookkeeping is performed as flow entries are removed from the flow table as soon as there is no more corresponding packet in the queue. In this way, the active flow table remains of small size at all times. EFD is not limited to a scheduling policy but also incorporates a buffer management policy. We show through extensive simulations that EFD retains the most desirable property of more resource intensive size-based methods, namely low response time for short flows, while limiting lock-outs of large flows and effectively protecting low/medium rate multimedia transfers.