<mods:mods version="3.3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><mods:titleInfo><mods:title>Stationary Effectiveness of an Information Server with a Single Buffer and Bursty Demands of Two Different Customers</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given">А. А.</mods:namePart><mods:namePart type="family">Pogoruі</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart type="given">Ramón М.</mods:namePart><mods:namePart type="family">Rodríguez-Dagnіno</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart type="given">R. D.</mods:namePart><mods:namePart type="family">Rodríguez-Saіd</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:abstract>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.</mods:abstract><mods:classification authority="lcc">Mathematical Analysis</mods:classification><mods:originInfo><mods:dateIssued encoding="iso8061">2008</mods:dateIssued></mods:originInfo><mods:originInfo><mods:publisher>Taylor &amp; Francis</mods:publisher></mods:originInfo><mods:genre>Article</mods:genre></mods:mods>