<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     naa a22        4500</leader>
  <controlfield tag="001">510812112</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180411083447.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">180411e20131001xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1134/S0081543813060114</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1134/S0081543813060114</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Kovalenko</subfield>
   <subfield code="D">I.</subfield>
   <subfield code="u">V.M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, pr. Akademika Glushkova 40, 03680, Kyiv, Ukraine</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">B.A. Sevastyanov's famous theorem</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[I. Kovalenko]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In 1956, at the Third All-Union Mathematical Congress, Boris Aleksandrovich Sevastyanov gave a talk on the ergodic theorem proved by him for Markov processes and on its application to queueing systems. In 1957, this result was published in the journal Teoriya Veroyatnostei i Ee Primeneniya (Theory of Probability and Its Applications). An important corollary to the ergodic theorem is a generalization of Erlang's well-known formula to a queueing system with a Poisson input flow and an arbitrary distribution of the service time. This result of Sevastyanov has served as a starting point for numerous studies on the problem, which was later called the insensitivity (invariance) problem for queueing systems with losses. There are hundreds of references to this result of Sevastyanov.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Pleiades Publishing, Ltd., 2013</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Proceedings of the Steklov Institute of Mathematics</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">282/1(2013-10-01), 124-126</subfield>
   <subfield code="x">0081-5438</subfield>
   <subfield code="q">282:1&lt;124</subfield>
   <subfield code="1">2013</subfield>
   <subfield code="2">282</subfield>
   <subfield code="o">11501</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1134/S0081543813060114</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.1134/S0081543813060114</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">Kovalenko</subfield>
   <subfield code="D">I.</subfield>
   <subfield code="u">V.M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, pr. Akademika Glushkova 40, 03680, Kyiv, Ukraine</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">Proceedings of the Steklov Institute of Mathematics</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">282/1(2013-10-01), 124-126</subfield>
   <subfield code="x">0081-5438</subfield>
   <subfield code="q">282:1&lt;124</subfield>
   <subfield code="1">2013</subfield>
   <subfield code="2">282</subfield>
   <subfield code="o">11501</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>
