<?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>Krieger, U.R.</dc:creator>
<dc:creator>Bejenari, D.D.</dc:creator>
<dc:date>2012-04-03</dc:date>
<dc:description xml:lang='en'>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.</dc:description>
<dc:source>Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica 68 (1) 70-80</dc:source>
<dc:subject>Polling Model</dc:subject>
<dc:subject>Kendall Equation</dc:subject>
<dc:subject>Generalization of
Classical Kendall Functional Equation</dc:subject>
<dc:subject>k-Busy Period</dc:subject>
<dc:subject>Matrix Algorithm</dc:subject>
<dc:title>Matrix algorithm for Polling models with PH distribution</dc:title>
<dc:type>info:eu-repo/semantics/article</dc:type>
</oai_dc:dc>