File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

이재용

Lee, Jaiyong
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

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

Author(s)
Kwon, EunhyunLee, JaiyongJung, Kyunghun
Issued Date
2006-01-16
DOI
10.1007/11919568_51
URI
https://scholarworks.unist.ac.kr/handle/201301/47755
Fulltext
https://link.springer.com/chapter/10.1007/11919568_51
Citation
International Conference on Information Networking, ICOIN 2006, pp.512 - 520
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.
Publisher
ICOIN 2006

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.