Decision Diagram Based Symbolic Algorithm for Evaluating the Reliability of a Multistate Flow Network

Table 4

Experimental results for different algorithms.

Demand	Reference [1]				Proposed algorithms
					MFN_OBDD			MFN_MDD			Loop
	Collection^1	Storage (bytes)	CPU time (s)	Loop	Node	Storage (bytes)	CPU time (s)	Node	Storage (bytes)	CPU time (s)
1	294	51,744	0.016	636	611	7,332	0.024046	42	1,848	0.001928	17
2	294	51,744	0.016	636	611	7,332	0.216549	43	1,892	0.010049	153
3	294	51,744	0.016	636	611	7,332	1.3385	43	1,892	0.032208	969
4	9486	1,669,536	0.268	20,002	3,514	42,144	6.64096	51	2,244	0.475073	4,845
5	9486	1,669,536	0.268	20,002	3,514	42,144	27.7825	62	2,728	1.28560	20,349

1: collection is the main data structure of the algorithm in [1]. It contains the lower bound of edge state vector, the upper bound of edge state vector, the edge state flow vector, the vector of nonzero state edges, and two constants.