Full metadata record
DC FieldValueLanguage
dc.contributor.authorYeh, YSen_US
dc.contributor.authorChiu, CCen_US
dc.date.accessioned2014-12-08T15:44:11Z-
dc.date.available2014-12-08T15:44:11Z-
dc.date.issued2001-02-15en_US
dc.identifier.issn0140-3664en_US
dc.identifier.urihttp://dx.doi.org/10.1016/S0140-3664(00)00242-5en_US
dc.identifier.urihttp://hdl.handle.net/11536/29850-
dc.description.abstractA k-node set reliability with capacity constraint is defined as the probability that a set, K, of nodes is connected in a distributed system and the total capacity of the nodes in K is sufficient under a given capacity. This is generally an NP-hard problem. For reducing computational time, a reasonable k-node set within a given capacity constraint must be determined by an efficient algorithm. In this work, we propose a reversing traversal method to derive a k-node set under capacity constraint having an approximate solution. Initially, the set K is assigned to all the nodes in a system. The proposed algorithm uses an objective function to evaluate the fitness value of each node in K and predict a deleting node, which is not a critical node, in K with minimal fitness value. After deleting the node, the fitness value of each node that is adjacent to the deleted node is tuned. The above two processes are repeated until the total capacity of the nodes in each subset of the set K does not satisfy the capacity constraint. In our simulation, the proposed method can obtain an exact solution above 90%. When a sub-optimal solution is obtained, the average deviation from an exact solution is under 0.0033. Computational results demonstrate that the proposed algorithm is efficient in execution time and effective for obtaining an optimal k-node set with capacity constraint. (C) 2001 Elsevier Science B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectreversing traversal algorithmen_US
dc.subjectdistributed systemsen_US
dc.subjectreliability optimizationen_US
dc.subjectk-node set reliabilityen_US
dc.titleA reversing traversal algorithm to predict deleting node for the optimal k-node set reliability with capacity constraint of distributed systemsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/S0140-3664(00)00242-5en_US
dc.identifier.journalCOMPUTER COMMUNICATIONSen_US
dc.citation.volume24en_US
dc.citation.issue3-4en_US
dc.citation.spage422en_US
dc.citation.epage433en_US
dc.contributor.department資訊科學與工程研究所zh_TW
dc.contributor.departmentInstitute of Computer Science and Engineeringen_US
dc.identifier.wosnumberWOS:000167003700014-
dc.citation.woscount1-
Appears in Collections:Articles


Files in This Item:

  1. 000167003700014.pdf