Invariant permutations for consecutive k-out-of-n cycles
Invariant permutations for consecutive k-out-of-n cycles
复制标题
连续 n 个循环中的 k 个循环的不变排列
DOI：
10.1109/24.24575
复制
发表时间：
1989
期刊：
影响因子：
--
通讯作者：
F. Hwang
中科院分区：
文献类型：
--
作者：
F. Hwang
提出了连续的k / n循环作为k环计算机网络的拓扑结构，并描述了一个有n个组件的循环系统，当且仅当任何k个连续组件全部失效时，系统失效。假设组件是可互换的。问题是，假设组件的可靠性不相等，哪种排列能使系统可靠性最大化。如果存在一个最优排列，该排列依赖于组件可靠性的排序，而不依赖于组件可靠性的值，则该系统（和该排列）称为不变的。除了k=1, 2, n-2， n-1和n. >外，圆系统不是不变的
Consecutive-k-out-of-n cycles are proposed as topologies for k-loop computer networks and describe a circular system of n components where the system fails if and only if any k consecutive components all fail. Suppose that the components are interchangeable. The the question arises as to which permutation maximizes the system reliability, assuming that the components have unequal reliabilities. If there exists on optimal permutation which depends on the ordering, but not the values, of the component reliabilities, then the system (and the permutation) is called invariant. The circular system is found to be not invariant except for k=1, 2, n-2, n-1, and n. >