Algorithms for the quickest time distribution of dynamic stochastic-flow networks

Abstract

Quickest time, which is the least possible time necessary to transmit a fixed amount of data from a source node to a destination node, has been widely explored in the past few years. A quickest path transmits data via a single path, whereas a quickest flow transmits data via all possible paths. In a dynamic stochastic-flow network in which each arc capacity… (More)
DOI: 10.1051/ro/2016073

Topics

8 Figures and Tables

Slides referencing similar topics