Numerical solutions of Kendall and Pollaczek-Khintchin equations for exhaustive polling systems with semi-Markov delays
Închide
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
218 9
Ultima descărcare din IBN:
2018-12-18 21:54
Căutarea după subiecte
similare conform CZU
[519.2+519.872.2]:004 (1)
Probabilitate. Statistică matematică (48)
Cercetări operaționale (OR) teorii şi metode matematice (87)
Știința și tehnologia calculatoarelor. Calculatoare. Procesarea datelor (1023)
EXPORT metadate:
Google Scholar
Crossref
CERIF
BibTeX
DataCite
Dublin Core
Computer Science Journal of Moldova
Numărul 2(71) / 2016 / ISSN 1561-4042

Numerical solutions of Kendall and Pollaczek-Khintchin equations for exhaustive polling systems with semi-Markov delays

CZU: [519.2+519.872.2]:004
Pag. 255-272

Mishkoy Gheorghe12, Bejenari Diana2, Mitev Lilia32, Ticu Ionela4
 
1 Academy of Sciences of Moldova,
2 Universitatea Liberă Internaţională din Moldova,
3 Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova,
4 Universitatea Maritimă din Constanţa
 
Disponibil în IBN: 2 septembrie 2016


Rezumat

Some analytical results for exhaustive polling systems with semi-Markov delays, such as Pollaczek-Khintchin virtual and steady state analog are presented. Numerical solutions for kbusy period, probability of states and queue length distribution are obtained. Numerical examples are presented.

Cuvinte-cheie
Polling systems with semi-Markov delays, Pollaczek-Khintchin formula, Kendall Equation, k-Busy Period, probability of states, queue length, numerical algorithms.