A novel scheduler for a low delay service within best-effort

Paul Hurley; Mourad Kara; Jean Yves Le Boudec; Patrick Thiran

doi:10.1007/3-540-45512-4_30

A novel scheduler for a low delay service within best-effort

Paul Hurley, Mourad Kara, Jean Yves Le Boudec, Patrick Thiran

Research output: Chapter in Book / Conference Paper › Conference Paper › peer-review

3 Citations (Scopus)

Abstract

We present a novel scheduling algorithm, Duplicate Scheduling with Deadlines (DSD). This algorithm implements the ABE service [5] which allows interactive, adaptive applications, that mark their packets green, to receive a low bounded delay at the expense of maybe less throughput. ABE retains the best-effort context by protecting flows that value higher throughput more than low bounded delay, whose packets are marked blue. DSD optimises green traffic performance while satisfying the constraint that blue traffic must not be adversely affected. Using a virtual queue, deadlines are assigned to packets upon arrival, and green and blue packets are queued separately. At service time, the deadlines of the packets at the head of the blue and green queues are used to determine which one to serve next. It supports any mixture of TCP, TCP Friendly and non TCP Friendly traffic. We motivate, describe and provide an analysis of DSD, and show simulation results.

Original language	English
Title of host publication	Quality of Service - IWQoS 2001 - 9th International Workshop, Proceedings
Editors	Lars Wolf, David Hutchison, Ralf Steinmetz
Publisher	Springer Verlag
Pages	389-403
Number of pages	15
ISBN (Electronic)	9783540422174
DOIs	https://doi.org/10.1007/3-540-45512-4_30
Publication status	Published - 2001
Externally published	Yes
Event	9th International Workshop on Quality of Service, IWQoS 2001 - Karlsruhe, Germany Duration: 6 Jun 2001 → 8 Jun 2001

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2092
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	9th International Workshop on Quality of Service, IWQoS 2001
Country/Territory	Germany
City	Karlsruhe
Period	6/06/01 → 8/06/01

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.

Access to Document

10.1007/3-540-45512-4_30

Cite this

Hurley, P., Kara, M., Le Boudec, J. Y., & Thiran, P. (2001). A novel scheduler for a low delay service within best-effort. In L. Wolf, D. Hutchison, & R. Steinmetz (Eds.), Quality of Service - IWQoS 2001 - 9th International Workshop, Proceedings (pp. 389-403). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2092). Springer Verlag. https://doi.org/10.1007/3-540-45512-4_30

Hurley, Paul ; Kara, Mourad ; Le Boudec, Jean Yves et al. / A novel scheduler for a low delay service within best-effort. Quality of Service - IWQoS 2001 - 9th International Workshop, Proceedings. editor / Lars Wolf ; David Hutchison ; Ralf Steinmetz. Springer Verlag, 2001. pp. 389-403 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d6ed36192b724ea691ada4be452e8883,

title = "A novel scheduler for a low delay service within best-effort",

abstract = "We present a novel scheduling algorithm, Duplicate Scheduling with Deadlines (DSD). This algorithm implements the ABE service [5] which allows interactive, adaptive applications, that mark their packets green, to receive a low bounded delay at the expense of maybe less throughput. ABE retains the best-effort context by protecting flows that value higher throughput more than low bounded delay, whose packets are marked blue. DSD optimises green traffic performance while satisfying the constraint that blue traffic must not be adversely affected. Using a virtual queue, deadlines are assigned to packets upon arrival, and green and blue packets are queued separately. At service time, the deadlines of the packets at the head of the blue and green queues are used to determine which one to serve next. It supports any mixture of TCP, TCP Friendly and non TCP Friendly traffic. We motivate, describe and provide an analysis of DSD, and show simulation results.",

author = "Paul Hurley and Mourad Kara and {Le Boudec}, {Jean Yves} and Patrick Thiran",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 9th International Workshop on Quality of Service, IWQoS 2001 ; Conference date: 06-06-2001 Through 08-06-2001",

year = "2001",

