An Algorithm for Multicast Optimal Partition of QoS with Uncertain Condition

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 linkpsilas 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.