An Overload-Resilient Flow Removal Algorithm for M-LWDF Scheduler
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.
KeywordsWireless Network Outage Probability Admission Control Code Division Multiple Access Packet Delay
Unable to display preview. Download preview PDF.
- 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
- 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.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.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.Kleinrock, L.: Queueuing Systems Theory, vol. I. Wiley Interscience Publication, Chichester (1975)Google Scholar
- 9.OPNET, Available from: http://www.opnet.com