预存VBR视频流的呼叫接纳控制算法
Call Admission Control Algorithm for pre-stored VBR video streams
摘要：
我们研究的问题，接受一个新的请求的预存储的VBR视频流，已被平滑使用的任何平滑算法在文献中找到。这些算法的输出是可变比特率（VBR）流的分段恒定速率调度。该调度保证解码器缓冲区不会上溢或下溢。本文所解决的问题是确定每个新请求的VBR流的最小时间位移，以便它可以被网络和/或视频服务器容纳，而不会超额预订承诺的流量。我们证明了多个请求的VBR流的呼叫准入控制问题是NP-完全的，在一个常数因子内是不可逼近的，通过减少它从顶点颜色问题。我们还提出了一个确定性的形态敏感的算法，计算VBR流请求的最小时间位移。该算法的复杂性使其适合于在呼叫接纳阶段实时确定时间位移参数。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
