Search

K-terminal network reliability analysis with length constraint has many applications in online video and real-time communications.Basically,we calculate k-terminal network reliability under the condition that the length between any terminal-pair of k-terminals is within a given time delay constraint called D.We study kterminal network reliability with length constraint,and propose a truncation-based path constraint method on the basis of the traditional terminal-pair and k-terminal network reliability algorithms.We also build a binary decision diagram(BDD)model to analyze k-terminal network reliability with constraints.The proposed algorithm has strong practical significance for kterminal point-to-point information flow to accomplish transmission under a certain time delay.Experimental results validate the feasibility and effectiveness of this method. [ABSTRACT FROM AUTHOR]