Exportar Publicação

A publicação pode ser exportada nos seguintes formatos: referência da APA (American Psychological Association), referência do IEEE (Institute of Electrical and Electronics Engineers), BibTeX e RIS.

Exportar Referência (APA) 
Ferreira, M. A. M. (2025). M|D| Queue Busy Period and Busy Cycle Distributions Computational Calculus. arXiv:2505.10567.
Exportar Referência (IEEE) 
M. A. Ferreira,  "M|D| Queue Busy Period and Busy Cycle Distributions Computational Calculus", in arXiv:2505.10567, 2025
Exportar BibTeX 
@null{ferreira2025_1764921089355,
	year = "2025",
	url = "https://arxiv.org/abs/2505.10567"
}
Exportar RIS 
TY  - GEN
TI  - M|D| Queue Busy Period and Busy Cycle Distributions Computational Calculus
T2  - arXiv:2505.10567
AU  - Ferreira, M. A. M.
PY  - 2025
DO  - 10.48550/arXiv.2505.10567
UR  - https://arxiv.org/abs/2505.10567
AB  - Given the busy period and busy cycle major importance in queuing systems, it is crucial the knowledge of the respective distribution functions that is what allows the calculation of the important probabilities. For the M|G| queue system, there are no round form formulae for those distribution functions. But, for the M|D| queue, due the fact that its busy period and busy cycle have both Laplace transform expression round forms, what does not happen for any other M|G| queue system, with an algorithm created by Platzman, Ammons and Bartholdi III, that allows the tail probabilities computation since the correspondent Laplace transform in round form is known, those distribution functions calculations are possible. Here, we will implement the algorithm through a FORTRAN program.
ER  -