<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">475789741</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180406123708.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170329e20000701xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1023/A:1019108526325</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1023/A:1019108526325</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Rikli</subfield>
   <subfield code="D">Nasser-Eddine</subfield>
   <subfield code="u">Computer Engineering Department, King Saud University, P.O. Box 51178, 11543, Riyadh, Saudi Arabia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Semi-Markov model for a generalized VBR video in ATM networks</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Nasser-Eddine Rikli]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">A semi-Markov model describing the performance of an ATM multiplexer with VBR video sources as inputs is presented. The considered system consists of the bit-streams generated by a collection of these sources. The streams which are first separately packetized into fixed size cells, and then, through a statistical multiplexer, join a common queue (assumed to be infinite) where they are served on a FIFO basis by a constant capacity channel. The model to be used is based on the assumption that the video sources operate in two bit-rate modes with unequal average holding times. Each video source is decomposed into an aggregate of two types of ON/OFF mini-sources. Multiplexing a number of such sources leads to a semi-Markov process, which is defined and solved using a phase process with as states the number of active mini-sources of each type. By relating an embedded Markov chain to this phase process, a solution to the resulting queueing system is presented, and the queue length distribution is derived using matrix-geometric techniques. Lastly, results are presented showing that the system performance depends not only on the ratio of the average holding times in the two modes, but also on their magnitudes.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Kluwer Academic Publishers, 2000</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Telecommunication Systems</subfield>
   <subfield code="d">Kluwer Academic Publishers</subfield>
   <subfield code="g">13/2-4(2000-07-01), 373-392</subfield>
   <subfield code="x">1018-4864</subfield>
   <subfield code="q">13:2-4&lt;373</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">13</subfield>
   <subfield code="o">11235</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1023/A:1019108526325</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1023/A:1019108526325</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Rikli</subfield>
   <subfield code="D">Nasser-Eddine</subfield>
   <subfield code="u">Computer Engineering Department, King Saud University, P.O. Box 51178, 11543, Riyadh, Saudi Arabia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Telecommunication Systems</subfield>
   <subfield code="d">Kluwer Academic Publishers</subfield>
   <subfield code="g">13/2-4(2000-07-01), 373-392</subfield>
   <subfield code="x">1018-4864</subfield>
   <subfield code="q">13:2-4&lt;373</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">13</subfield>
   <subfield code="o">11235</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
