Matrix algorithm for Polling models with PH distribution
Închide
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
700 5
Ultima descărcare din IBN:
2020-09-14 10:10
SM ISO690:2012
MISHKOY, Gheorghe; KRIEGER, Udo; BEJENARI, Diana. Matrix algorithm for Polling models with PH distribution. In: Buletinul Academiei de Ştiinţe a Moldovei. Matematica. 2012, nr. 1(68), pp. 70-80. ISSN 1024-7696.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Buletinul Academiei de Ştiinţe a Moldovei. Matematica
Numărul 1(68) / 2012 / ISSN 1024-7696

Matrix algorithm for Polling models with PH distribution

Pag. 70-80

Mishkoy Gheorghe, Krieger Udo, Bejenari Diana
 
Institute of Mathematics and Computer Science ASM
 
Disponibil în IBN: 6 decembrie 2013


Rezumat

Polling systems provide performance evaluation criteria for a variety of demand-based, multiple-access schemes in computer and communication systems [1]. For studying this systems it is necessary to find their important characteristics. One of the important characteristics of these systems is the k-busy period [2]. In [3] it is showed that analytical results for k-busy period can be viewed as the generalization of classical Kendall functional equation [4]. A matrix algorithm for solving the gene- ralization of classical Kendall functional equation is proposed. Some examples and numerical results are presented.

Cuvinte-cheie
Polling Model, Kendall Equation, Generalization of Classical Kendall Functional Equation, k-Busy Period, Matrix Algorithm