Dynamic Window-Constrained Scheduling for Real-Time Media Streaming

This paper describes an algorithm for scheduling packets in real-time multimedia data streams. Common to these classes of data streams are service constraints in terms of bandwidth and delay. However, it is typical for real-time multimedia streams to tolerate bounded delay variations and, in some cases, finite losses of packets. We have therefore developed a scheduling algorithm that assumes streams have window-constraints on groups of consecutive packet deadlines. A window-constraint defines the number of packet deadlines that can be missed in a window of deadlines for consecutive packets in a stream. Our algorithm, called Dynamic Window-Constrained Scheduling (DWCS), attempts to guarantee no more than x out of a window of y deadlines are missed for consecutive packets in real-time and multimedia streams. Using DWCS, the delay of service to real-time streams is bounded even when the scheduler is overloaded. Moreover, DWCS is capable of ensuring independent delay bounds on streams, while at the same time guaranteeing minimum bandwidth utilizations over tunable and finite windows of time. We show the conditions under which the total demand for link bandwidth by a set of real-time (i.e., window-constrained) streams can exceed 100% and still ensure all window-constraints are met. In fact, we show how it is possible to guarantee worst-case per-stream bandwidth and delay constraints while utilizing all available link capacity. Finally, we show how best-effort packets can be serviced with fast response time, in the presence of window-constrained traffic

A system architecture for low bit rate traffic aggregation in control applications

This paper describes the results of research work aimed at providing an efficient solution to the aggregation of low bit rate traffic in control applications. It includes the proposal and analysis of an architecture that integrates Terminal Adapters and a Concentrator connected to a remote Control Application through a communication network. The ATM technology was selected to implement the proposed system due to its properties of multiplexing efficiency and control of packet delay. Scheduling Algorithms for the Terminal Adapter and Concentrator have been developed in order to satisfy two main goals: to guarantee committed delays for time sensitive services, and to increase the network transmission efficiency. The results, obtained by simulation, show that the system performance complies with the requirements of the majority of control applications.Institute of Electrical and Electronics Engineers (IEEE)

Scheduling algorithms to support QoS and service integration in sensor and actuator networks

In this paper we analyse and evaluate several Scheduling Algorithms that are candidates to support Quality of Service and Service Integration in Sensor and Actuator Networks. They should satisfy two main goals: to guarantee committed delays for time sensitive services, and to improve the network transmission efficiency. The algorithms are described and some results, obtained by simulation, are presented. The proposed Traffic Class Oriented Algorithm proved to be a good solution to meet the proposed objectives as well as to integrate traffic generated by Fieldbus devices and control applications in real communication networks.IEE

A continuous media transport protocol

A protocol for the transmission of digitized audio and video data must schedule data transmission such that each audio or video sample is available in the receiver\u27s buffer by its play-out deadline without overflowing the allotted buffer space at the receiver. While traditional data communication protocols provide error-free data transmission through the use of time-outs and retransmissions, the unbounded number of retransmissions that a packet may suffer results in an unboundable network transmission delay. Thus, such protocols are not appropriate for the real-time transmission of digitized audio and video data;This dissertation examines the network environments likely to be used for digitized audio and video data transmission and develops an audio/video transport-layer communication protocol which for such network environments. A unique feature of this protocol is the calculation of a transmission schedule which can minimize the buffer requirements at the receiver while still meeting the real-time play-out deadlines of the individual audio and video streams

Efficient memory management in VOD disk array servers usingPer-Storage-Device buffering

We present a buffering technique that reduces video-on-demand server memory requirements in more than one order of magnitude. This technique, Per-Storage-Device Buffering (PSDB), is based on the allocation of a fixed number of buffers per storage device, as opposed to existing solutions based on per-stream buffering allocation. The combination of this technique with disk array servers is studied in detail, as well as the influence of Variable Bit Streams. We also present an interleaved data placement strategy, Constant Time Length Declustering, that results in optimal performance in the service of VBR streams. PSDB is evaluated by extensive simulation of a disk array server model that incorporates a simulation based admission test.This research was supported in part by the National R&D Program of Spain, Project Number TIC97-0438.Publicad

Delay Bound: Fractal Traffic Passes through Network Servers

Delay analysis plays a role in real-time systems in computer communication networks. This paper gives our results in the aspect of delay analysis of fractal traffic passing through servers. There are three contributions presented in this paper. First, we will explain the reasons why conventional theory of queuing systems ceases in the general sense when arrival traffic is fractal. Then, we will propose a concise method of delay computation for hard real-time systems as shown in this paper. Finally, the delay computation of fractal traffic passing through severs is presented

Scheduling algorithms in broadband wireless networks

Scheduling algorithms that support quality of service (QoS) differentiation and guarantees for wireless data networks are crucial to the development of broadband wireless networks. Wireless communication poses special problems that do not exist in wireline networks, such as time-varying channel capacity and location-dependent errors. Although many mature scheduling algorithms are available for wireline networks, they are not directly applicable in wireless networks because of these special problems. This paper provides a comprehensive and in-depth survey on recent research in wireless scheduling. The problems and difficulties in wireless scheduling are discussed. Various representative algorithms are examined. Their themes of thoughts and pros and cons are compared and analyzed. At the end of the paper, some open questions and future research directions are addressed.published_or_final_versio

Asymptotic Identity in Min-Plus Algebra: A Report on CPNS

Network calculus is a theory initiated primarily in computer communication networks, especially in the aspect of real-time communications, where min-plus algebra plays a role. Cyber-physical networking systems (CPNSs) are recently developing fast and models in data flows as well as systems in CPNS are, accordingly, greatly desired. Though min-plus algebra may be a promising tool to linearize any node in CPNS as can be seen from its applications to the Internet computing, there are tough problems remaining unsolved in this regard. The identity in min-plus algebra is one problem we shall address. We shall point out the confusions about the conventional identity in the min-plus algebra and present an analytical expression of the asymptotic identity that may not cause confusions