<oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
        <dc:relation>http://eprints.zu.edu.ua/13296/</dc:relation>
        <dc:title>Stationary Effectiveness of an Information Server with a Single Buffer and Bursty Demands of Two Different Customers</dc:title>
        <dc:creator>Pogoruі, А. А.</dc:creator>
        <dc:creator>Rodríguez-Dagnіno, Ramón М.</dc:creator>
        <dc:creator>Rodríguez-Saіd, R. D.</dc:creator>
        <dc:subject>Mathematical Analysis</dc:subject>
        <dc:description>In this article we study the stationary efficiency of a system consisting of a finite capacity&#13;
buffer connected to two different customers with bursty on-off demands. We assume that the&#13;
buffer is filled up at a constant rate. The dynamic of the overall system is modeled using&#13;
a semi-Markov evolution environment and we derive design formulae involving the main&#13;
parameters. It has been shown that it is possible to use the phase merging algorithm (PMA) to&#13;
reduce the semi-Markov process to an approximated Markov process. We apply the PMA to the&#13;
analysis of two different semi-Markov cases.</dc:description>
        <dc:publisher>Taylor &amp; Francis</dc:publisher>
        <dc:date>2008</dc:date>
        <dc:type>Article</dc:type>
        <dc:type>PeerReviewed</dc:type>
        <dc:format>text</dc:format>
        <dc:language>uk</dc:language>
        <dc:identifier>http://eprints.zu.edu.ua/13296/1/Stochastic_Models.pdf</dc:identifier>
        <dc:identifier>  Pogoruі, А. А. and Rodríguez-Dagnіno, Ramón М. and Rodríguez-Saіd, R. D.  (2008) Stationary Effectiveness of an Information Server with a Single Buffer and Bursty Demands of Two Different Customers.  Stochastic Models, 24.  pp. 246-269.      </dc:identifier>
        <dc:language>english</dc:language></oai_dc:dc>