中文摘要：

文章研究网络参数不确定时的多播（multlcast）QoS路由及分解问题，假定网络链路参数是模糊数，给出了最优可信度树（Most Optimal Reliability Tree，MORT）和树最优延迟分解（Tree Delay Optimal Partition。TDOP）的定义,MORT要求寻找一条联结源节点和目标节点集的支撑树使得树的代价小于约束条件的可信度达到最大，TDOP要求给出端到端约束在树上各条链路的分解使得反映所有链路满足QoS需求的分解函数达到最优．文中给出MORT的近似算法并对误差进行分析，证明TDOP可以在多项式时间内实现并给出具体算法。

英文摘要：

This paper studies the multicast QoS routing and partition problem with uncertain net work parameters. Under the assumption that the link parameter is the fuzzy number, the authors give the definition on MORP（Most Optimal Reliability Tree）and TDOP（Tree Delay Optimal Partition）. MORP calls for finding a tree to join the source node and the set of destination nodes at the same time the reliability of tree costs satisfying the QoS needs must be optimized. TDOP calls for finding the best partition of QoS requirements on multicast trees so that the function about the links satisfying the constraint is optimized. The authors give the approximation algorithm on MORP and make error analysis. Then they prove TDOP can be solved with polynomial time complexity and propose the algorithm.