A Flow Scheduler Architecture

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01056318
Contributor : Hal Ifip <>
Submitted on : Monday, August 18, 2014 - 3:33:37 PM
Last modification on : Thursday, February 7, 2019 - 2:34:52 PM
Long-term archiving on : Thursday, November 27, 2014 - 5:31:43 AM

File

main.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Dinil Mon Divakaran, Giovanna Carofiglio, Eitan Altman, Pascale Vicat-Blanc Primet. A Flow Scheduler Architecture. 9th International IFIP TC 6 Networking Conference (NETWORKING), May 2010, Chennai, India. pp.122-134, ⟨10.1007/978-3-642-12963-6_10⟩. ⟨hal-01056318⟩

Share

Metrics

Record views

458

Files downloads

156