首页> 外文会议>Natural Computation (ICNC), 2008 Fourth International Conference on >An Algorithm for Multicast Optimal Partition of QoS with Uncertain Condition
【24h】

An Algorithm for Multicast Optimal Partition of QoS with Uncertain Condition

机译:不确定条件下QoS的组播最优分配算法

获取原文

摘要

The paper considered a framework that resource allocation is based on local QoS restriction at each network link in a certain multicast tree, and each link is associated with a probability function whose value is equal to the probability of the linkȁ9;s resources. An algorithm has been developed to solve the problem of how to partition end-to-end QoS restriction including every member in a multicast group into local restrictions, and the overall security of the multicast tree is maximized.
机译:本文认为,资源分配基于在特定组播树中的每个网络链路上的本地QoS限制的框架,并且每个链路与概率函数相关联,该概率函数的值等于链路ȁ9的概率。已经开发了一种算法来解决如何将包括组播组中的每个成员分配到本地限制的端到端QoS限制的问题,并且多播树的整体安全性最大化。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号