NDLI: Providing end-to-end statistical delay guarantees with earliest deadline first scheduling and per-hop traffic shaping

Content Provider	IEEE Xplore Digital Library
Author	Sivaraman, V. Chiussi, F.
Copyright Year	2000
Description	Author affiliation: Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA (Sivaraman, V.)
Abstract	This paper develops a framework for statistically guaranteeing end-to-end delay bounds to leaky-bucket-constrained flows transporting real-time traffic in a network of switches using earliest deadline first (EDF) packet scheduling and per-hop traffic shaping. We first analyze the delay-bound violation probabilities at an isolated EDF scheduler fed by fluid source processes generating extremal dual-leaky-bucket-regulated traffic. We compute a close upper bound by applying the Benes approach to an equivalent hypothetical system derived from the real one. We then extend the analysis to the end-to-end scenario in the presence of traffic re-shaping at each node in the network. We compare the analytical results with simulations, and show that the match is very close. We also investigate the advantages of smoothing the traffic at the ingress to the network, and propose a simple choice of smoothing parameters, which perform very well. Using realistic traffic parameters, we compare the schedulable region of our statistical framework with that of the corresponding deterministic framework, and demonstrate that the statistical framework allows tremendous improvements in network utilization, even for very low delay-violation probabilities. The framework developed in this paper is therefore highly useful in practical packet networks to provide quality of service to real-time applications in the form of statistical, rather than deterministic, end-to-end delay bounds.
Starting Page	631
Ending Page	640
File Size	1086183
Page Count	10
File Format	PDF
ISBN	0780358805
ISSN	0743166X
DOI	10.1109/INFCOM.2000.832237
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2000-03-26
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Delay Telecommunication traffic Traffic control Probability Smoothing methods Packet switching Switches Scheduling algorithm Processor scheduling Upper bound
Content Type	Text
Resource Type	Article
Subject	Computer Science Electrical and Electronic Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

End-to-end statistical delay guarantees using earliest deadline first (EDF) packet scheduling

Providing End-to-End Statistical Delay Guarantees with Earliest Deadline First Scheduling and Per-Hop Traffic Shaping (2000)

End-to-End Statistical Delay Guarantees using Earliest Deadline First (EDF) Packet Scheduling (1999)

Achieving end-to-end delay bounds by edf scheduling without traffic shaping (2001).

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

Traffic shaping for end-to-end delay guarantees with EDF scheduling

Providing QoS guarantees in packet switches

Traffic Shaping for End-to-End Delay Guarantees with EDF Scheduling (2000)

Statistical Delay Bounds Oriented Packet Scheduling

Providing end-to-end statistical delay guarantees with earliest deadline first scheduling and per-hop traffic shaping

Similar Documents

End-to-end statistical delay guarantees using earliest deadline first (EDF) packet scheduling

Providing End-to-End Statistical Delay Guarantees with Earliest Deadline First Scheduling and Per-Hop Traffic Shaping (2000)

End-to-End Statistical Delay Guarantees using Earliest Deadline First (EDF) Packet Scheduling (1999)

Achieving end-to-end delay bounds by edf scheduling without traffic shaping (2001).

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

Traffic shaping for end-to-end delay guarantees with EDF scheduling

Providing QoS guarantees in packet switches

Traffic Shaping for End-to-End Delay Guarantees with EDF Scheduling (2000)

Statistical Delay Bounds Oriented Packet Scheduling

Providing end-to-end statistical delay guarantees with earliest deadline first scheduling and per-hop traffic shaping