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. (2022). Poisson Arrivals, Exponential Service Time, and Infinite Servers Queue Busy Period and Busy Cycle Distribution Function Bounds. arXiv:2209.05312. 1-7
Exportar Referência (IEEE) 
M. A. Ferreira,  "Poisson Arrivals, Exponential Service Time, and Infinite Servers Queue Busy Period and Busy Cycle Distribution Function Bounds", in arXiv:2209.05312, Ithaca,New York, pp. 1-7, 2022
Exportar BibTeX 
@unpublished{ferreira2022_1716184386229,
	author = "Ferreira, M. A. M.",
	title = "Poisson Arrivals, Exponential Service Time, and Infinite Servers Queue Busy Period and Busy Cycle Distribution Function Bounds",
	year = "2022",
	url = "https://arxiv.org/abs/2209.05312"
}
Exportar RIS 
TY  - EJOUR
TI  - Poisson Arrivals, Exponential Service Time, and Infinite Servers Queue Busy Period and Busy Cycle Distribution Function Bounds
T2  - arXiv:2209.05312
AU  - Ferreira, M. A. M.
PY  - 2022
SP  - 1-7
DO  - 10.48550/arXiv.2209.05312
CY  - Ithaca,New York
UR  - https://arxiv.org/abs/2209.05312
AB  - The busy period length distribution function knowledge is important for any queue system, and for the MGINF queue. But the mathematical expressions are in general very complicated, with a few exceptions, involving usually infinite sums and multiple convolutions. So, in this work are deduced some bounds for the MMINF system busy period length distribution function, meaning the second M exponential service time, which analytic expressions are simpler than the exact one. As a consequence, also some bounds for the MMINF system busy cycle length distribution function are presented.
ER  -