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


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
Number of pages9
ISBN (Print)3540485635, 9783540485636
Publication statusPublished - 2006
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


OtherInternational Conference on Information Networking, ICOIN 2006

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'An overload-resilient flow removal algorithm for M-LWDF scheduler'. Together they form a unique fingerprint.

Cite this