Consecutive customer loss probabilities in M/G/1/n and GI/M(m)//n systems

Authors:
António Pacheco;Helena Ribeiro
Affiliations:
Instituto Superior Técnico, Lisboa, Portugal;Instituto Politécnico de Leiria, Leiria, Portugal
Venue:
SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chains
Year:
2006

Citing 7
Cited 1

Adventures in stochastic processes

Adventures in stochastic processes
Modeling and analysis of stochastic systems

Modeling and analysis of stochastic systems
Performance Analysis of Communication Systems with Non-Markovian Stochastic Petri Nets

Performance Analysis of Communication Systems with Non-Markovian Stochastic Petri Nets
The Remaining Service Time upon Reaching a High Level in M/G/1 Queues

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
On the Remaining Service Time upon Reaching a Given Level in M/G/1 Queues

Queueing Systems: Theory and Applications
Analysis of GI/M/s/c queues using uniformisation

Computers & Mathematics with Applications

Consecutive customer losses in regular and oscillating MX/G/1/n systems

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the probability that k or more consecutive customer losses take place during a busy period of a queue, the so called k-CCL probability. We derive efficient algorithms to compute k-CCL probabilities in M/G/1/n and GI/M(m)//n systems for busy periods starting with an arbitrary number of customers in the system that, essentially, reduce to solving either simple recursions or linear systems of equations.