Skip to Main Content
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.