Abstract: Traditional studies on network reliability only consider the connectivity, but don’t meet the needs of users. This paper considers network’s capacity and delay constrains. It changes network’s topology under the capacity constraints of components（node or edge）, sets out the effective minimal path sets which meet the user’s delay constraint by improved node traversal method, makes the effective minimal path sets disjoint by BDD to obtain the exact value of the network terminal to terminal reliability. The proposed method is programmed to use Matlab languages, the method can be used in reliability analysis of the weighted network.

Key words: terminal to terminal reliability, capacity, delay, minimal path set, effective minimal path set

摘要： 早期对网络可靠性的研究主要是以连通性为网络功能来研究的，并没有考虑网络完成用户需求的能力。综合考虑网络容量以及时延约束，在网络部件（节点或边）的容量约束下改变网络的拓扑结构，通过改进的节点遍历法，将满足用户时延约束的有效最小路集输出，通过BDD算法对有效路集进行不交化，得出网络端端可靠度的精确值。算法采用Matlab程序实现，为评估加权网络可靠性提供了一种新方法。

关键词: 端端可靠性, 容量, 时延, 最小路集, 有效最小路集