Title :
Maximum Reliability Route Subject to M Improvements In A Nondirected Network
Author_Institution :
Royal Melborne Institute of Technology; Melbourne, Vic. 3000 AUSTRALIA.
fDate :
6/1/1979 12:00:00 AM
Abstract :
The network consists of imperfect nondirected links and perfect nodes. For each link, some i.i.d. parallel redundant links will be attached, thus improving the reliability of communication between that pair of nodes. The problem is to determine the maximum-reliability route and optimally distribute a given number, M, of parallel redundant links on this path. Each redundant link has the reliability of the original link between the two nodes. Policy iteration technique of dynamic programming is used to solve the problem.
Keywords :
Dynamic programming; Equations; Joining IEEE; Mathematical model; Probability; Reliability theory; Telecommunication network reliability; Visualization; Links; Maximum reliability path; Nondirected networks; Optimization; Policy iteration technique of dynamic programming;
Journal_Title :
Reliability, IEEE Transactions on
DOI :
10.1109/TR.1979.5220519
