An Efficient Scheduling Discipline for Packet Switching Networks Using Earliest Deadline First Round Robin |
| |
Authors: | Deming Liu Yann-Hang Lee |
| |
Affiliation: | (1) Kiyon Inc., 4225 Executive Square, Suite 290, La Jolla, CA 92037, USA;(2) Department of Computer Science and Engineering, Arizona State Univeristy, Tempe, AZ 85287, USA |
| |
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 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. |
| |
Keywords: | packet switching networks round robin scheduling |
本文献已被 SpringerLink 等数据库收录! |
|