An Overload-Resilient Flow Removal Algorithm for M-LWDF Scheduler

  • Eunhyun Kwon
  • Jaiyong Lee
  • Kyunghun Jung
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3961)


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.


Wireless Network Outage Probability Admission Control Code Division Multiple Access Packet Delay 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ferrari, D., Verma, D.C.: A Scheme for Real-Time Channel Establishment in Wide-Area Networks. IEEE Journal on Selected Areas in Communications 8(3), 368–379 (1990)CrossRefGoogle Scholar
  2. 2.
    Tsao, S.-L.: Extending Earliest-Due-Date Scheduling Algorithms for Wireless Networks with Location-Dependent Errors. In: Proc. IEEE Vehicular Technology Conf. (VTC-Fall 2000), Boston, USA, pp. 223–228 (2000)Google Scholar
  3. 3.
    Shakkottai, S., Srikant, R.: Scheduling real-time traffic with deadlines over a wireless channel. ACM/Baltzer Wireless Networks 8(1), 13–26 (2002)MATHCrossRefGoogle Scholar
  4. 4.
    Kong, P.-Y., Teh, K.-H.: Performance of Proactive Earliest Due Date Packet Scheduling in Wireless Networks. IEEE Transactions on Vehicular Technology 53(4), 1224–1234 (2004)CrossRefGoogle Scholar
  5. 5.
    Andrews, M., Kumaran, K., Ramanan, K., Stolyar, A., Whiting, P.: Providing Quality of Service over a Shared Wireless Link. IEEE Communications Magazine, 150–154 (February 2001)Google Scholar
  6. 6.
    Andrews, M., Kumaran, K., Ramanan, K.: CDMA Data QoS Scheduling on the Forward Link with Variable Channel Conditions. In: Bell Labs Tech. Memo (April 2000)Google Scholar
  7. 7.
    Bender, P., Black, P., Grob, M., Padovani, R., Sindhushayana, N., Viterbi, A.: CDMA/HDR: A Bandwidth-Efficient High-Speed Wireless Data Service for Nomadic Users. IEEE Communications Magazine, 70–77 (July 2000)Google Scholar
  8. 8.
    Kleinrock, L.: Queueuing Systems Theory, vol. I. Wiley Interscience Publication, Chichester (1975)Google Scholar
  9. 9.
    OPNET, Available from:

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Eunhyun Kwon
    • 1
  • Jaiyong Lee
    • 1
  • Kyunghun Jung
    • 2
  1. 1.Department of Electric and Electronic Engineering, School of EngineeringYonsei UniversitySeoulKorea
  2. 2.Telecommunication R&D CenterSamsung Electronics Co., LTD.Gyeonggi-doKorea

Personalised recommendations