Analysis of finite-buffer multi-server queues with group arrivals: GIX/M/c/N
Queueing Systems: Theory and Applications
The Remaining Service Time upon Reaching a High Level in M/G/1 Queues
Queueing Systems: Theory and Applications
The M/G-G/1 Oscillating Queueing System
Queueing Systems: Theory and Applications
Model Checking CSL until Formulae with Random Time Bounds
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Loss process analysis of the knockout switch using stochastic activity networks
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
ON THE NUMBER OF REFUSALS IN A BUSY PERIOD
Probability in the Engineering and Informational Sciences
On the Remaining Service Time upon Reaching a Given Level in M/G/1 Queues
Queueing Systems: Theory and Applications
The oscillating queue with finite buffer
Performance Evaluation
Consecutive customer loss probabilities in M/G/1/n and GI/M(m)//n systems
SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chains
Moments of the duration of busy periods of mx/g/1/n systems
Probability in the Engineering and Informational Sciences
Model checking expected time and expected reward formulae with random time bounds
Computers & Mathematics with Applications
On the infimum attained by a reflected Lévy process
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
We derive fast recursions to compute the probability that k or more consecutive customer losses take place during a busy period of a queue, the so called k-CCL probability, for regular and oscillating M X /G/1/n systems.