Title of article
Using minimalcutstooptimizenetworkreliabilityforastochasticcomputer network subjecttoassignmentbudget
Author/Authors
Yi-Kuei Lin، نويسنده , , Cheng-TaYeh ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
13
From page
1175
To page
1187
Abstract
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.
Keywords
Stochastic computer network , Network reliability optimization , Assignment budget , Genetic Algorithm , Minimal cuts , Recursive Sum of Disjoint Products
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927936
Link To Document