DocumentCode
1988358
Title
Solvable classes for reliable network allocation
Author
Stivaros, Constantinstei
Author_Institution
Dept. of Comput. Sci., Fairleigh Dickinson Univ., Madison, NJ, USA
fYear
1993
fDate
27-29 May 1993
Firstpage
207
Lastpage
211
Abstract
A solution to the network allocation problem is an allocation of given operating probabilities to the nodes of a network so as to optimize its reliability. The reliability measure used is the residual reliability of the network, a noncoherent model. The problem is known to be NP-complete for an arbitrary network. We present classes of network topologies that admit solutions to this problem as in the class of star, in “very dense” classes, threshold, and bus and ring topologies
Keywords
computational complexity; graph theory; network topology; optimisation; reliability; resource allocation; NP-complete; arbitrary network; classes; network topologies; noncoherent model; operating probabilities; reliability measure; reliable network allocation; residual reliability; ring topologies; solvable classes; star very dense classes; Aging; Computer network reliability; Computer science; Cost function; Degradation; Network topology; Polynomials; System performance; Telecommunication network reliability; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing and Information, 1993. Proceedings ICCI '93., Fifth International Conference on
Conference_Location
Sudbury, Ont.
Print_ISBN
0-8186-4212-2
Type
conf
DOI
10.1109/ICCI.1993.315377
Filename
315377
Link To Document