Resource Division Policies for EDF Scheduling in ATM Networks

Authors:
Affiliations:
Venue:
ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications
Year:
2001

Citing 0
Cited 1

Performance evaluation of resource reservation and call admission policies for deterministic services in PGPS-based packet networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: The paper addresses the issue of reserving resources at ATM switches along the path of calls requiring a deterministic bound on 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.