Algorithms for Deterministic Call Admission Control of Pre-stored VBR Video Streams

Abstract

<p class="MsoNormal" style="text-align: left; margin: 0cm 0cm 0pt; layout-grid-mode: char; mso-layout-grid-align: none;" align="left"><span class="text"><span style="font-family: ";Arial";,";sans-serif";; font-size: 9pt;">We examine the problem of accepting a new request for a pre-stored VBR video stream that has been smoothed using any of the smoothing algorithms found in the literature. The output of these algorithms is a piecewise constant-rate schedule for a Variable Bit-Rate (VBR) stream. The schedule guarantees that the decoder buffer does not overflow or underflow. The problem addressed in this paper is the determination of the minimal time displacement of each new requested VBR stream so that it can be accommodated by the network and/or the video server without overbooking the committed traffic. We prove that this call-admission control problem for multiple requested VBR streams is NP-complete and inapproximable within a constant factor, by reducing it from the VERTEX COLOR problem. We also present a deterministic morphology-sensitive algorithm that calculates the minimal time displacement of a VBR stream request. The complexity of the proposed algorithm along with the experimental results we provide indicate that the proposed algorithm is suitable for real-time determination of the time displacement parameter during the call admission phase.</span></span><span style="font-family: ";Arial";,";sans-serif";; font-size: 9pt;"></span></p

Optimal Scheduling Algorithm in Vehicular Real Time System

“…For other tasks in Car Alarm System, like signal detecting, network management, bus fault diagnosis, power management etc, these tasks also have responsive requirement and even missing the deadline will not result in catastrophic results. We call such task periodic task with soft deadline which always use flexible computation or imprecise computation [2,3,[8][9][10].…”