Stationary Effectiveness of an Information Server with a Single Buffer and Bursty Demands of Two Different Customers

In this article we study the stationary efficiency of a system consisting of a finite capacity
buffer connected to two different customers with bursty on-off demands. We assume that the
buffer is filled up at a constant rate. The dynamic of the overall system is modeled using
a semi-Markov evolution environment and we derive design formulae involving the main
parameters. It has been shown that it is possible to use the phase merging algorithm (PMA) to
reduce the semi-Markov process to an approximated Markov process. We apply the PMA to the
analysis of two different semi-Markov cases.