Investigating the behaviour of a discrete retrial system

Kárász, Péter: Investigating the behaviour of a discrete retrial system. In: Acta cybernetica, (18) 4. pp. 681-693. (2008)

[img] Cikk, tanulmány, mű

Download (151kB)


Certain technological applications use queuing systems where the service time of entering entities cannot take any value, it can only be a multiple of a certain cycle-time. As examples of this, one can mention the landing of aeroplanes and the optical buffers of internet networks. Servicing an entering customer can be started immediately, or, if the server is busy, or there are waiting customers, the new customer joins a queue, moving along a closed path which can be completed within a fixed cycle-time of T units. Applications in digital technology induce the investigation of discrete systems. We give the mathematical description of systems serving two types of customers, where inter-arrival times follow a geometric distribution, and service times are distributed uniformly. A Markov-chain is defined and the generating functions of transition probabilities are calculated. The condition of ergodicity is established and the equilibrium distribution is given.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2008
Volume: 18
Number: 4
ISSN: 0324-721X
Page Range: pp. 681-693
Language: angol
Event Title: Symposium of Young Scientists on Intelligent Systems, 2., 2007, Budapest
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: p. 692-693.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Jun. 05. 14:49

Actions (login required)

View Item View Item