By Topic

Maximum Reliability Route Subject to M Improvements In A Nondirected Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Kumar, S. ; Royal Melborne Institute of Technology; Melbourne, Vic. 3000 AUSTRALIA.

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.

Published in:

Reliability, IEEE Transactions on  (Volume:R-28 ,  Issue: 2 )