A Modified Technique for Computing Network Reliability

Ahmad, Shafiq; Jamil, Awais

doi:10.1109/tr.1987.5222470

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1993

2015

Publication Types

Select...

Other2

Article2

Book1

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 5 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Obviously, the two-step methods are cumbersome too and even prone to occur combinational explosion [16]. So some scholars dedicated themselves to find out a way to get disjoint MPs without resorting to MPs [17][18][19][20][21][22]. In literature [23], Wu put forward an algorithm to directly get all the disjoint MPs by messages' continual transmission according to a set of rules.…”

Section: Introductionmentioning

confidence: 99%

Untitled

Tang¹,

Han²,

Yuan³

et al. 2015

Proceedings of the 4th International Conference on Information Technology and Management Innovation

View full text Add to dashboard Cite

From the point of message transmission and processing, this paper puts forward a new disjoint Minimal Path sets (MPs) algorithm to get the disjoint MPs of networks and trys to realize it by means of Discrete Events Simulation (DES). In the new method, the arcs of CoA network are regarded as processing units, nodes as storage units, and network as message transmission network. Taking SimEvents ® as the platform, the modeling idea of nodes, arcs and message transmission network are described in detail. An example verifies the correctness of the processing rules and the feasibility of using DES to generate the disjoint MPs automatically.

show abstract