| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 545 8
|
| Ultima descărcare din IBN: 2019-08-14 17:42 |
 SM ISO690:2012MIŞCOI, Gheorghe, BEJENARI, Diana. Algoritmi numerici pentru perioada de ocupare în modele exhaustive polling. In: Analele Universităţii Libere Internaţionale din Moldova (Seria Economie), 2010, nr. 10, pp. 55-64. ISSN 1857-1468. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Analele Universităţii Libere Internaţionale din Moldova (Seria Economie) | |||||||
| Numărul 10 / 2010 / ISSN 1857-1468 | |||||||
|
|||||||
| Pag. 55-64 | |||||||
|
|||||||
 Descarcă PDF |
|||||||
| Rezumat | |||||||
The queueing systems of Polling type is widely used in wireless networks with broadband centralized management (see, e.g., [1, 2]). One of the important characteristics of these systems is the k - busy period [2]. In [3] is showed that analytical results for k - busy periods can be viewed as generalization of classical Kendall functional equation. In this paper the analitical and matrix form of the classical Kendall equation were obtained, using the class of probability distributions. Numerical algorithm in C was elaborated and some examples and numerical result are presented. |
|||||||
|
Google Scholar Export
<meta name="citation_title" content="Algoritmi numerici pentru perioada de ocupare în modele exhaustive polling"> <meta name="citation_author" content="Mişcoi Gheorghe"> <meta name="citation_author" content="Bejenari Diana"> <meta name="citation_publication_date" content="2010/06/11"> <meta name="citation_journal_title" content="Analele Universităţii Libere Internaţionale din Moldova (Seria Economie)"> <meta name="citation_issue" content="10"> <meta name="citation_firstpage" content="55"> <meta name="citation_lastpage" content="64"> <meta name="citation_pdf_url" content="https://ibn.idsi.md/sites/default/files/imag_file/55_64_Algoritmi%20numerici%20pentru%20perioada%20de%20ocupare%20in%20modele%20exhaustive%20polling_0.pdf">
|
|
|
