We consider the problem of estimating the unreliability of a stochastic flow network, defined as the probability that the maximum flow value from a source node to a terminal node in a directed network with stochastic link capacities, is less than a specified demand level. The link capacities are assumed to be continuous random variables with a known joint distribution. We are interested in the situation where the unreliability is very small, in which case a crude Monte Carlo is not viable. We show how a Monte Carlo splitting algorithm can be adapted to handle this problem effectively
Abstract—Solving network flow problems is a fundamental component of traffic engineering and many co...
AbstractTraditionally, many researchers solved the multicommodity maximum flow problem by assuming t...
Each arc in a capacitated-flow network has discrete and multiple-valued random capacities. Many stud...
pp:1-18We consider a network whose links have random capacities and in which a certain target amount...
This paper proposes an algorithm to evaluate the probability that d units of data can be sent from t...
For a single-commodity stochastic flow network, the system capacity is the maximum flow from the sou...
Reducing the transmission time for a flow network is an essential task. The quickest path problem th...
AbstractWhile link capacities of urban transportation networks possess inherent randomness due to va...
[[abstract]]This paper is mainly to extend the MMCF (multi-commodity minimum cost flow) problem from...
A MP/minimal cutset (MC) is a path/cut set such that if any edge is removed from this path/cut set, ...
This paper provides a detailed review of the state of the art in the field of network reliability an...
We consider the evaluation of the flow network reliability parameter. Because the exact evaluation o...
Under the assumption that each branch’ capacity of the network is deterministic, the quickest ...
Assessing the reliability of complex technological systems such as communication networks, transport...
AbstractThis paper discusses a stochastic-flow network from single-commodity case to multicommodity ...
Abstract—Solving network flow problems is a fundamental component of traffic engineering and many co...
AbstractTraditionally, many researchers solved the multicommodity maximum flow problem by assuming t...
Each arc in a capacitated-flow network has discrete and multiple-valued random capacities. Many stud...
pp:1-18We consider a network whose links have random capacities and in which a certain target amount...
This paper proposes an algorithm to evaluate the probability that d units of data can be sent from t...
For a single-commodity stochastic flow network, the system capacity is the maximum flow from the sou...
Reducing the transmission time for a flow network is an essential task. The quickest path problem th...
AbstractWhile link capacities of urban transportation networks possess inherent randomness due to va...
[[abstract]]This paper is mainly to extend the MMCF (multi-commodity minimum cost flow) problem from...
A MP/minimal cutset (MC) is a path/cut set such that if any edge is removed from this path/cut set, ...
This paper provides a detailed review of the state of the art in the field of network reliability an...
We consider the evaluation of the flow network reliability parameter. Because the exact evaluation o...
Under the assumption that each branch’ capacity of the network is deterministic, the quickest ...
Assessing the reliability of complex technological systems such as communication networks, transport...
AbstractThis paper discusses a stochastic-flow network from single-commodity case to multicommodity ...
Abstract—Solving network flow problems is a fundamental component of traffic engineering and many co...
AbstractTraditionally, many researchers solved the multicommodity maximum flow problem by assuming t...
Each arc in a capacitated-flow network has discrete and multiple-valued random capacities. Many stud...