Using minimalcutstooptimizenetworkreliabilityforastochasticcomputer network subjecttoassignmentbudget

In ourmodernsociety,informationanddataareusuallytransmittedthroughacomputernetwork.Since the computernetwork’sreliabilityhasagreatimpactonthequalityofdatatransmission,many organizationsdevotetoevaluatingorimprovingnetworkreliability,especiallyfornetworkreliability optimization.Thisstudyfocusesonsuchaconfrontedproblemthatistofindtheoptimaltransmission line assignmenttothecomputernetworksuchthatnetworkreliabilityismaximizedsubjecttothebudget constraint.Eachtransmissionlineownsseveralstatesduetofailure,maintenance,etc.,andthusthe computernetworkassociatedwithanytransmissionlineassignmentiscalledastochasticcomputer network.Networkreliabilityistheprobabilitythatthecomputernetworkcantransmitthespecifiedunits of datasuccessfully.BecausethediscussedproblemisNP-hard,anoptimizationalgorithmthatintegrates the geneticalgorithm,minimalcutsandRecursiveSumofDisjointProductsisproposed.Experimental results illustratethesolutionprocedureandshowthattheproposedalgorithmcanbeexecutedina reasonabletime.