摘要
目的研究非确定环境下对组播树的QoS分解问题。方法每条网络链路都定义了一个概率函数,其值等于在非确定环境下链路资源满足局部QoS约束的概率。结果提出了一种如何将每一组组播成员的端到端QoS约束分解为局部QoS约束,使组播树的总体安全性最大的QoS分解算法。结论算法时间复杂度为O(Max/σ×|T|2),算法可以生成优化的合理解。
Aim To propose a systematic study on solving the problem of how to partition end-to-end QoS restriction under uncertain condition. Methods Each link is associated with a probability function, whose value is equal to the probability when the link＇s resources are enough to achieve the local QoS restriction under uncertain condtion. Results An algorithm has been proposed to solve the problem on how to partition end-to-end QoS restriction of every member in a multicast group into local restrictions, in which the overall security of the multicast tree is maximized. Conclusion An optimized result is finally generated to solve the problem, and the complexity of our approach is O（Max/σ×｜T｜^2）.
出处
《西北大学学报（自然科学版）》
CAS
CSCD
北大核心
2008年第2期181-184,共4页
Journal of Northwest University（Natural Science Edition）
基金
陕西省自然科学基金资助项目(2005F53)
关键词
非确定环境
集成服务模型
QoS分解
组播
uncertain condition
integrated services model
QoS partitioning
multicast
