【24h】

An Efficient Multicast Tree with Delay and Delay Variation Constraints

机译:具有延迟和延迟变化约束的高效组播树

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

摘要

With the rapid evolution of real time multimedia applications like audio/video conferencing, interactive distributed games and real time remote control system, a certain Quality of Service (QoS) needs to be guaranteed in underlying networks. Multicast routing algorithms should support the required QoS. There are two important QoS parameters, bounded delay and delay variation, that need to be guaranteed in order to support the real time multimedia applications. Here we solve Delay and delay Variation Bounded Multicast Tree (DVBMT) problem which has been proved to NP-complete. In this paper, we propose an efficient algorithm for DVBMT. The performance enhancement is up to about 21.7% in terms of delay variation as compared to the well-known algorithm, KBC.
机译:随着诸如音频/视频会议,交互式分布式游戏和实时远程控制系统等实时多媒体应用的迅速发展,需要在基础网络中保证一定的服务质量(QoS)。组播路由算法应支持所需的QoS。为了支持实时多媒体应用,需要保证两个重要的QoS参数:有界延迟和延迟变化。在这里,我们解决了延迟和延迟变化有界组播树(DVBMT)问题,该问题已被证明是NP完全的。在本文中,我们提出了一种有效的DVBMT算法。与众所周知的算法KBC相比,在延迟变化方面,性能提高了约21.7%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号