NDLI: Practical algorithms for scheduling video data in a local area network environment

Content Provider	Springer Nature Link
Author	Tsoi, Kelvin Yiu Lun Kwok, Yu Kwong
Copyright Year	2007
Abstract	Simultaneous transmission of multiple high quality video streams from a server to the clients is becoming an increasingly important class of traffic in a network of workstations or cluster environment. With a powerful symmetric multiprocessor (SMP) as the server and a high-speed network, such transmission is practicable from a hardware point of view. However, the actual construction of such a video data server system entails tackling a number of difficult problems related to the provision of strict quality of service (QoS) guarantees. Among others, the smoothing and scheduling of multiple video packet streams are two crucial issues. Smoothing is concerned with reducing the rate variability of video streams in view of the fact that video data are usually compressed in a variable bit rate fashion. Scheduling is important to guarantee the requested QoS levels while maximizing the utilization of the resources. Although much work on smoothing has been done, it is not clear which scheduling scheme is suitable for multiplexing smoothed video data to the network. In this paper we present an extensive performance study of the EDF and RM scheduling algorithms which are modified to provide QoS guarantees for smoothed video data. With a probabilistic definition of QoS, admission control conditions are incorporated into the two algorithms. Furthermore, a counter-based scheduling module is included as the core scheduling mechanism which adaptively adjusts the actual QoS levels assigned to requests. Our theoretical analysis of the two modified algorithms, called QEDF and QRM, shows that the QRM algorithm is more robust than the QEDF algorithm for different workload and utilization conditions. We also propose to use a new metric called meta-QoS to quantify the overall performance of a packet scheduler given a set of simultaneous requests. In our experiments based on an SMP-based Linux platform, we find that the QRM algorithm can sustain a rather stable level of meta-QoS even when the workload and utilization levels are increased. On the other hand, the QEDF algorithm, due to its conservative admission control policy, is found to be not suitable for a high level of utilization and a large number of requests. In view of the lower complexity of the QRM algorithm, it seems that the QRM approach is a more suitable candidate for packet scheduling in the client-server environment considered in our study.
Starting Page	131
Ending Page	147
Page Count	17
File Format	PDF
ISSN	09208542
Journal	The Journal of Supercomputing
Volume Number	39
Issue Number	2
e-ISSN	15730484
Language	English
Publisher	Kluwer Academic Publishers-Plenum Publishers
Publisher Date	2007-02-17
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Parallel processing Multimedia networking Link scheduling QoS Soft real-time constraints Earliest-deadline-first Rate-monotonic Smoothed video Client-server systems Linux SMP Computer Science Processor Architectures Programming Languages, Compilers, Interpreters
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Information Systems Hardware and Architecture Software

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

A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy

Parallel Programming and Compilers

Parallel Machines: Parallel Machine Languages: The Emergence of Hybrid Dataflow Computer Architectures

A comparative study of rate monotonic schedulability tests

Practical SGML

Resource availability-aware advance reservation for parallel jobs with deadlines

Parallel Processing of First Order Linear Recurrence on SMP Machines

Meta-QoS Performance of Earliest-Deadline-First and Rate-Monotonic Scheduling of Smoothed Video Data in a Client-Server Environment

A fault-tolerant architecture for parallel applications in tiled-CMPs

Practical algorithms for scheduling video data in a local area network environment

Similar Documents

A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy

Parallel Programming and Compilers

Parallel Machines: Parallel Machine Languages: The Emergence of Hybrid Dataflow Computer Architectures

A comparative study of rate monotonic schedulability tests

Practical SGML

Resource availability-aware advance reservation for parallel jobs with deadlines

Parallel Processing of First Order Linear Recurrence on SMP Machines

Meta-QoS Performance of Earliest-Deadline-First and Rate-Monotonic Scheduling of Smoothed Video Data in a Client-Server Environment

A fault-tolerant architecture for parallel applications in tiled-CMPs

Practical algorithms for scheduling video data in a local area network environment