Skip to main content

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

  • Conference paper
Information Networking. Advances in Data Communications and Wireless Networks (ICOIN 2006)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3961))

Included in the following conference series:

  • 802 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Article  Google Scholar 

  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. Shakkottai, S., Srikant, R.: Scheduling real-time traffic with deadlines over a wireless channel. ACM/Baltzer Wireless Networks 8(1), 13–26 (2002)

    Article  MATH  Google Scholar 

  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)

    Article  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

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kwon, E., Lee, J., Jung, K. (2006). An Overload-Resilient Flow Removal Algorithm for M-LWDF Scheduler. In: Chong, I., Kawahara, K. (eds) Information Networking. Advances in Data Communications and Wireless Networks. ICOIN 2006. Lecture Notes in Computer Science, vol 3961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11919568_51

Download citation

  • DOI: https://doi.org/10.1007/11919568_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48563-6

  • Online ISBN: 978-3-540-48564-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics