Skip to main content
Springer Nature Link
Log in

An Efficient Scheduling Discipline for Packet Switching Networks Using Earliest Deadline First Round Robin

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

This paper addresses a frame-oriented scheduling discipline, EDF-RR (earliest deadline first round robin), for OQ (output-queued) switch architecture and data traffic consisting of fixed-length cells. Bandwidth reservation for an active session is performed by holding a number of cell slots for the session in a repeatedly-transferred frame. Each cell that is going to be transferred in the frame is assigned a virtual release time and a virtual deadline according to the bandwidth reservation scheme. The transmitting order of the cells in the frame is determined by non-preemptive non-idling EDF algorithm so that cells of a backlogged session in the frame are distributed as uniformly as possible. Through the analysis applying real-time scheduling theory and network calculus as well as network simulation, EDF-RR takes the advantage of O(1) computational complexity, and possesses tight delay bounds and lenient buffer requirements. The proposed scheduling discipline is appropriate for distributed real-time systems as we show that sessions can be configured based on message traffic models and deadline requirements. Also, a modified version of EDF-RR, called EDF-DRR, can be applied as traffic regulator when jitter requirements exist among active sessions.

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

Access this article

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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • J.C.R. Bennet and H. Zhang, WF2Q: Worst-case fair weighted fair queuing, in: Proc. of IEEE INFOCOM’96, CA (March 1996) pp. 120–128.

  • J.C.R. Bennet and H. Zhang, Hierarchical packet fair queueing algorithms, IEEE/ACM Transactions on Networks 5(5) (1997) 675–689.

    Google Scholar 

  • A. Demeres, S. Keshav and S. Shenker, Analysis and simulation of a fair queueing algorithm, Journal of Internetworking Research and Experience (October 1990) 3–26.

  • Draft of project paper 664 aircraft data network, Parts 1 to 8, ARINC specification 664, Aeronautical Radio, Annapolis, MD (2002).

  • D. Ferrari and D. Verma, A scheme for real-time channel-establishment in wide area networks, IEEE Journal on Selected Areas in Communications (April 1990) 368–379.

  • S. Jamaloddin Golestani, A self-clocked fair queueing scheme for broadband applications, in: Proc. of IEEE INFOCOM’94, Toronto, Canada (June 1994) pp. 636–646.

  • S.S. Kanhere, H. Sethu and A.B. Parekh, Fair and efficient packet scheduling using elastic round robin, IEEE Transactions on Parallel and Distributed Systems 13(3) (2002) 324–336.

    Google Scholar 

  • M. Katavenis et al., Weighted round-robin cell multiplexing in a general-purpose ATM switch chip, IEEE Journal on Selected Areas in Communications 9(8) (1991) 1265–1279.

    Google Scholar 

  • J.-Y. Le Boudec, Application of network calculus to guaranteed service networks, IEEE Transactions on Information Theory 44(3) (1998) 1087–1096.

    Google Scholar 

  • J.-Y. Le Boudec and P. Thiran, Network Calculus: A Theory of Deterministic Queuing Systems for the Internet (Springer, Berlin, 2001).

    Google Scholar 

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

    Google Scholar 

  • A.K. Parekh and R.G. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The single-node case, IEEE/ACM Transactions on Networking 1(3) (1993) 344–357.

    Google Scholar 

  • M. Shreedhar and G. Varghese, Efficient fair queuing using deficit round-robin, IEEE/ACM Transactions on Networking 4(3) (1996) 375–385.

    Google Scholar 

  • J.A. Stankovic et al., Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms (Kluwer Academic, Dordrecht, 1998).

    Google Scholar 

  • L. Zhang, VirtualClock: A new traffic control algorithm for packet switching networks, in: Proc. of ACM SIGCOMM’90, Philadelphia, PA (September 1990) pp. 19–29.

  • H. Zhang, Service disciplines for guaranteed performance service in packet-switching networks, Proceedings of the IEEE 83(10) (1995) 1374–1396.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kiyon Inc., 4225 Executive Square, Suite 290, La Jolla, CA, 92037, USA

    Deming Liu

  2. Department of Computer Science and Engineering, Arizona State Univeristy, Tempe, AZ, 85287, USA

    Yann-Hang Lee

Authors
  1. Deming Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yann-Hang Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Deming Liu.

Additional information

This work was sponsored in part by the Federal Aviation Administration (FAA) via grant DTFA03-01-C-00042. Findings contained herein are not necessarily those of the FAA.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, D., Lee, YH. An Efficient Scheduling Discipline for Packet Switching Networks Using Earliest Deadline First Round Robin. Telecommun Syst 28, 453–474 (2005). https://doi.org/10.1007/s11235-004-5582-z

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-004-5582-z

Keywords

Search

Navigation