| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 1625 16 |
| Ultima descărcare din IBN: 2022-10-18 03:26 |
| Căutarea după subiecte similare conform CZU |
| [519.2+519.872.2]:004 (1) |
| Теория вероятностей и математическая статистика (80) |
| Исследование операций (168) |
| Информационные технологии. Вычислительная техника. Обработка данных (4156) |
 SM ISO690:2012MISHKOY, Gheorghe, BEJENARI, Diana, MITEV, Lilia, TICU, Ionela. Numerical solutions of Kendall and
Pollaczek-Khintchin equations for exhaustive
polling systems with semi-Markov delays. In: Computer Science Journal of Moldova, 2016, nr. 2(71), pp. 255-272. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 2(71) / 2016 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: [519.2+519.872.2]:004 | ||||||
| Pag. 255-272 | ||||||
|
||||||
 Descarcă PDF |
||||||
| 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. |
||||||
|
Dublin Core Export
<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'> <dc:creator>Mişcoi, G.C.</dc:creator> <dc:creator>Bejenari, D.D.</dc:creator> <dc:creator>Mitev, L.M.</dc:creator> <dc:creator>Ţicu, R.</dc:creator> <dc:date>2016-08-25</dc:date> <dc:description xml:lang='en'>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. </dc:description> <dc:source>Computer Science Journal of Moldova 71 (2) 255-272</dc:source> <dc:subject>Polling systems with semi-Markov delays</dc:subject> <dc:subject>Pollaczek-Khintchin formula</dc:subject> <dc:subject>Kendall Equation</dc:subject> <dc:subject>k-Busy Period</dc:subject> <dc:subject>probability of states</dc:subject> <dc:subject>queue length</dc:subject> <dc:subject>numerical algorithms.</dc:subject> <dc:title>Numerical solutions of Kendall and Pollaczek-Khintchin equations for exhaustive polling systems with semi-Markov delays</dc:title> <dc:type>info:eu-repo/semantics/article</dc:type> </oai_dc:dc>
|
|
|
