A stationary storage process with Brownian input and constant service rate is studied. Explicit formulae for quantities related to busy periods (excursions) are derived. In particular, we compute the distributions of the occupation times the process spends above and below, respectively, the present level during the on-going busy period, and make the surprising observation that these occupation times are identically distributed
textabstractWe analyze a single-node network with Brownian input. We first derive an explicit expres...
We analyse a storage process with dynamical arrivals and departures. Under probabilistic assumptions...
We consider, in a homogeneous Markov process with finite state space, the occupation times that is, ...
A stationary storage process with Brownian input and constant service rate is studied. Explicit form...
This article we analyzes the quasi-stationary workload of a Lévy-driven storage system. More precise...
In this paper we introduce a storage process with singular continuous input. The input process is de...
This paper considers queues with server vacations, but departs from the traditional setting in two w...
htmlabstractThis paper considers queues with server vacations, but departs from the traditional sett...
This chapter gives an overview of some properties of the storage occupancy process in a buffer fed w...
In this paper, the area swept under the workload graph is analyzed: with {Q(t): t=0} denoting the st...
AbstractIn this paper we study a storage process or a liquid queue in which the input process is the...
In this thesis, a storage model with infinite capacity, additive stochastic input and unit release p...
In this paper we generalize known workload decomposition results for Lévy queues with secondary jump...
textabstractWe analyze a single-node network with Brownian input. We first derive an explicit expres...
We analyse a storage process with dynamical arrivals and departures. Under probabilistic assumptions...
We consider, in a homogeneous Markov process with finite state space, the occupation times that is, ...
A stationary storage process with Brownian input and constant service rate is studied. Explicit form...
This article we analyzes the quasi-stationary workload of a Lévy-driven storage system. More precise...
In this paper we introduce a storage process with singular continuous input. The input process is de...
This paper considers queues with server vacations, but departs from the traditional setting in two w...
htmlabstractThis paper considers queues with server vacations, but departs from the traditional sett...
This chapter gives an overview of some properties of the storage occupancy process in a buffer fed w...
In this paper, the area swept under the workload graph is analyzed: with {Q(t): t=0} denoting the st...
AbstractIn this paper we study a storage process or a liquid queue in which the input process is the...
In this thesis, a storage model with infinite capacity, additive stochastic input and unit release p...
In this paper we generalize known workload decomposition results for Lévy queues with secondary jump...
textabstractWe analyze a single-node network with Brownian input. We first derive an explicit expres...
We analyse a storage process with dynamical arrivals and departures. Under probabilistic assumptions...
We consider, in a homogeneous Markov process with finite state space, the occupation times that is, ...
DOI
Add to ORKG