An overload-resilient flow removal algorithm for M-LWDF scheduler

Kwon Eunhyun; Lee Jaiyong; Jung Kyunghun

An overload-resilient flow removal algorithm for M-LWDF scheduler

Kwon Eunhyun, Lee Jaiyong, Jung Kyunghun

Department of Electrical and Electronic Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In the real-time multimedia applications, packet delay should meet stringent Quality of Service (QoS) requirements. Delay Earliest Due Date (EDD) scheduler, originally designed for wireline data networks to operate under a maximum allowed delay, cannot be directly applied to wireless networks, due to the location-dependent errors and time-varying channel conditions. Several modifications of EDD scheduler have been proposed for wireless applications, which typically assume successful admission control, a condition hard to satisfy with wireless networks. In this paper, we propose a removal algorithm for downlink scheduler designed to perform under overloaded situations. Simulation results show that our proposed algorithm outperforms the conventional ones in the QoS guaranteed flows.

Original language	English
Title of host publication	Information Networking
Subtitle of host publication	Advances in Data Communications and Wireless Networks - International Conference, ICOIN 2006. Revised Selected Papers
Publisher	Springer Verlag
Pages	512-520
Number of pages	9
ISBN (Print)	3540485635, 9783540485636
Publication status	Published - 2006
Event	International Conference on Information Networking, ICOIN 2006 - Sendai, Japan Duration: 2006 Jan 16 → 2006 Jan 19

Publication series

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

Other

Other	International Conference on Information Networking, ICOIN 2006
Country/Territory	Japan
City	Sendai
Period	06/1/16 → 06/1/19

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Cite this

Eunhyun, K., Jaiyong, L., & Kyunghun, J. (2006). An overload-resilient flow removal algorithm for M-LWDF scheduler. In Information Networking: Advances in Data Communications and Wireless Networks - International Conference, ICOIN 2006. Revised Selected Papers (pp. 512-520). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3961 LNCS). Springer Verlag.

Eunhyun, Kwon ; Jaiyong, Lee ; Kyunghun, Jung. / An overload-resilient flow removal algorithm for M-LWDF scheduler. Information Networking: Advances in Data Communications and Wireless Networks - International Conference, ICOIN 2006. Revised Selected Papers. Springer Verlag, 2006. pp. 512-520 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{e5e38189c90041a9926295d5949178c4,

title = "An overload-resilient flow removal algorithm for M-LWDF scheduler",

abstract = "In the real-time multimedia applications, packet delay should meet stringent Quality of Service (QoS) requirements. Delay Earliest Due Date (EDD) scheduler, originally designed for wireline data networks to operate under a maximum allowed delay, cannot be directly applied to wireless networks, due to the location-dependent errors and time-varying channel conditions. Several modifications of EDD scheduler have been proposed for wireless applications, which typically assume successful admission control, a condition hard to satisfy with wireless networks. In this paper, we propose a removal algorithm for downlink scheduler designed to perform under overloaded situations. Simulation results show that our proposed algorithm outperforms the conventional ones in the QoS guaranteed flows.",

author = "Kwon Eunhyun and Lee Jaiyong and Jung Kyunghun",

year = "2006",

language = "English",

isbn = "3540485635",

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

publisher = "Springer Verlag",

pages = "512--520",

booktitle = "Information Networking",

address = "Germany",

note = "International Conference on Information Networking, ICOIN 2006 ; Conference date: 16-01-2006 Through 19-01-2006",

}

Eunhyun, K, Jaiyong, L & Kyunghun, J 2006, An overload-resilient flow removal algorithm for M-LWDF scheduler. in Information Networking: Advances in Data Communications and Wireless Networks - International Conference, ICOIN 2006. Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3961 LNCS, Springer Verlag, pp. 512-520, International Conference on Information Networking, ICOIN 2006, Sendai, Japan, 06/1/16.

An overload-resilient flow removal algorithm for M-LWDF scheduler. / Eunhyun, Kwon; Jaiyong, Lee; Kyunghun, Jung.
Information Networking: Advances in Data Communications and Wireless Networks - International Conference, ICOIN 2006. Revised Selected Papers. Springer Verlag, 2006. p. 512-520 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3961 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - An overload-resilient flow removal algorithm for M-LWDF scheduler

AU - Eunhyun, Kwon

AU - Jaiyong, Lee

AU - Kyunghun, Jung

PY - 2006

Y1 - 2006

N2 - In the real-time multimedia applications, packet delay should meet stringent Quality of Service (QoS) requirements. Delay Earliest Due Date (EDD) scheduler, originally designed for wireline data networks to operate under a maximum allowed delay, cannot be directly applied to wireless networks, due to the location-dependent errors and time-varying channel conditions. Several modifications of EDD scheduler have been proposed for wireless applications, which typically assume successful admission control, a condition hard to satisfy with wireless networks. In this paper, we propose a removal algorithm for downlink scheduler designed to perform under overloaded situations. Simulation results show that our proposed algorithm outperforms the conventional ones in the QoS guaranteed flows.

AB - In the real-time multimedia applications, packet delay should meet stringent Quality of Service (QoS) requirements. Delay Earliest Due Date (EDD) scheduler, originally designed for wireline data networks to operate under a maximum allowed delay, cannot be directly applied to wireless networks, due to the location-dependent errors and time-varying channel conditions. Several modifications of EDD scheduler have been proposed for wireless applications, which typically assume successful admission control, a condition hard to satisfy with wireless networks. In this paper, we propose a removal algorithm for downlink scheduler designed to perform under overloaded situations. Simulation results show that our proposed algorithm outperforms the conventional ones in the QoS guaranteed flows.

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

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

M3 - Conference contribution

AN - SCOPUS:33845541646

SN - 3540485635

SN - 9783540485636

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

SP - 512

EP - 520

BT - Information Networking

PB - Springer Verlag

T2 - International Conference on Information Networking, ICOIN 2006

Y2 - 16 January 2006 through 19 January 2006

ER -

Eunhyun K, Jaiyong L, Kyunghun J. An overload-resilient flow removal algorithm for M-LWDF scheduler. In Information Networking: Advances in Data Communications and Wireless Networks - International Conference, ICOIN 2006. Revised Selected Papers. Springer Verlag. 2006. p. 512-520. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

An overload-resilient flow removal algorithm for M-LWDF scheduler

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this