首页> 外文期刊>Mathematical Problems in Engineering >A Fairness-Based Access Control Scheme to Optimize IPTV Fast Channel Changing
【24h】

A Fairness-Based Access Control Scheme to Optimize IPTV Fast Channel Changing

机译:基于公平的访问控制方案,可优化IPTV快速频道切换

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

摘要

IPTV services are typically featured with a longer channel changing delay compared to the conventional TV systems. The major contributor to this lies in the time spent on intraframe (I-frame) acquisition during channel changing. Currently, most widely adopted fast channel changing (FCC) methods rely on promptly transmitting to the client (conducting the channel changing) a retained I-frame of the targeted channel as a separate unicasting stream. However, this I-frame acceleration mechanism has an inherent scalability problem due to the explosions of channel changing requests during commercial breaks. In this paper, we propose a fairness-based admission control (FAC) scheme for the original I-frame acceleration mechanism to enhance its scalability by decreasing the bandwidth demands. Based on the channel changing history of every client, the FAC scheme can intelligently decide whether or not to conduct the I-frame acceleration for each channel change request Comprehensive simulation experiments demonstrate the potential of our proposed FAC scheme to effectively optimize the scalability of the I-frame acceleration mechanism, particularly in commercial breaks. Meanwhile, the FAC scheme only slightly increases the average channel changing delay by temporarily disabling FCC (i.e., I-frame acceleration) for the clients who are addicted to frequent channel zapping.
机译:与常规电视系统相比,IPTV服务通常具有更长的频道更改延迟。造成这种情况的主要原因是在频道更改期间花费在帧内(I帧)采集上的时间。当前,最广泛采用的快速信道改变(FCC)方法依赖于将目标信道的保留的I帧作为单独的单播流迅速发送给客户端(进行信道改变)。然而,由于商业广告期间频道改变请求的爆炸,这种I帧加速机制具有固有的可扩展性问题。在本文中,我们为原始I帧加速机制提出了一种基于公平性的准入控制(FAC)方案,以通过降低带宽需求来增强其可扩展性。基于每个客户端的信道更改历史,FAC方案可以智能地决定是否针对每个信道更改请求进行I帧加速。全面的仿真实验证明了我们提出的FAC方案有效地优化I的可扩展性的潜力。帧加速机制,尤其是在商业广告时段。同时,对于沉迷于频繁频道切换的客户,FAC方案通过暂时禁用FCC(即,I帧加速)仅稍微增加了平均频道改变延迟。

著录项

  • 来源
    《Mathematical Problems in Engineering》 |2014年第2期|207402.1-207402.12|共12页
  • 作者单位

    NEC Labs China, Beijing 10084, China;

    NEC Labs China, Beijing 10084, China;

    Department of Computer Engineering and Information Technology, University of Kurdistan, Sanandaj 66177 15175, Iran;

    College of Computer Science, Zhejiang University of Technology, Hangzhou 310023, China;

    NEC Labs China, Beijing 10084, China;

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

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号