Distribution and reliability evaluation of max-flow in dynamic multi-state flow networks

Jane, Chin-Chia; Laih, Yih-Wenn

doi:10.1016/j.ejor.2016.12.030

Cited by 25 publications

(7 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many algorithms in the literature have used the following results to search for all the d-MP s in an MFN [2,8,15,17,19,20,24,45,55].…”

Section: Preliminariesmentioning

confidence: 99%

1 Exact reliability evaluation of multistate flow networks

Forghani-elahabad¹

2021

Systems Reliability Engineering

View full text Add to dashboard Cite

Evaluating the reliability of complex technical networks, such as those in energy distribution, logistics, and transportation systems, is of paramount importance. These networks are often represented as multistate flow networks (MFNs). While there has been considerable research on assessing MFN reliability, many studies still need to pay more attention to a critical factor: transmission distance constraints. These constraints are typical in real-world applications, such as Internet infrastructure, where controlling the distances between data centers, network nodes, and end-users is vital for ensuring low latency and efficient data transmission. This paper addresses the evaluation of MFN reliability under distance constraints. Specifically, it focuses on determining the probability that a minimum of d flow units can be transmitted successfully from a source node to a sink node, using only paths with lengths not exceeding a predefined distance limit of λ. We introduce an effective algorithm to tackle this challenge, provide a benchmark example to illustrate its application and analyze its computational complexity.

show abstract

“…Many algorithms in the literature have used the following results to search for all the d-MP s in an MFN [2,8,15,17,19,20,24,45,55].…”

Section: Preliminariesmentioning

confidence: 99%

1 Exact reliability evaluation of multistate flow networks

Forghani-elahabad¹

2021

Systems Reliability Engineering

View full text Add to dashboard Cite

show abstract

“…Therefore, the two-terminal reliability index in this work, denoted by R (d,T,b) , is defined as the probability of transmitting d units of data from a source to a destination through a single path in the network within T units of time and budget b. Many algorithms have been proposed in the literature to compute the network reliability with or without the time and budget constraints which are usually based on the minimal cuts [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24] or minimal paths [4], [8], [9], [10], [25], [26], [27], [28], [29], [30], [31], [32], [33], [34], [35], [36]. Although many studies have been made so far in this regard, the problem of assessing the reliability of communication networks is a well-known NP-hard combinatorial problem [37], and hence the research continues.…”

Section: Introductionmentioning

confidence: 99%

Assessing the performance of smart grid communication networks under both time and budget constraints

Forghani-elahabad

2021

Preprint

View full text Add to dashboard Cite

“…A prominent related problem is the two-terminal multistate reliability evaluation, which is now considered as a classical network reliability problem. Several methods have been developed that focus on this problem as well as provide critical insights into multistate modelling in general [6][7][8][9][10][11][12][13][14][15]. This paper examines two methods of evaluating the reliability of multistate flow networks.…”

Section: Introductionmentioning

confidence: 99%

Reliability Evaluation of Multi-State Flow Networks Via Map Methods

Rushdi

Alsalami

2020

JERR

View full text Add to dashboard Cite

This paper examines two simple (albeit useful) methods used to evaluate the reliability of two-terminal multistate flow networks. These two methods involve two Karnaugh map versions, namely the Variable-Entered Karnaugh Map (VEKM) and the Multi-Valued Karnaugh Map (MVKM). These two versions are crucial in providing not only the visual insight necessary to write better future software but also adequate means of verifying such software. We assess these two versions of map methods versus the exhaustive search method, which guarantees conceptual clarity at the expense of lack of computational efficiency. Our target is the evaluation of the probability mass function (pmf) in a wide array of cases, in which we consider flow from a source node to a sink node in a capacitated network with a multistate capacity model for the links. Each network link has a varying capacity, which is assumed to exist in a mutually exclusive sense. The reliability of the system is wholly dependent on its ability to successfully transmit at least a certain required system flow from the source (transmitter) to the sink (receiver) station. The max-flow min-cut theorem is critical in obtaining all successful states. To demonstrate the proposed methods applicability, two demonstrative examples are given with ample details.

show abstract

Distribution and reliability evaluation of max-flow in dynamic multi-state flow networks

Cited by 25 publications

References 29 publications

1 Exact reliability evaluation of multistate flow networks

1 Exact reliability evaluation of multistate flow networks

Assessing the performance of smart grid communication networks under both time and budget constraints

Reliability Evaluation of Multi-State Flow Networks Via Map Methods

Contact Info

Product

Resources

About