A queuing model for a processor-shared multi-terminal system subject to breakdowns

Almási B.: A queuing model for a processor-shared multi-terminal system subject to breakdowns. In: Acta cybernetica, (10) 4. pp. 273-282. (1992)

[thumbnail of cybernetica_010_numb_004_273-282.pdf]
Cikk, tanulmány, mű

Download (701kB) | Preview


This paper deals with a non-homogeneous finite-source queuing model to describe the performance of a multi-terminal system subject to random breakdowns under PPS (Priority Processor-Sharing) service discipline. It can be viewed as a continuation of paper [l], which discussed a FIFO (First-ln, FirstOut) serviced queuing model subject to random breakdowns. All random variables are assumed to be independent and exponentially distributed. The system's behaviour can be described by a Markov chain, but the number of states is very large (it is a combinatorically increasing function of the number of terminals). The purpose of this paper is to give a recursive computational approach to solve the steady-state equations and to illustrate the problem in question using some numerical results.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 1992
Volume: 10
Number: 4
ISSN: 0324-721X
Page Range: pp. 273-282
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38495/
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: 282. p. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:26
Last Modified: 2022. Jun. 13. 09:12
URI: http://acta.bibl.u-szeged.hu/id/eprint/12512

Actions (login required)

View Item View Item