An efficient scheduling discipline for packet switching networks using earliest deadline first round robin

Deming Liu, Yann-Hang Lee

Research output: Contribution to journalArticle

4 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)453-474
Number of pages22
JournalTelecommunication Systems
Volume28
Issue number3-4
DOIs
StatePublished - Mar 1 2005

Keywords

  • Packet switching networks
  • Round robin scheduling

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'An efficient scheduling discipline for packet switching networks using earliest deadline first round robin'. Together they form a unique fingerprint.

  • Cite this