doi = "10.1007/3-540-45512-4_30",

language = "English",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "389--403",

editor = "Lars Wolf and David Hutchison and Ralf Steinmetz",

booktitle = "Quality of Service - IWQoS 2001 - 9th International Workshop, Proceedings",

}

Hurley, P, Kara, M, Le Boudec, JY & Thiran, P 2001, A novel scheduler for a low delay service within best-effort. in L Wolf, D Hutchison & R Steinmetz (eds), Quality of Service - IWQoS 2001 - 9th International Workshop, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2092, Springer Verlag, pp. 389-403, 9th International Workshop on Quality of Service, IWQoS 2001, Karlsruhe, Germany, 6/06/01. https://doi.org/10.1007/3-540-45512-4_30

A novel scheduler for a low delay service within best-effort. / Hurley, Paul; Kara, Mourad; Le Boudec, Jean Yves et al.
Quality of Service - IWQoS 2001 - 9th International Workshop, Proceedings. ed. / Lars Wolf; David Hutchison; Ralf Steinmetz. Springer Verlag, 2001. p. 389-403 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2092).

Research output: Chapter in Book / Conference Paper › Conference Paper › peer-review

TY - GEN

T1 - A novel scheduler for a low delay service within best-effort

AU - Hurley, Paul

AU - Kara, Mourad

AU - Le Boudec, Jean Yves

AU - Thiran, Patrick

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2001.

PY - 2001

Y1 - 2001

N2 - We present a novel scheduling algorithm, Duplicate Scheduling with Deadlines (DSD). This algorithm implements the ABE service [5] which allows interactive, adaptive applications, that mark their packets green, to receive a low bounded delay at the expense of maybe less throughput. ABE retains the best-effort context by protecting flows that value higher throughput more than low bounded delay, whose packets are marked blue. DSD optimises green traffic performance while satisfying the constraint that blue traffic must not be adversely affected. Using a virtual queue, deadlines are assigned to packets upon arrival, and green and blue packets are queued separately. At service time, the deadlines of the packets at the head of the blue and green queues are used to determine which one to serve next. It supports any mixture of TCP, TCP Friendly and non TCP Friendly traffic. We motivate, describe and provide an analysis of DSD, and show simulation results.

AB - We present a novel scheduling algorithm, Duplicate Scheduling with Deadlines (DSD). This algorithm implements the ABE service [5] which allows interactive, adaptive applications, that mark their packets green, to receive a low bounded delay at the expense of maybe less throughput. ABE retains the best-effort context by protecting flows that value higher throughput more than low bounded delay, whose packets are marked blue. DSD optimises green traffic performance while satisfying the constraint that blue traffic must not be adversely affected. Using a virtual queue, deadlines are assigned to packets upon arrival, and green and blue packets are queued separately. At service time, the deadlines of the packets at the head of the blue and green queues are used to determine which one to serve next. It supports any mixture of TCP, TCP Friendly and non TCP Friendly traffic. We motivate, describe and provide an analysis of DSD, and show simulation results.

UR - http://www.scopus.com/inward/record.url?scp=84937563005&partnerID=8YFLogxK

U2 - 10.1007/3-540-45512-4_30

DO - 10.1007/3-540-45512-4_30

M3 - Conference Paper

AN - SCOPUS:84937563005

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 389

EP - 403

BT - Quality of Service - IWQoS 2001 - 9th International Workshop, Proceedings

A2 - Wolf, Lars

A2 - Hutchison, David

A2 - Steinmetz, Ralf

PB - Springer Verlag

T2 - 9th International Workshop on Quality of Service, IWQoS 2001

Y2 - 6 June 2001 through 8 June 2001

ER -

Hurley P, Kara M, Le Boudec JY, Thiran P. A novel scheduler for a low delay service within best-effort. In Wolf L, Hutchison D, Steinmetz R, editors, Quality of Service - IWQoS 2001 - 9th International Workshop, Proceedings. Springer Verlag. 2001. p. 389-403. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45512-4_30

A novel scheduler for a low delay service within best-effort

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this