• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International journal of communication systems >ESC: Estimation of selecting core for reducing multicast delay variation under delay constraints
【24h】

ESC: Estimation of selecting core for reducing multicast delay variation under delay constraints

机译：ESC：在延迟约束下选择核心以减少多播延迟变化​​的估计

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

With the spread of multimedia group applications, the construction of multicast trees satisfying the Quality of Service (QoS) requirements becomes a problem of prime importance. A principal factor of these real-time applications is to optimize the delay- and delay variation-bounded multicast tree (DVBMT) problem. This problem is to satisfy the minimum delay variation and the end-to-end delay within an upper bound. The DVBMT problem is known as an NP-complete problem. The representative algorithms are the DVMA, the DDVCA, and the ECS algorithm. In this paper, we show that the proposed ESC algorithm outperforms the DDVCA and the ECS algorithm. The efficiency of our algorithm is verified through performance evaluation and the enhancement is up to about 19.6% in terms of normalized surcharge for multicast delay variation. The time complexity of our algorithm is O(mn~2), which is comparable to the well-known DDVCA.
机译：随着多媒体组应用程序的普及，满足服务质量（QoS）要求的多播树的构造成为最重要的问题。这些实时应用程序的主要因素是优化延迟和与延迟变化相关的多播树（DVBMT）问题。这个问题是要满足最小延迟变化和上限内的端到端延迟。 DVBMT问题被称为NP完全问题。代表性算法是DVMA，DDVCA和ECS算法。在本文中，我们证明了所提出的ESC算法优于DDVCA和ECS算法。通过性能评估验证了我们算法的效率，并且针对多播延迟变化​​，归一化附加费方面的增强最多可达到19.6％。我们算法的时间复杂度为O（mn〜2），与众所周知的DDVCA相当。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号