...
首页> 外文期刊>IEEE Journal on Selected Areas in Communications >Optimal multicast smoothing of streaming video over the Internet
【24h】

Optimal multicast smoothing of streaming video over the Internet

机译:互联网上流媒体视频的最佳组播平滑

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

获取外文期刊封面封底 >>

       

摘要

A set of applications such as Internet video broadcasts, corporate telecasts, and distance learning require the simultaneous streaming of video to a large population of viewers across the Internet. The high bandwidth requirements and the multi-timescale burstiness of compressed video make it a challenging problem to provision network resources for streaming multimedia. For such applications to become affordable and ubiquitous, it is necessary to develop scalable techniques to efficiently stream video to a large number of disparate clients across a heterogeneous Internet. In this paper, we propose to multicast smoothed video over an application-level overlay network of proxies, and to differentially cache the video at the intermediate nodes (proxies) in the distribution tree, in order to reduce the network bandwidth requirements of video dissemination. We formulate the multicast smoothing problem as an optimization problem, and develop an algorithm for computing the set of transmission schedules for the tree that minimize the peak rate and rate variability, given buffer constraints at different nodes in the tree. We also develop an algorithm to compute the minimum buffer allocation in the entire tree, such that feasible transmission to all the clients is possible, when the tree has heterogeneous rate constraints. We show through trace-driven simulations that substantial benefits are possible from multicast smoothing and differential caching, and that these gains can be realized even with modest proxy caches.
机译:一系列应用程序,如互联网视频广播,企业电视和远程学习,需要同时将视频流传输到互联网上的大量观众。压缩视频的高带宽要求和多时间尺度突发使其成为流媒体多媒体的网络资源的具有挑战性的问题。对于这种应用来说,成为经济实惠和无处不在的应用,有必要开发可扩展的技术,以将视频有效地流到异构互联网上的大量不同客户端。在本文中,我们建议在代理的应用程序级覆盖网络上进行平滑视频,并在分发树中的中间节点(代理)差异地缓存视频,以减少视频传播的网络带宽要求。我们将多播平滑问题作为优化问题,开发用于计算树的传输计划集的算法,这最小化了树中的不同节点的缓冲区约束,可以最小化峰值速率和速率变化。我们还开发了一种计算整个树中的最小缓冲区分配的算法,使得当树具有异质速率约束时,可以实现对所有客户端的可行传输。我们通过跟踪驱动模拟显示,可以从多播平滑和差异缓存具有大量优势,并且即使使用适度的代理高速缓存也可以实现这些增益。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号