For Yu Tao's isebm05, this article mainly has two improvements:
(1) If the out degree of the immediate predecessor node of the failed node is 1, then the CSBP of Yu Tao AlgorithmThis article will not be able to solve this problem. We will continue to backtrack until we find out a node's out degree> 1; however, the CSBP method of Yu Tao is used to restore the ongoing process. This method may be traced back to the node before the immediate predecessor node, so the ongoing process cannot be continued.
(2) model the QoS of links between nodes, including loss probability, network delay, and bandwidth ratio. There is no essential change.
Although the idea in this paper is simple, it seems hard to write it clearly. the concepts of some formulas and symbols are not well described when they appear for the first time (such as Definition 2, 3, and 4), and the algorithm is not well written (such as step 2 ), we did not describe how to create a Web Service combination.
Also, in definition2, "LN1/1-lpei" should be "LN1/(1-lpei )"
