Please use this identifier to cite or link to this item:
http://hdl.handle.net/10071/28076
Author(s): | Ferreira, M. A. M. |
Editor: | Xingting Wang |
Date: | 2022 |
Title: | Study about Riccati equation in an infinite servers queue system with poisson arrivals occupation study |
Volume: | 1 |
Book title/volume: | Novel research aspects in mathematical and computer science |
Pages: | 22 - 26 |
Reference: | Ferreira, M. A. M. (2022). Study about Riccati equation in an infinite servers queue system with poisson arrivals occupation study. EM Xingting Wang (Eds.). Novel research aspects in mathematical and computer science (Vol.1, pp. 22-26). Book Publisher International. 10.9734/bpi/nramcs/v1/2039B |
ISBN: | 978-93-5547-172-7 |
DOI (Digital Object Identifier): | 10.9734/bpi/nramcs/v1/2039B |
Keywords: | M/G/oo Riccati equation Busy period Busy cycle |
Abstract: | In M/G/oo queue real life practical applications, the busy period and the busy cycle probabilistic study is of main importance. But it is a very difficult task. In this chapter, we show that by solving a Riccati equation induced by this queue transient probabilities monotony study as time functions, we obtain a collection of service length distribution functions, for which both the busy period and the busy cycle have lengths with quite simple distributions, generally given in terms of exponential distributions and the degenerate at the origin distribution. |
Peerreviewed: | yes |
Access type: | Open Access |
Appears in Collections: | ISTAR-CLI - Capítulos de livros internacionais |
Files in This Item:
File | Size | Format | |
---|---|---|---|
bookPart_88668.pdf | 481,65 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.