New directions in traffic measurement and accounting
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
The War between Mice and Elephants
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Two-level processor-sharing scheduling disciplines: mean delay analysis
Proceedings of the joint international conference on Measurement and modeling of computer systems
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
Size-based scheduling to improve the performance of short TCP flows
IEEE Network: The Magazine of Global Internetworking
EFD: an efficient low-overhead scheduler
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
Size-based flow-scheduling using spike-detection
ASMTA'11 Proceedings of the 18th international conference on Analytical and stochastic modeling techniques and applications
WWIC'12 Proceedings of the 10th international conference on Wired/Wireless Internet Communication
Periodic early detection for improved TCP performance and energy efficiency
Computer Networks: The International Journal of Computer and Telecommunications Networking
A spike-detecting AQM to deal with elephants
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Scheduling flows in the Internet has sprouted much interest in the research community leading to the development of many queueing models, capitalizing on the heavy-tail property of flow size distribution. Theoretical studies have shown that ‘size-based' schedulers improve the delay of small flows without almost no performance degradation to large flows. On the practical side, the issues in taking such schedulers to implementation have hardly been studied. This work looks into practical aspects of making size-based scheduling feasible in future Internet. In this context, we propose a flow scheduler architecture comprising three modules — Size-based scheduling, Threshold-based sampling and Knockout buffer policy — for improving the performance of flows in the Internet. Unlike earlier works, we analyze the performance using five different performance metrics, and through extensive simulations show the goodness of this architecture.