<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06047465</id>
  <dt>j</dt>
  <an>06047465</an>
  <augroup>
    <au>Alfa, Attahiru Sule</au>
    <au>Xue, Jungong</au>
  </augroup>
  <ti>Efficient computations for the discrete $GI/G/1$ system.</ti>
  <so>INFORMS J. Comput. 19, No. 3, 480-484 (2007).</so>
  <py>2007</py>
  <pu>INFORMS, Hanover, MD</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>matrix-analytic methods</ut>
    <ut>discrete $GI/G/1$ systems</ut>
    <ut>discrete $PH/PH/1$ systems</ut>
    <ut>queue length</ut>
    <ut>waiting time</ut>
    <ut>tail probabilities</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1287/ijoc.1060.0190</li>
  </ligroup>
  <abgroup>
    <ab>Summary: We consider the discrete-time $GI/G/1$ system with discrete interarrival times and service-times distributions that have finite supports, and formulate it as a $PH/PH/1$ system. We then take advantage of the resulting special structure to develop efficient methods for computing its rate matrices and the decay rates of its queue length and waiting time.</ab>
    <rv></rv>
  </abgroup>
</item>