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

Kwon Eunhyun, Lee Jaiyong, Jung Kyunghun

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationInformation Networking
Subtitle of host publicationAdvances in Data Communications and Wireless Networks - International Conference, ICOIN 2006. Revised Selected Papers
PublisherSpringer Verlag
Pages512-520
Number of pages9
Volume3961 LNCS
ISBN (Print)3540485635, 9783540485636
Publication statusPublished - 2006 Jan 1
EventInternational Conference on Information Networking, ICOIN 2006 - Sendai, Japan
Duration: 2006 Jan 162006 Jan 19

Publication series

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

Other

OtherInternational Conference on Information Networking, ICOIN 2006
CountryJapan
CitySendai
Period06/1/1606/1/19

Fingerprint

Overload
Scheduler
Wireless networks
Quality of service
Due Dates
Quality of Service
Wireless Networks
Access control
Time-varying Channels
Admission Control
Multimedia Applications
Real-time
Dependent
Requirements
Simulation

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 (Vol. 3961 LNCS, 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. Vol. 3961 LNCS 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",
month = "1",
day = "1",
language = "English",
isbn = "3540485635",
volume = "3961 LNCS",
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",

}

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. vol. 3961 LNCS, 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. Vol. 3961 LNCS 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 proceedingConference 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/1/1

Y1 - 2006/1/1

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

SN - 3540485635

SN - 9783540485636

VL - 3961 LNCS

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

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. Vol. 3961 LNCS. Springer Verlag. 2006. p. 512-520. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).