A method for calculating the marginal probabilities of states of cyclic queueing systems
type: Item
instance of: scholarly article
title: A method for calculating the marginal probabilities of states of cyclic queueing systems
zbMATH Open document ID: 0928.60084
author: E. A. Saksonov
published in: Automation and Remote Control
publication date: 2000-01-09T00:00:00Z
review text: The paper considers a queueing system without losses consisting of one server and \(N\) independent Poisson input flows. Demands from the \(i\)th flow form the \(i\)th queue. Queues are served in cyclic order \(1\to 2\to 3\to\cdots\to N\to 1\). Server needs some time to switch over queues and processes all demands found in queue at the beginning of servicing. Let \(n_k\) be the length of the \(k\)th queue. The paper suggests a numerical method for calculating the stationary distribution of \((n_1,n_2,\dots, n_N)\).
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 1290214
zbMATH Keywords: queueing system without losses
zbMATH Keywords: stationary distribution
reviewed by: Oleg K. Zakusilo
MaRDI profile type: Publication
Recommended article: On a numerical method for calculating state probabilities for queueing systems with more than one waiting line
Recommended article: Q3330277
Recommended article: Calculation of steady-state probabilities of M/M queues: Further approaches
Recommended article: A method for obtaining the unsteady state probabilities in Markovian queueing networks
Recommended article: Q4873245
Recommended article: Q5219031
Recommended article: A queueing system with invariant state probabilities
Recommended article: Q4516116
Recommended article: Q3607037
description: scientific article; zbMATH DE number 1290214