Exact analysis of queueing networks under real traffic histograms becomes quickly
intractable due to the state explosion. In this paper, we propose to apply the stochastic …

We present a numerical method based on stochastic bounds and computations of discrete
distributions to get the transient reliability of a system described by a Dynamic Fault Tree …

We show how to obtain stochastic bounds for the strong stochastic ordering and the concave
ordering of the maximal flow in a network where the capacities are non negative discrete …

We present an approach to derive performance bounds of a queue under histogram-based
input traffics. The results are obtained through strong stochastic bounds on the queue length …

This paper presents an approach to provide stochastic bounds for a large class of
optimisation problems on graphs when the parameters (ie costs, weights or delays) for links …

We consider a stochastic network where the arcs are associated to discrete random
variables which represent the delay. We need to compute the shortest delay (or equivalently …

We consider a stochastic network where the arcs are associated to discrete random
variables which represent the delay. We need to compute the shortest delay (or equivalently …

We analyze the performance of a network under general traffics derived from traces. We
apply stochastic comparisons in order to derive bounding histograms with a reduced size …

We present an extension of a methodology based on monotonicity of various networking
elements and measurements performed on real networks. Assuming the stationarity of flows …

We present a new method based on strong stochastic bounds and numerical computations
on discrete distributions of failure time of the links to analyze the distribution of time before …