Moments of the duration of busy periods of mx/g/1/n systems

Authors:
António Pacheco;H. Ribeiro
Affiliations:
Department of mathematics and cematinstituto superior técnico—technical university of lisbon1049-001 lisboa, portugal e-mail: apacheco@math.ist.utl.pt;Cemat and instituto politécnico de leiria escola superior de tecnologia e gestão morro do lena–alto do vieiro 2411-901 leiria, portugal e-mail: mhcr@estg.ipleiria.pt
Venue:
Probability in the Engineering and Informational Sciences
Year:
2008

Citing 4
Cited 1

Modeling and analysis of stochastic systems

Modeling and analysis of stochastic systems
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
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems
Busy period analysis for M/G/1 and G/M/1 type queues with restricted accessibility

Operations Research Letters

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 derive a simple recursion to compute moments of arbitrary order of the duration of busy periods of MX/G/1/n systems starting with an arbitrary number of customers in the system.