![DSpace logo](/jspui/image/logo.gif)
Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/10234
Title: | Subset Cut Enumeration of Flow Networks with Imperfect Nodes |
Authors: | Chakraborty, Suparna |
Keywords: | EEE Flow Networks Imperfect Nodes |
Issue Date: | 2014 |
Publisher: | Totem Publisher |
Abstract: | A general assumption made in evaluation of flow network reliability is perfectly reliable nodes. Under such assumption, network reliability is evaluated through subset cut or composite path set approaches. This paper presents a simple approach to account for node failures in reliability evaluation of flow networks using subset cut approach. The proposed approach starts with generating combinations of nodes of the network and utilizes subset cuts (with perfect nodes) to find the valid additional subset cuts due to imperfect nodes. These additional subset cuts consist of only nodes or nodes-links combinations. To illustrate efficacy of the proposed approach, computational results on various benchmarks networks are provided. The proposed method is applicable to evaluate additional minimal cut sets due to imperfect nodes from minimal cut sets (with perfect nodes) for networks considering only connectivity as the success criteria or additional subset cut set for networks with multiple node pair capacity requirements. |
URI: | http://www.ijpe-online.com/EN/10.23940/ijpe.15.1.p81.mag http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/10234 |
Appears in Collections: | Department of Electrical and Electronics Engineering |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.