The earliest deadline first scheduling with active buffer management for real-time traffic in the internet

Xiaojun Hei; Danny H.K. Tsang

The earliest deadline first scheduling with active buffer management for real-time traffic in the internet

Xiaojun Hei, Danny H.K. Tsang

Department of Electronic and Computer Engineering

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

Abstract

We study the problem of QoS guarantee for differentiated services. A two-level hierarchical scheduling framework is deployed for the separation of the QoS metrics. Due to the desirable property of minimizing the maximum packet lateness, the Earliest Deadline First (EDF) scheduling is adopted to provide the in-class scheduling for the time-sensitive traffic. We propose to employ an EDF scheduler combined with an active buffer management scheme (CHOKe) to improve the fairness of resource allocation and to maintain a good delay performance for all real-time applications. Simulation results show that the proposed scheme can achieve a better delay performance and make a more fair bandwidth allocation between the real-time TCP and UDP connections than the First Come First Serve (FCFS) scheduling with the Drop-Tail buffer management which is commonly deployed in the traditional IP router.

Original language	English
Title of host publication	Networking - ICN 2001 - 1st International Conference on Networking, Proceedings
Editors	Pascal Lorenz
Publisher	Springer Verlag
Pages	45-54
Number of pages	10
ISBN (Print)	3540423028, 9783540423027
Publication status	Published - 2001
Event	1st International Conference on Networking, ICN 2001 - Colmar, France Duration: 9 Jul 2001 → 13 Jul 2001

Publication series

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

Conference

Conference	1st International Conference on Networking, ICN 2001
Country/Territory	France
City	Colmar
Period	9/07/01 → 13/07/01

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.

Keywords

Active buffer management
Earliest deadline first
Real-time traffic
Scheduling

Access to Document

https://hdl.handle.net/1783.1/1930

Cite this

Hei, X., & Tsang, D. H. K. (2001). The earliest deadline first scheduling with active buffer management for real-time traffic in the internet. In P. Lorenz (Ed.), Networking - ICN 2001 - 1st International Conference on Networking, Proceedings (pp. 45-54). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2093). Springer Verlag. https://hdl.handle.net/1783.1/1930

Hei, Xiaojun ; Tsang, Danny H.K. / The earliest deadline first scheduling with active buffer management for real-time traffic in the internet. Networking - ICN 2001 - 1st International Conference on Networking, Proceedings. editor / Pascal Lorenz. Springer Verlag, 2001. pp. 45-54 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{b81c7ca2f51a4f9cb1285ddd7efff802,

title = "The earliest deadline first scheduling with active buffer management for real-time traffic in the internet",

abstract = "We study the problem of QoS guarantee for differentiated services. A two-level hierarchical scheduling framework is deployed for the separation of the QoS metrics. Due to the desirable property of minimizing the maximum packet lateness, the Earliest Deadline First (EDF) scheduling is adopted to provide the in-class scheduling for the time-sensitive traffic. We propose to employ an EDF scheduler combined with an active buffer management scheme (CHOKe) to improve the fairness of resource allocation and to maintain a good delay performance for all real-time applications. Simulation results show that the proposed scheme can achieve a better delay performance and make a more fair bandwidth allocation between the real-time TCP and UDP connections than the First Come First Serve (FCFS) scheduling with the Drop-Tail buffer management which is commonly deployed in the traditional IP router.",

keywords = "Active buffer management, Earliest deadline first, Real-time traffic, Scheduling",

author = "Xiaojun Hei and Tsang, \{Danny H.K.\}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 1st International Conference on Networking, ICN 2001 ; Conference date: 09-07-2001 Through 13-07-2001",

year = "2001",

language = "English",

isbn = "3540423028",

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

publisher = "Springer Verlag",

pages = "45--54",

editor = "Pascal Lorenz",

booktitle = "Networking - ICN 2001 - 1st International Conference on Networking, Proceedings",

}

Hei, X & Tsang, DHK 2001, The earliest deadline first scheduling with active buffer management for real-time traffic in the internet. in P Lorenz (ed.), Networking - ICN 2001 - 1st International Conference on Networking, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2093, Springer Verlag, pp. 45-54, 1st International Conference on Networking, ICN 2001, Colmar, France, 9/07/01. <https://hdl.handle.net/1783.1/1930>

The earliest deadline first scheduling with active buffer management for real-time traffic in the internet. / Hei, Xiaojun; Tsang, Danny H.K.
Networking - ICN 2001 - 1st International Conference on Networking, Proceedings. ed. / Pascal Lorenz. Springer Verlag, 2001. p. 45-54 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2093).

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

TY - GEN

T1 - The earliest deadline first scheduling with active buffer management for real-time traffic in the internet

AU - Hei, Xiaojun

AU - Tsang, Danny H.K.

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

PY - 2001

Y1 - 2001

N2 - We study the problem of QoS guarantee for differentiated services. A two-level hierarchical scheduling framework is deployed for the separation of the QoS metrics. Due to the desirable property of minimizing the maximum packet lateness, the Earliest Deadline First (EDF) scheduling is adopted to provide the in-class scheduling for the time-sensitive traffic. We propose to employ an EDF scheduler combined with an active buffer management scheme (CHOKe) to improve the fairness of resource allocation and to maintain a good delay performance for all real-time applications. Simulation results show that the proposed scheme can achieve a better delay performance and make a more fair bandwidth allocation between the real-time TCP and UDP connections than the First Come First Serve (FCFS) scheduling with the Drop-Tail buffer management which is commonly deployed in the traditional IP router.

AB - We study the problem of QoS guarantee for differentiated services. A two-level hierarchical scheduling framework is deployed for the separation of the QoS metrics. Due to the desirable property of minimizing the maximum packet lateness, the Earliest Deadline First (EDF) scheduling is adopted to provide the in-class scheduling for the time-sensitive traffic. We propose to employ an EDF scheduler combined with an active buffer management scheme (CHOKe) to improve the fairness of resource allocation and to maintain a good delay performance for all real-time applications. Simulation results show that the proposed scheme can achieve a better delay performance and make a more fair bandwidth allocation between the real-time TCP and UDP connections than the First Come First Serve (FCFS) scheduling with the Drop-Tail buffer management which is commonly deployed in the traditional IP router.

KW - Active buffer management

KW - Earliest deadline first

KW - Real-time traffic

KW - Scheduling

UR - https://www.scopus.com/pages/publications/84957831337

M3 - Conference Paper published in a book

AN - SCOPUS:84957831337

SN - 3540423028

SN - 9783540423027

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

SP - 45

EP - 54

BT - Networking - ICN 2001 - 1st International Conference on Networking, Proceedings

A2 - Lorenz, Pascal

PB - Springer Verlag

T2 - 1st International Conference on Networking, ICN 2001

Y2 - 9 July 2001 through 13 July 2001

ER -

Hei X, Tsang DHK. The earliest deadline first scheduling with active buffer management for real-time traffic in the internet. In Lorenz P, editor, Networking - ICN 2001 - 1st International Conference on Networking, Proceedings. Springer Verlag. 2001. p. 45-54. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

The earliest deadline first scheduling with active buffer management for real-time traffic in the internet

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this