2006 | OriginalPaper | Chapter
An Overload-Resilient Flow Removal Algorithm for M-LWDF Scheduler
Authors : Eunhyun Kwon, Jaiyong Lee, Kyunghun Jung
Published in: Information Networking. Advances in Data Communications and Wireless Networks
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.