Resource division policies for EDF scheduling in ATM networks

Author

Ayad, Amr S. ; El-Hadidi, Mahmoud T. ; Elsayed, Khaled M Fouad

Author_Institution

Dept. of Electron. & Commun. Eng., Cairo Univ., Giza, Egypt

fYear

2001

fDate

2001

Firstpage

249

Lastpage

254

Abstract

The paper addresses the issue of reserving resources at ATM switches along the path of calls requiring a deterministic bound to end-to-end delay. The switches are assumed to schedule outgoing cells using the earliest-deadline-first (EDF) scheduling discipline. EDF is known to be an optimal scheduling discipline when providing delay bounds to a number of calls being served by a single scheduler. We present the algorithm for call admission control (CAC), and propose a number of resource division policies used for mapping the end-to-end delay requirement of a call into local delay deadlines to be reserved at each scheduler

Keywords

asynchronous transfer mode; delays; packet switching; telecommunication congestion control; wide area networks; ATM WAN; ATM networks; ATM switches; CAC algorithm; EDF scheduling; call admission control; delay bounds; deterministic bound; earliest-deadline-first scheduling; end-to-end delay; local delay deadlines; optimal scheduling discipline; resource division policies; resource reservation; Asynchronous transfer mode; Call admission control; Communication switching; Delay; Intelligent networks; Processor scheduling; Quality of service; Scheduling algorithm; Stability; Switches;

fLanguage

English

Publisher

ieee

Conference_Titel

Computers and Communications, 2001. Proceedings. Sixth IEEE Symposium on

Conference_Location

Hammamet

ISSN

1530-1346

Print_ISBN

0-7695-1177-5

Type

conf

DOI

10.1109/ISCC.2001.935383

Filename

935383