AbstractIn this paper we study the existence of empirical distributions of G/G/1 queues via a sample-path approach. We show the convergence along a given trajectory of empirical distributions of the workload process of a G/G/1 queue under the condition that the work brought into the system has strictly stationary increments and the time average of the queue load converges along the trajectory to a quantity ϱ < 1. In particular, we identify the limit as the expectation with respect to the Palm distribution associated with the beginning of busy cycles. The approach is via the use of a sample-path version of Beneš result describing the time evolution of the workload process. It turns out that the Beneš equation leads to consideration of the re...
In many applications, significant correlations between arrivals of load-generating events make the n...
In this paper we study the sample paths during a busy period of a Finite MEP/MEP/1 system, where bot...
We consider an M/G/1 queue in which an arriving customer doesn’t enter the system whenever its virtu...
In this paper we study the existence of empirical distributions of G/G/1 queues via a sample-path ap...
We examine level crossings of sample paths of queueing processes and investigate the conditions unde...
In this paper we study the excursions of the workload process of G/GI/1 queues above a given level. ...
In this paper it is demonstrated how a nonparametric estimator of the stationary workload distributi...
We consider nonparametric estimation of the stationary distribution of the number of customers in a ...
Abstract- We present a Markov model to analyze the queue-ing behavior of the nonstationary G(t)/G(t)...
AbstractWe consider nonparametric estimation of the stationary distribution of the number of custome...
Abstract. The distribution of the remaining service time upon reaching some target level in an M/G/1...
We consider a polling system: a queueing system of $N \geq 1$ queues with Poisson arrivals $Q_1, \ld...
Consider an M/G/1 queue with unknown service-time distribution and unknown traffic intensity ρ. Give...
In this paper continuity theorems are established for the number of losses during a busy period of t...
We consider two types of queues with workload-dependent arrival rate and service speed. Our study is...
In many applications, significant correlations between arrivals of load-generating events make the n...
In this paper we study the sample paths during a busy period of a Finite MEP/MEP/1 system, where bot...
We consider an M/G/1 queue in which an arriving customer doesn’t enter the system whenever its virtu...
In this paper we study the existence of empirical distributions of G/G/1 queues via a sample-path ap...
We examine level crossings of sample paths of queueing processes and investigate the conditions unde...
In this paper we study the excursions of the workload process of G/GI/1 queues above a given level. ...
In this paper it is demonstrated how a nonparametric estimator of the stationary workload distributi...
We consider nonparametric estimation of the stationary distribution of the number of customers in a ...
Abstract- We present a Markov model to analyze the queue-ing behavior of the nonstationary G(t)/G(t)...
AbstractWe consider nonparametric estimation of the stationary distribution of the number of custome...
Abstract. The distribution of the remaining service time upon reaching some target level in an M/G/1...
We consider a polling system: a queueing system of $N \geq 1$ queues with Poisson arrivals $Q_1, \ld...
Consider an M/G/1 queue with unknown service-time distribution and unknown traffic intensity ρ. Give...
In this paper continuity theorems are established for the number of losses during a busy period of t...
We consider two types of queues with workload-dependent arrival rate and service speed. Our study is...
In many applications, significant correlations between arrivals of load-generating events make the n...
In this paper we study the sample paths during a busy period of a Finite MEP/MEP/1 system, where bot...
We consider an M/G/1 queue in which an arriving customer doesn’t enter the system whenever its virtu...