Skip to main content
Springer Nature Link
Log in

Scheduling Mixed Traffic under Earliest-Deadline-First Algorithm

  • Conference paper
Computer and Information Sciences - ISCIS 2003 (ISCIS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2869))

Included in the following conference series:

Abstract

Recently, real-time packet schedulers based on Earliest Deadline First (EDF) policy have been extensively studied to support end-to-end bounded delay for real-time traffic. However, the packet scheduler could not guarantee the QoS requirements of real-time traffic since it receives a number of non-real-time traffic for the purpose of management and control. In this paper, we study a packet scheduling scheme servicing non-real-time traffic using the available time of link (i.e. slack time). Proposed scheme assigns the deadline to non-real-time packets on-line and services them under EDF policy. Since proposed scheme services the non-real-time traffic when the link bandwidth is not used, it can guarantee the schedulability of real-time flows.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Andrews, M.: Probabilistic end-to-end delay bounds for earliest deadline first scheduling. IEEE INFOCOM (2000)

    Google Scholar 

  2. Buttazzo, G., Sensini, F.: Optimal deadline assignment for scheduling soft aperiodic tasks in hard real-time environments. IEEE Trans. on Computers 48(10), 1035–1052 (1999)

    Article  Google Scholar 

  3. Chiussi, F., Sivaraman, V.: Achieving high utilization in guaranteed services networks using early deadline first scheduling. In: IEEE/IFIP International Workshop on Quality of Service (IWQoS 1998) (1998)

    Google Scholar 

  4. 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 

  5. Firoiu, V., Kurose, J.F., Towsley, D.F.: Efficient admission control for EDF schedulers. INFOCOM (1), 310–317 (1997)

    Google Scholar 

  6. Georgiadis, L., Guérin, R., Peris, V., Sivarajan, K.N.: Efficient network QoS provisioning based on per node traffic shaping. IEEE/ACM Transactions on Networking 4(4), 482–501 (1996)

    Article  Google Scholar 

  7. Ghazalie, T.M., Baker, T.P.: Aperiodic servers in a deadline scheduling environment. The Journal of Real-Time Systems 9, 21–36 (1995)

    Article  Google Scholar 

  8. Kim, J.H., Chien, A.A.: Rotating combined queueing (RCQ): Bandwidth and latency guarantees in low-cost, high-performance networks. ISCA, 226–236 (1996)

    Google Scholar 

  9. Knightly, E.W., Wrege, D.E., Liebeherr, J., Zhang, H.: Fundamental limits and tradeoffs of providing deterministic guarantees to VBR video traffic. Measurement and Modeling of Computer Systems, 98–107 (1995)

    Google Scholar 

  10. Liebeherr, J., Wrege, D.E., Ferrari, D.: Exact admission control for networks with a bounded delay service. IEEE/ACM Transactions on Networking 4(6), 885–901 (1996)

    Article  Google Scholar 

  11. Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20(1), 46–61 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  12. Ripoll, I., Crespo, A., Garcia-Fornes, A.: An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems. IEEE Trans. on Software Engineering 23(6), 388–400 (1996)

    Article  Google Scholar 

  13. Ryu, Y.: Considering non-real-time traffic in real-time packet scheduler. In: Boavida, F., Monteiro, E., Orvalho, J. (eds.) IDMS 2002 and PROMS 2002. LNCS, vol. 2515, pp. 216–228. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  14. Spuri, M., Buttazzo, G.C.: Scheduling aperiodic tasks in dynamic priority systems. Real-Time Systems 10(2), 179–210 (1996)

    Article  Google Scholar 

  15. Strosnider, J.K., Lehoczky, J.P., Sha, L.: The deferrable server algorithm for enhanced aperiodic responsiveness in hard realtime environments. IEEE Trans. Computers 44(1), 73–91 (1995)

    Article  MATH  Google Scholar 

  16. Zhang, H., Ferrari, D.: Rate-controlled static-priority queueing. In: INFOCOM, vol. (1), pp. 227–236 (1993)

    Google Scholar 

  17. Zhu, K., Zhuang, Y., Viniotis, Y.: Achieving end-to-end delay bounds by edf scheduling without traffic shaping. IEEE INFOCOM (April 2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Software, Myongji University, Nam-dong, Yongin, Kyongki-do, Korea

    Yeonseung Ryu

Authors
  1. Yeonseung Ryu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Engineering, Middle East Technical University, Ankara, Turkey

    Adnan Yazıcı

  2. Department of Computer Engineering, Middle East Technical University, 06531, Ankara, Turkey

    Cevat Şener

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ryu, Y. (2003). Scheduling Mixed Traffic under Earliest-Deadline-First Algorithm. In: Yazıcı, A., Şener, C. (eds) Computer and Information Sciences - ISCIS 2003. ISCIS 2003. Lecture Notes in Computer Science, vol 2869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39737-3_89

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39737-3_89

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20409-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics