DocumentCode
1341949
Title
Maximum Reliability Route Subject to k-Improvements in a Directed Network
Author
Bansal, S.P. ; Kumar, S.
Author_Institution
A.R.S.D. College; Delhi University; Dhaula Kuan; New Delhi 110021 INDIA
Issue
2
fYear
1977
fDate
6/1/1977 12:00:00 AM
Firstpage
103
Lastpage
105
Abstract
The network consists of links and perfect nodes. Each link has several known reliability numbers associated with it; each reliability number is related to the number of improvements made on that link. The network reliability is to be maximised subject to a constraint on the sum of the number of link improvements, by finding the appropriate route through the network. Dynamic programming is used to solve the problem. A numerical example illustrates the solution.
Keywords
Dynamic programming; Equations; Reliability theory; Routing; Telecommunication network reliability; Tellurium; Directed network; Dynamic programming; Link; Network reliability; Optimization; Path;
fLanguage
English
Journal_Title
Reliability, IEEE Transactions on
Publisher
ieee
ISSN
0018-9529
Type
jour
DOI
10.1109/TR.1977.5220064
Filename
5220064
Link To Document