A Discrete-Event Solver for Repairable Flow Networks with Complex Topology

Abstract

The paper presents a discrete-event simulator of repairable flow networks with complex topology. The solver is based on an efficient algorithm for maximizing the flow in repairable flow networks with complex topology. The discrete-event solver maximizes the flow through the repairable network upon each component failure and return from repair. This ensures a larger output flow compared to a flow maximization conducted on the static flow network. Because of the flow maximization upon failure and return from repair, the simulator also tracks naturally the variation of the output flow from multiple overlapping failures. The discrete-event solver determines the basic performance characteristic of repairable flow networks – the expected output flow delivered during a specified time interval in the presence of component failures.