首页> 外文期刊>Computer networks >On optimal media/video distribution in closed P2P-based IPTV networks
【24h】

On optimal media/video distribution in closed P2P-based IPTV networks

机译:基于封闭式P2P的IPTV网络中的最佳媒体/视频分发

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

摘要

Video distribution over the Internet has become a popular service because of technological advances in internet (e.g., higher network bandwidth) and video coding (e.g., H.264/SVC). In this and other similar media distribution applications, a server or distribution center sends a media/video to a group peers with different bandwidth resources and display capacities. In one of the approaches, the peer-to-peer approach, the server sends only one copy of the media over Internet, and each peer receives one segment of the media and exchanges his/her segment with other peers to receive the complete media. A key design issue in this approach is deciding the sizes of the segments delivered to individual peer which affect the time of complete media distribution. Equal sized segmentation does not always result in the least distribution time. In this paper, we study the problem of how to distribute non-scalable and scalable coded media from a server in closed peer-to-peer based IPTV networks. We propose a new distribution algorithm to find the media segment sizes optimized for the bandwidths of participating peers in order to minimize the time it takes to distribute the entire media to all end subscribers. First, we focus on finding the optimal solution in non-scalable media distribution. Then, we extend our method to scalable media distribution to find optimal segment sizes for all media layers. Simulations are conducted by varying the number of peers and media sizes to investigate the impact of these parameters on both non-scalable and scalable video distribution. The experimental results have demonstrated the scalability and efficiency of the proposed distribution algorithm.
机译:由于因特网(例如,更高的网络带宽)和视频编码(例如,H.264 / SVC)的技术进步,通过因特网的视频分发已经成为流行的服务。在此和其他类似的媒体分发应用程序中,服务器或分发中心将媒体/视频发送给具有不同带宽资源和显示容量的组对等方。在一种方法,即对等方法中,服务器仅通过Internet发送媒体的一个副本,并且每个对等方接收媒体的一个片段,并与其他对等方交换他/她的片段以接收完整的媒体。这种方法中的一个关键设计问题是确定交付给各个对等方的段的大小,这会影响完整媒体分发的时间。大小相等的分段并不总是导致分配时间最少。在本文中,我们研究了如何在基于封闭的对等IPTV网络中从服务器分发不可缩放和可缩放的编码媒体的问题。我们提出了一种新的分发算法,以找到针对参与对等方的带宽优化的媒体段大小,以最大程度地减少将整个媒体分发给所有最终订户的时间。首先,我们专注于在不可扩展的媒体分发中找到最佳解决方案。然后,我们将方法扩展到可伸缩的媒体分发,以找到所有媒体层的最佳段大小。通过改变对等体的数量和媒体大小来进行仿真,以研究这些参数对不可扩展和可扩展视频分发的影响。实验结果证明了该分配算法的可扩展性和有效性。

著录项

  • 来源
    《Computer networks》 |2014年第26期|217-232|共16页
  • 作者

    Hao Cui; Xiao Su; Weijia Shang;

  • 作者单位

    Computer Engineering Department, Santa Clara University, Santa Clara, CA 95053, USA;

    Computer Engineering Department, San Jose State University, San Jose, CA 95192, USA;

    Computer Engineering Department, Santa Clara University, Santa Clara, CA 95053, USA;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    IPTV; Peer-to-peer; Media; Video; Distribution;

    机译:IPTV;点对点;媒体;视频;分配;
  • 入库时间 2022-08-18 02:12:40

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号