Evaluation of all one-to-many reliabilities for acyclic multistate-node distributed computing system under cost and capacity constraints

  • Yeh W
  • 3

    Readers

    Mendeley users who have this article in their library.
  • 3

    Citations

    Citations of this article.

Abstract

A novel problem is proposed in this study by considering all one-to-many acyclic multistate-node distributed computing system (AMNDCS) reliabilities with limited cost (budget) and memory capacity. The AMNDCS is an extension of the multistate network without satisfying the flow conservation law. A very straightforward and simply programmed exact algorithm is developed for this problem using the universal generating function method (UGFM) and a generalized multiplication operator. The correctness and computational complexity of the proposed algorithm will be analyzed and proven. An illustrative example is presented to demonstrate how this problem is solved using the proposed UGFM. © 2007 Elsevier B.V. All rights reserved.

Author-supplied keywords

  • Capacity
  • Cost
  • Multistate
  • Network reliability
  • Universal generating function

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free