BMAP/G/1/∞ system with last come first served probabilistic priority

Autor:	T. A. Milovanova
Rok vydání:	2009
Předmět:	Mathematical optimization Queue management system Markov chain Control and Systems Engineering Computer science Real-time computing Probabilistic logic Electrical and Electronic Engineering Last come first served
Zdroj:	Automation and Remote Control. 70:885-896
ISSN:	1608-3032 0005-1179
DOI:	10.1134/s0005117909050142
Popis:	Consideration was given to the BMAP/G/1/∞ single-server queuing system with batch Markov arrivals, arbitrary servicing, finite-capacity buffer, and last come first served probabilistic priority. Equations for determination of the stationary probabilities of states and stationary characteristics associated with the time of customer sojourn in the system were determined.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::234adf730c8726db753660653baa1cf0 https://doi.org/10.1134/s0005117909050142 Zobrazit plný text záznamu Plný text ve formátu PDF