• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International IFIP-TC6 Networking Conference(NETWORKING 2004); 20040509-20040514; Athens; GR >On Core Selection Algorithm for Reducing Delay Variation of Many-to-Many Multicasts with Delay-Bounds
【24h】

On Core Selection Algorithm for Reducing Delay Variation of Many-to-Many Multicasts with Delay-Bounds

机译：减少带延迟边界的多对多组播延迟变化​​的核心选择算法研究

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

摘要

With the proliferation of multimedia group applications, the construction of multicast trees satisfying the quality of service (QoS) requirements is becoming a problem of the prime importance. In this paper, we study the core selection problem that should produce the improved delay-bounded multicast tree in terms of the delay variation that is known to be NP-complete. A solution to this problem is required to provide decent real-time communication services such as on-line games, shopping, and teleconferencing. Performance comparison shows that our proposed scheme outperforms that of DDVCA that is known to be most effective so far in any network topology. The enhancement is up to about 11.1% in terms of normalized surcharge for DDVCA. The time complexity of our algorithm is O(mn~2).
机译：随着多媒体组应用的激增，满足服务质量（QoS）要求的多播树的构建正成为最重要的问题。在本文中，我们研究了核心选择问题，该问题应根据已知为NP完全的延迟变化来产生改进的延迟边界多播树。为了提供诸如在线游戏，购物和电话会议之类的实时通信服务，需要解决该问题的方法。性能比较表明，我们提出的方案要优于迄今为止在任何网络拓扑中最有效的DDVCA方案。就DDVCA的正常附加费而言，此提高幅度约为11.1％。该算法的时间复杂度为O（mn〜2）。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号