On functionals of a marked Poisson process observed by a renewal process.
On infinite-server queues with cyclically dependent service times
On inverse queuing processes
On Kingman's integral inequalities for approximations of the waiting time distribution in the queuing model GI/G/1 with and without warming-up time
On main characteristics of the queue with single and batch arrivals and the queue size controlled by AQM algorithms
In the article finite-buffer queueing systems of the type with queue size controlled by AQM algorithms are considered, separately for single and batch arrivals. In the latter case two different acceptance strategies: WBAS (Whole Batch Acceptance Strategy) and PBAS (Partial Batch Acceptance Strategy) are distinguished. Three essential characteristics of the system are investigated: the stationary queue-size distribution, the number of consecutively dropped packets (batches of packets) and the time...
On maxima of waiting times
On mixing processes and the lost-games distribution
On modulated random measures.
On network flow equations and splitting formulas for sojourn times in queueing networks.
On optimality of the FCFS discipline in multiserver queueing systems and networks.
On inventory system with random lead time and repeated demands.
On some degenerate large deviation problems.
On some queue length controlled stochastic processes.
On the behavior of LIFO preemptive resume queues in heavy traffic.
On the busy period for the M|G|1 queue with-finite waiting room
On the calculation of steady-state loss probabilities in the queue.
On the ergodic distribution of oscillating queueing systems.
On the level crossing of multi-dimensional delayed renewal processes.
On the M/G/1 retrial queue subjected to breakdowns
Retrial queueing systems are characterized by the requirement that customers finding the service area busy must join the retrial group and reapply for service at random intervals. This paper deals with the M/G/1 retrial queue subjected to breakdowns. We use its stochastic decomposition property to approximate the model performance in the case of general retrial times.
On the M/G/1 retrial queue subjected to breakdowns
Retrial queueing systems are characterized by the requirement that customers finding the service area busy must join the retrial group and reapply for service at random intervals. This paper deals with the M/G/1 retrial queue subjected to breakdowns. We use its stochastic decomposition property to approximate the model performance in the case of general retrial times.