首页> 外文会议>Proceedings of 16th International Conference on Computer Communication vol.1 >A Multi-Constraint Minimum-Cost Multicast Routing Algorithm
【24h】

A Multi-Constraint Minimum-Cost Multicast Routing Algorithm

机译:一种多约束最小成本组播路由算法

获取原文

摘要

A source based heuristic algorithm for NPC multi-constraint minimum-cost multicast routing problem in high network environment is proposed in this paper. The algorithm MCMCT is practical and scalable. Both theoretic analyses and simulation results show that MCMCT can perform well with low operation complexity, and adapt well to real networks to support some services with restrict QoS requirements.
机译:针对高网络环境下的NPC多约束最小开销组播路由问题,提出了一种基于源的启发式算法。 MCMCT算法是实用且可扩展的。理论分析和仿真结果均表明,MCCMT能够以较低的操作复杂度实现良好的性能,并能很好地适应实际网络,以支持某些服务质量受限的服务。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号