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

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Yeh, W. C. (2007). Evaluation of all one-to-many reliabilities for acyclic multistate-node distributed computing system under cost and capacity constraints. Computer Communications, 30(18), 3796–3806. https://doi.org/10.1016/j.comcom.2007.09.005

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free