D. Hou, N. Huang, and Y. Chen, “An Evaluation Method for Communication Network Topology Reliability Based on MarkovModel”, 20I0 IEEE International Conf. on Educational and Information Technology (ICEIT 2010), Vol. 2, pp. 345- 349.
 A. M. Shooman, A. M., and A. Kershenbau,“Methods for Communication-Network Reliability Analysis: Probabilistic GraphReduction”, Proceed. AnnualReliability and Maint. Symp. 1992. IEEE, NY, pp. 441–448.
 M. Daoud, and Q. H. Mahmoud,“Estimating the Task Route Reliability of Mobile Agent- based Systems using Monte CarloSimulation”, Proceed. of the 10thIEEE Symp. on Computers and Comm. (2005). pp. 569-574.
 M. Chari, and C. J. Colbourn,“Reliability polynomial: a survey”,Journal of combinatorial information and system science , Vol. 22, pp. 177-193, (1997).
Tikrit Journal of Engineering Sciences (2013) 20(1) 10-20
Development of New Algorithm for Communication Networks Reliability Based on Tie Set Method Combined with a Modified Flooding Algorithm
|Musaria Karim Mahmood|
|Electrical Eng. Dept., Tikrit University, Iraq|
This paper presents a new method to calculate the network reliability based on the use of flooding routing algorithm. Tie Set (TS) method is one of probabilistic reliability method, is combined with flooding technique to generate an efficient new method to estimate reliability. The proposed method can be generalized to be active with others reliability methods such as Cut Set, and Enumeration methods. TS method depends on two factors: finding the TS paths and the inclusion-exclusion expansion equations. A modified flooding algorithm is used to generate the group of TS paths which is then used to find the reliability. It will be demonstrated by a case experiment the simplicity and effectiveness of the flooding technique to generate paths between a pair of nodes in a graphical representation of a communication network.
Keywords: Communication Network, Reliability, Tie Set, Flooding Algorithm, Graph.