带长度约束的k端网络可靠性分析

k-terminal network reliability analysis with length constraint

在网络视频和实时通信应用中需要研究带长度约束的k端网络可靠性分析问题,即任意两端点之间在给定时间延迟D约束内的k端网络可靠性。对带长度约束的k端网络可靠性问题进行了研究,主要是在传统不带路径约束的双端和k端网络可靠性研究基础上,提出了基于截断的路径约束方法;并根据该方法构造二元决策图BDD模型进行带约束的k端网络可靠性分析。该算法针对k端点对点信息流在一定时间延迟下完成传输问题,具有较强的实际意义。实例分析结果验证了本方法的可行性和有效性。

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 k terminal 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 k terminal point-to-point information flow to accomplish transmission under a certain time delay. Experimental results validate the feasibility and effectiveness of this method.