Computer Science – Networking and Internet Architecture
Scientific paper
2008-02-28
Computer Science
Networking and Internet Architecture
12 pages, 9 figures, includes appendix
Scientific paper
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 accomodated 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 make it suitable for real-time determination of the time displacement parameter during the call admission phase.
Mehler Andrew
Papamichail Dimitris
Skiena Steven
Tryfonas Christos
No associations
LandOfFree
Call Admission Control Algorithm for pre-stored VBR video streams does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Call Admission Control Algorithm for pre-stored VBR video streams, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Call Admission Control Algorithm for pre-stored VBR video streams will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-472158