We determine the distribution of the maximum level of the workload in some queueing, dam and storage processes. The models under consideration are the following. (i) The Markov mountain: a storage or dam model that alternates between exponentially distributed ON and OFF periods. The buffer content increases (decreases) at some state-dependent rate when ON (OFF). (ii) The semi-Markov mountain: as (i), but with generally distributed ON periods. (iii) The M/G/1 queue with various forms of customer impatience
The paper deals with queueing systems in which N- and D-policies are combined into one. This means t...
In this paper we consider Lévy processes without negative jumps, reflected at the origin. Feedback i...
We consider the M/M/c queue, where customers transfer to a critical state when their queueing (sojou...
We determine the distribution of the maximum level of the workload in some queueing, dam and storage...
ABSTRACT We determine the distribution of the maximum level of the workload in some queueing, dam an...
This paper is devoted to the analysis of a fluid queue with a buffer content that varies linearly du...
This paper deals with the distribution of the maximum queue length in two-dimensional Markov models....
We consider M/G/1 queues with workload-dependent arrival rate, service speed, and restricted accessi...
A dynamic data structure called queue is analyzed in this paper from the viewpoint of its maximum si...
Abstract—This paper analyzes queueing behavior in queues with a random number of parallel flows, and...
The present state of extreme value theory for queues is surveyed. The exposition focuses on the rege...
Two-dimensional continuous-time Markov chains (CTMCs) are useful tools for studying stochastic model...
We examine level crossings of sample paths of queueing processes and investigate the conditions unde...
The paper deals with queueing systems in which N- and D-policies are combined into one. This means t...
In this paper we consider Lévy processes without negative jumps, reflected at the origin. Feedback i...
We consider the M/M/c queue, where customers transfer to a critical state when their queueing (sojou...
We determine the distribution of the maximum level of the workload in some queueing, dam and storage...
ABSTRACT We determine the distribution of the maximum level of the workload in some queueing, dam an...
This paper is devoted to the analysis of a fluid queue with a buffer content that varies linearly du...
This paper deals with the distribution of the maximum queue length in two-dimensional Markov models....
We consider M/G/1 queues with workload-dependent arrival rate, service speed, and restricted accessi...
A dynamic data structure called queue is analyzed in this paper from the viewpoint of its maximum si...
Abstract—This paper analyzes queueing behavior in queues with a random number of parallel flows, and...
The present state of extreme value theory for queues is surveyed. The exposition focuses on the rege...
Two-dimensional continuous-time Markov chains (CTMCs) are useful tools for studying stochastic model...
We examine level crossings of sample paths of queueing processes and investigate the conditions unde...
The paper deals with queueing systems in which N- and D-policies are combined into one. This means t...
In this paper we consider Lévy processes without negative jumps, reflected at the origin. Feedback i...
We consider the M/M/c queue, where customers transfer to a critical state when their queueing (sojou...