<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'>
<creators>
<creator>
<creatorName>Mişcoi, G.C.</creatorName>
</creator>
<creator>
<creatorName>Krieger, U.R.</creatorName>
</creator>
<creator>
<creatorName>Bejenari, D.D.</creatorName>
<affiliation>Institutul de Matematică şi Informatică al AŞM, Moldova, Republica</affiliation>
</creator>
</creators>
<titles>
<title xml:lang='en'>Matrix algorithm for Polling models with PH distribution</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2012</publicationYear>
<relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1024-7696</relatedIdentifier>
<subjects>
<subject>Polling Model</subject>
<subject>Kendall Equation</subject>
<subject>Generalization of
Classical Kendall Functional Equation</subject>
<subject>k-Busy Period</subject>
<subject>Matrix Algorithm</subject>
</subjects>
<dates>
<date dateType='Issued'>2012-04-03</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Journal article</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'>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.</description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>