Analysis and Optimization of Repairable Flow Networks With Complex Topology
We propose a frame work for analysis and optimization of repairable flow networks by (i) stating and proving the maximum flow minimum flow path resistance theorem for networks with merging flows (ii) a discrete-event solver for determining the variation of the output flow from repairable flow networks with complex topology (iii) a procedure for determining the threshold flow rate reliability for repairable networks with complex topology (iv) a method for topology optimization of repairable flow networks and (v) an efficient algorithm for maximizing the flow in non-reconfigurable flow networks with merging flows. Maximizing the flow in a static flow network does not necessarily guarantee that the flow in the corresponding non-reconfigurable repairable network will be maximized. In this respect, we introduce a new concept related to repairable flow networks: 'a specific resistance of a flow path' which is essentially the average percentage of losses from component failures for a flow path from the source to the sink. A very efficient algorithm based on adjacency arrays has also been proposed for determining all minimal flow paths in a network with complex topology and cycles. We formulate and prove a fundamental theorem about non-reconfigurable repairable flow networks with merging flows. The flow in a repairable flow network with merging flows can be maximized by preferentially saturating directed flow paths from the sources to the sink, characterized by the largest average availability. The procedure starts with the flow path with the largest average availability (the smallest specific resistance), and continues by saturating the unsaturated directed flow path with the largest average availability until no more flow paths can be saturated. A discrete-event solver for reconfigurable repairable flow networks with complex topology has also been constructed. The proposed discrete-event solver maximizes the flow rate in the network upon each component failure and return from repair. By maximizing the flow rate upon each component failure and return from repair, the discrete-event solver ensures a larger total output flow during a specified time interval. The designed simulation procedure for determining the threshold flow rate reliability is particularly useful for comparing flow network topologies, and selecting the topology characterized by the largest threshold flow rate reliability. It is also very useful in deciding whether the resources allocated for purchasing extra redundancy are justified. Finally, we propose a new optimization method for determining the network topology combining a maximum output flow rate attained within a specified budget for building the network. The optimization method is based on a branch and bound algorithm combined with pruning the full-complexity network as a way of exploring the possible repairable networks embedded in the full-complexity network.
repairable flow networks complex topology maximum flow threshold flow rate reliability topology optimization discrete-event simulator minimal paths reconfigurable and non-reconfigurable networks stochastic optimization