A Generalization of Consecutive k-out-of-n : G Systems

スポンサーリンク

概要

• 論文の詳細を見る

• A generalized class of consecutive-k-out-of-n:G systems, referred to as Con/k^*/n:G systems, is studied. A Con/k^*/n:G system has n ordered components and is good if and only if k_i good consecutive components that originate at component i are all good, where k_i is a function of i. Theorem 1 gives an O(n)time equation to compute the reliability of a linear system and Theorem 2 gives an O(n^2)time equation for a circular system. A distributed computing system with a linear(ring)topology is an example of such system. This application is very important, since for other classes of topologies, such as general graphs, planar graphs, series-parallel graphs, tree graphs, and star graphs, this problem has been proven to be NP-hard.

• 社団法人電子情報通信学会の論文
• 2000-06-25

著者

• Chen D‐j

  The Author Is With Institute Of Computer Science And Information Engineering National Chiao-tung Uni

• LIN Min-Sheng

  The author is with the Department of Information Management, Aletheia University

• CHANG Ming-Sang

  The author is with Chunghwa Telecommunication Training Institute, Taipei

• CHEN Deng-Jyi

  The author is with Institute of Computer Science and Information Engineering, National Chiao-Tung Un

• Lin M‐s

  National Taipei Univ. Technol. Taipei Twn

• Chang Ming-sang

  The Author Is With Chunghwa Telecommunication Training Institute Taipei

関連論文

• A Generalization of Consecutive k-out-of-n : G Systems
• The Distributed Program Reliability Analysis on a Star Topology : Efficient Algorithms and Approximate Solution

スポンサーリンク