...
【24h】

Server-assisted adaptive video replication for P2P VoD

机译:服务器辅助的P2P VoD自适应视频复制

获取原文
获取原文并翻译 | 示例

摘要

In recent years, Peer-to-Peer assisted Video-on-Demand (P2P VoD) has become an effective and efficient approach to distribute high-quality videos to large number of peers. In a P2P VoD system, each peer contributes storage to store several videos to help offload the server. The replication strategy, which determines the videos to be stored at each peer's local storage, plays an important role in system performance. There are two approaches: (a) solve a huge combinatorial optimization problem and (b) use simple cache replacement algorithms, such as Least-Frequently-Requested (LFR) or FIFO. The first approach needs to collect a large number of parameters whose values may be changing, and use some approximation method (such as linearization) to solve the optimization problem, both aspects have accuracy issues. In the second approach, a peer replaces some video in the cache with the currently viewed video, based on local information. While it is simple, we show their performance can be improved by a little centrally collected state information. Specifically, the needed feedback information is the current downloading rate provided by peers for each video. In this paper, we describe a hybrid replication strategy, and give detailed description of how the server collects and maintains the feedback information, and how peers use that information to determine what videos to store and indirectly control their uplink bandwidth contribution. This explains why the hybrid strategy is much simpler and more practical than the combinatory optimization approach. We then use simulation to demonstrate how our scheme out-performs the simple adaptive algorithms. Our simulation results also demonstrate how our scheme is able to quickly respond to peer churn and video popularity churn.
机译:近年来,点对点辅助视频点播(P2P VoD)已成为一种向大量对等方分发高质量视频的有效途径。在P2P VoD系统中,每个对等方都贡献存储空间来存储多个视频,以帮助减轻服务器负担。复制策略决定了要存储在每个对等方本地存储中的视频,在系统性能中起着重要作用。有两种方法:(a)解决一个巨大的组合优化问题,(b)使用简单的缓存替换算法,例如最少请求(LFR)或FIFO。第一种方法需要收集其值可能会变化的大量参数,并使用某种近似方法(例如线性化)来解决优化问题,这两个方面都存在精度问题。在第二种方法中,对等方根据本地信息将缓存中的某些视频替换为当前查看的视频。尽管很简单,但我们展示了通过少量集中收集状态信息可以提高其性能。具体来说,所需的反馈信息是对等方为每个视频提供的当前下载率。在本文中,我们描述了一种混合复制策略,并详细描述了服务器如何收集和维护反馈信息,以及对等方如何使用该信息来确定要存储哪些视频并间接控制其上行链路带宽贡献。这就解释了为什么混合策略比组合优化方法更简单,更实用。然后,我们使用仿真来演示我们的方案如何胜过简单的自适应算法。我们的仿真结果还证明了我们的方案如何能够快速响应同伴流失和视频受欢迎度流失。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号