Skip to main content
Springer Nature Link
Log in

Considering Non-real-time Traffic in Real-Time Packet Scheduling

  • Conference paper
  • First Online:
Protocols and Systems for Interactive Distributed Multimedia (IDMS 2002)

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

Abstract

Real-time packet schedulers based on EDF policy have been extensively studied to support end-to-end bounded delay for real-time traffic. Since non-real-time traffic could hurt the schedulability of realtime traffic, we need a real-time packet scheduling method considering non-real-time traffic. In this paper, we propose a new admission control algorithm for EDF-based packet scheduling scheme. Proposed scheme consists of two packet schedulers: an EDF scheduler servicing real-time traffic and a Periodic Server (PS) scheduler servicing non-real-time traffic periodically. Proposed scheme provides good performance to non-real-time flows while guaranteeing 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. M. Andrews. Probabilistic end-to-end delay bounds for earliest deadline first scheduling. In IEEE INFOCOM 2000, 2000.

    Google Scholar 

  2. R.L. Cruz. A calculus for network delay, part i:network elements in isolation. IEEE Transactions on Information Theory, 37(1):132–141, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  3. Domenico Ferrari and Dinesh C. Verma. 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 

  4. Victor Firoiu, James F. Kurose, and Donald F. Towsley. Efficient admission control for EDF schedulers. In INFOCOM (1), pages 310–317, 1997.

    Google Scholar 

  5. M.R. Garey and D.S. Johnson. Computing and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman Co., New York, 1979.

    Google Scholar 

  6. Leonidas Georgiadis, Roch Guerin, and Abhay K. Parekh. Optimal multiplexing on a single link: Delay and buffer requirements. In INFOCOM (2), pages 524–532, 1994.

    Google Scholar 

  7. Leonidas Georgiadis, Roch Guérin, Vinod Peris, and Kumar N. Sivarajan. Efficient network QoS provisioning based on per node traffic shaping. IEEE/ACM Transactions on Networking, 4(4):482–501, 1996.

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  11. Edward W. Knightly, Dallas E. Wrege, Jorg Liebeherr, and Hui Zhang. Fundamental limits and tradeoffs of providing deterministic guarantees to VBR video traffic. In Measurement and Modeling of Computer Systems, pages 98–107, 1995.

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  14. B. Sprunt. Aperiodic task scheduling for real-time systems. PhD thesis, Dept. of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburg, PA, August 1990.

    Google Scholar 

  15. Hui Zhang and Domenico Ferrari. Rate-controlled static-priority queueing. In INFOCOM (1), pages 227–236, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Information and Communication Engineering, Hallym University, Chuncheon, 200-702, 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. Departamento de Engenharia Informática, Universidade de Coimbra, Pólo II, 3030-290, Coimbra, Portugal

    Fernando Boavida  & Edmundo Monteiro  & 

  2. Escola Superior de Educação, Instituto Politécnico de Coimbra, Praça Heróis do Ultramar, 3030, Coimbra, Portugal

    João Orvalho

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ryu, Y. (2002). Considering Non-real-time Traffic in Real-Time Packet Scheduling. In: Boavida, F., Monteiro, E., Orvalho, J. (eds) Protocols and Systems for Interactive Distributed Multimedia. IDMS 2002. Lecture Notes in Computer Science, vol 2515. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36166-9_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-36166-9_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00169-0

  • Online ISBN: 978-3-540-36166-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics