Deterministic end-to-end delay guarantees with rate controlled EDF scheduling

Authors:
Vijay Sivaraman;Fabio M. Chiussi;Mario Gerla
Affiliations:
School of EE&T, University of New South Wales, Sydney, NSW, Australia and CSIRO ICT Centre, Epping, NSW, Australia;Invento Networks;University of California at Los Angeles
Venue:
Performance Evaluation
Year:
2006

Citing 7
Cited 3

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Efficient network QoS provisioning based on per node traffic shaping

IEEE/ACM Transactions on Networking (TON)
Exact admission control for networks with a bounded delay service

IEEE/ACM Transactions on Networking (TON)
Architecture for guaranteed delay service in high-speed networks

Architecture for guaranteed delay service in high-speed networks
Efficient admission control of piecewise linear traffic envelopes at EDF schedulers

IEEE/ACM Transactions on Networking (TON)
Statistical properties of MPEG video traffic and their impact on traffic modeling in ATM systems

LCN '95 Proceedings of the 20th Annual IEEE Conference on Local Computer Networks
Optimal multiplexing on a single link: delay and buffer requirements

IEEE Transactions on Information Theory

Robust network dimensioning for realtime services over IP networks with traffic deviation

Computer Communications
Capacity assignment in multiservice packet networks with soft maximum waiting time guarantees

Journal of Network and Computer Applications
A probabilistic approach to estimate the mean waiting times in the earliest deadline first polling

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

Quality of Service (QoS) in terms of end-to-end delay guarantees to real-time applications is an important issue in emerging broadband packet networks. Earliest Deadline First (EDF) scheduling, in conjunction with per-hop traffic shaping (jointly called Rate Controlled EDF or RC-EDF) has been recognised as an effective means of end-to-end deterministic delay provisioning. This paper addresses the issue of identifying RC-EDF shaping parameters that realize maximal network utilizations. We first prove that finding "optimal" shapers is in general infeasible, and then propose a heuristic choice derived from the flow's hop-length. Our choice varies gracefully between known optimal settings for the limiting values of the hop-length, and outperforms shaper selections proposed previously in the literature.