首页> 外文会议>ACM SIGMOD international conference on Management of data >Dynamic buffer allocation in video-on-demand systems
【24h】

Dynamic buffer allocation in video-on-demand systems

机译:视频点播系统中的动态缓冲区分配

获取原文

摘要

In video-on-demand (VOD) systems, as the size of the buffer allocated to user requests increases, initial latency and memory requirements increase. Hence, the buffer size must be minimized. The existing static buffer allocation scheme, however, determines the buffer size based on the assumption that the system is in the fully loaded state. Thus, when the system is in a partially loaded state, the scheme allocates a buffer larger than necessary to a user request. This paper proposes a dynamic buffer allocation scheme that allocates to user requests buffers of the minimum size in a partially loaded state as well as in the fully loaded state. The inherent difficulty in determining the buffer size in the dynamic buffer allocation scheme is that the size of the buffer currently being allocated is dependent on the number of and the sizes of the buffers to be allocated in the next service period. We solve this problem by the predict-and-enforce strategy, where we predict the number and the sizes of future buffers based on inertia assumptions and enforce these assumptions at runtime. Any violation of these assumptions is resolved by deferring service to the violating new user request until the assumptions are satisfied. Since the size of the current buffer is dependent on the sizes of the future buffers, the size is represented by a recurrence equation. We provide a solution to this equation, which can be computed at the system initialization time for runtime efficiency. We have performed extensive analysis and simulation. The results show that the dynamic buffer allocation scheme reduces initial latency (averaged over the number of user requests in service from one to the maximum capacity) to 1 ÷ 29.4 ≁ 1 ÷ 11.0 of that for the static one and, by reducing the memory requirement, increases the number of concurrent user requests to 2.36 ∼ 3.25 times that of the static one when averaged over the amount of system memory available. These results demonstrate that the dynamic buffer allocation scheme significantly improves the performance and capacity of VOD systems.

机译:

在视频点播(VOD)系统中,随着分配给用户请求的缓冲区的大小增加,初始等待时间和内存需求也会增加。因此,必须将缓冲区大小最小化。但是,现有的静态缓冲区分配方案是基于系统处于满载状态的假设来确定缓冲区大小的。因此,当系统处于部分加载状态时,该方案为用户请求分配了比所需的缓冲区大的缓冲区。本文提出了一种动态缓冲区分配方案,该方案可以在部分加载状态和完全加载状态下为用户请求分配最小大小的缓冲区。在动态缓冲区分配方案中确定缓冲区大小的固有困难在于,当前正在分配的缓冲区的大小取决于在下一个服务周期中要分配的缓冲区的数量和大小。我们通过预测并执行策略解决了这个问题,在该策略中,我们根据惯性假设预测了未来缓冲区的数量和大小,并在运行时强制执行了这些假设。对这些假设的任何违反都可以通过将服务推迟到违反新用户请求的方式解决,直到满足这些假设为止。由于当前缓冲区的大小取决于将来缓冲区的大小,因此该大小由递归方程表示。我们为该方程式提供了解决方案,可以在系统初始化时计算出该方程式,以提高运行时效率。我们已经进行了广泛的分析和模拟。结果表明,动态缓冲区分配方案将初始等待时间(在服务中的用户请求数从1到最大容量平均)降低到1÷29.4≁。对静态请求的1÷11.0,并通过减少内存需求,将并发用户请求的数量增加到静态请求的2.36到3.25倍(当对可用系统内存量进行平均时)。这些结果表明,动态缓冲区分配方案显着提高了VOD系统的性能和容量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号