• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>2010 IEEE International Symposium on Multimedia >Temporal-DHT and Its Application in P2P-VoD Systems
【24h】

Temporal-DHT and Its Application in P2P-VoD Systems

机译：时间DHT及其在P2P-VoD系统中的应用

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Peer-to-Peer (P2P) based Video-on-Demand (VoD) streaming services are gaining popularity. Meanwhile, the technical barriers of P2P-VoD systems still exist because of asynchronous and dynamic user interactivity where any user can jump to random locations in the video stream along with the support for Fast-Forward/Fast-Backward operations. An important component to address these issues lies in efficient neighbor discovery mechanism for searching and receiving desired data in a peer-to-peer fashion with less burden of the server. We advocate a Distributed Hash Table (DHT) based overlay for efficient lookup with its desirable features of provable scalability, robustness and decentralization for supporting Internet-scale P2P applications. However, one big challenge associated with a DHT-based overlay is how to accommodate a large number of update operations with the continuous change of peersȁ9; playing position. To solve this inadequacy, we propose a novel concept of temporal-DHT which exploits the temporal dynamics of the content to estimate the playing position of peers, thereby greatly reducing the update overhead. We also propose a new content management and discovery scheme by the skillful integration of: (1) random/out-of-order/static caching to support interactive operations and (2) playing/in-order/dynamic caching to maintain streaming efficiency and playback continuity. Extensive simulation results demonstrate that our mechanism achieves low messaging overhead with high streaming quality for P2P-VoD systems in a dynamic environment where peers asynchronously join/leave the network.
机译：基于点对点（P2P）的视频点播（VoD）流服务越来越受欢迎。同时，由于异步和动态的用户交互性，P2P-VoD系统的技术障碍仍然存在，在这种交互中，任何用户都可以跳转到视频流中的随机位置，并支持快进/快退操作。解决这些问题的重要组成部分在于有效的邻居发现机制，该机制用于以对等方式搜索和接收所需数据，而服务器的负担较小。我们提倡基于分布式哈希表（DHT）的覆盖图进行有效查找，并具有可证明的可扩展性，鲁棒性和分散性的理想功能，以支持Internet规模的P2P应用程序。但是，与基于DHT的覆盖相关的一大挑战是如何在对等体9不断变化的情况下容纳大量的更新操作。比赛位置。为了解决这一不足，我们提出了一种新的时间DHT概念，该概念利用内容的时间动态来估计对等方的播放位置，从而大大减少了更新开销。我们还通过以下技巧的集成提出了一种新的内容管理和发现方案：（1）随机/无序/静态缓存以支持交互操作;（2）播放/有序/动态缓存以保持流传输效率;以及播放连续性。大量的仿真结果表明，在对等方异步加入/离开网络的动态环境中，我们的机制为P2P-VoD系统实现了低消息传递开销和高流质量。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号