<?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:date>2010-06-11</dc:date>
<dc:description xml:lang='en'>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.</dc:description>
<dc:source>Analele Universităţii Libere Internaţionale din Moldova (Seria Economie)  (10) 55-64</dc:source>
<dc:title>Algoritmi numerici pentru perioada de ocupare în modele exhaustive polling</dc:title>
<dc:type>info:eu-repo/semantics/article</dc:type>
</oai_dc:dc>