Scholarlink

<p>Real-world complex communication networks in which components of a system work at various performance level are categorized into stochastic flow networks (SFN). In these networks, components including arcs and nodes have multiple capacities instead of complete failures followed by a certain probability distribution, hence they are also known as Multistate Flow Networks. Reliability of multistate networks is concerned as the probability that maximum flow from source node <i>s</i> to destination node <i>t</i> should not be less than the demand <i>d</i> over multiple capacitated components. This paper proposes an efficient algorithm to enumerate the stochastic flow network reliability based on combination method using minimal cut sets. An illustrative example is provided to improve the clarity of the approach. The proposed algorithm is implemented in Java and results are compared with various benchmark networks for performance analysis. Additionally, a case study related to power transmission network is presented to demonstrate the procedure. Overall objective of this paper is to provide a useful tool to network designers for enhancing their ability in design and maintenance of real-time networks.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Reliability assessment and analysis of multi state flow networks based on minimal cutsets

  • 期刊论文

  • 发表日期：

    2025年6月28日

查看全文
  • Vartika Sharma

摘要

Real-world complex communication networks in which components of a system work at various performance level are categorized into stochastic flow networks (SFN). In these networks, components including arcs and nodes have multiple capacities instead of complete failures followed by a certain probability distribution, hence they are also known as Multistate Flow Networks. Reliability of multistate networks is concerned as the probability that maximum flow from source node s to destination node t should not be less than the demand d over multiple capacitated components. This paper proposes an efficient algorithm to enumerate the stochastic flow network reliability based on combination method using minimal cut sets. An illustrative example is provided to improve the clarity of the approach. The proposed algorithm is implemented in Java and results are compared with various benchmark networks for performance analysis. Additionally, a case study related to power transmission network is presented to demonstrate the procedure. Overall objective of this paper is to provide a useful tool to network designers for enhancing their ability in design and maintenance of real-time networks.