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

Deming Liu, Yann-Hang Lee

Research output: Contribution to journalArticle

3 Citations (Scopus)

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 2005

Fingerprint

Packet switching
Packet networks
Switching networks
Scheduling
Bandwidth
Real time systems
Jitter
Telecommunication traffic
Computational complexity
Switches

Keywords

  • Packet switching networks
  • Round robin scheduling

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

An efficient scheduling discipline for packet switching networks using earliest deadline first round robin. / Liu, Deming; Lee, Yann-Hang.

In: Telecommunication Systems, Vol. 28, No. 3-4, 03.2005, p. 453-474.

Research output: Contribution to journalArticle

@article{39ab9a5299d54711beedc2790410a07f,
title = "An efficient scheduling discipline for packet switching networks using earliest deadline first round robin",
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.",
keywords = "Packet switching networks, Round robin scheduling",
author = "Deming Liu and Yann-Hang Lee",
year = "2005",
month = "3",
doi = "10.1007/s11235-004-5582-z",
language = "English (US)",
volume = "28",
pages = "453--474",
journal = "Telecommunication Systems",
issn = "1018-4864",
publisher = "Springer Netherlands",
number = "3-4",

}

TY - JOUR

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

AU - Liu, Deming

AU - Lee, Yann-Hang

PY - 2005/3

Y1 - 2005/3

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

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

KW - Packet switching networks

KW - Round robin scheduling

UR - http://www.scopus.com/inward/record.url?scp=17444382721&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=17444382721&partnerID=8YFLogxK

U2 - 10.1007/s11235-004-5582-z

DO - 10.1007/s11235-004-5582-z

M3 - Article

AN - SCOPUS:17444382721

VL - 28

SP - 453

EP - 474

JO - Telecommunication Systems

JF - Telecommunication Systems

SN - 1018-4864

IS - 3-4

ER -