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

Authors:
Eunhyun Kwon;Jaiyong Lee;Kyunghun Jung
Affiliations:
Department of Electric and Electronic Engineering, School of Engineering, Yonsei University, Seoul, Korea;Department of Electric and Electronic Engineering, School of Engineering, Yonsei University, Seoul, Korea;Telecommunication R&D Center, Samsung Electronics Co., LTD., Gyeonggi-do, Korea
Venue:
ICOIN'06 Proceedings of the 2006 international conference on Information Networking: advances in Data Communications and Wireless Networks
Year:
2006

Citing 3
Cited 0

Scheduling real-time traffic with deadlines over a wireless channel

Wireless Networks
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users

IEEE Communications Magazine
Providing quality of service over a shared wireless link

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

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.