<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-05-29T23:46:18Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/19365" metadataPrefix="marc">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/19365</identifier><datestamp>2026-02-03T12:04:45Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37959</setSpec></header><metadata><record xmlns="http://www.loc.gov/MARC21/slim" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd">
   <leader>00925njm 22002777a 4500</leader>
   <datafield ind2=" " ind1=" " tag="042">
      <subfield code="a">dc</subfield>
   </datafield>
   <datafield ind2=" " ind1=" " tag="720">
      <subfield code="a">Livinska, Hanna</subfield>
      <subfield code="e">author</subfield>
   </datafield>
   <datafield ind2=" " ind1=" " tag="260">
      <subfield code="c">2020-03-05</subfield>
   </datafield>
   <datafield ind2=" " ind1=" " tag="520">
      <subfield code="a">When one investigate mathematical models of information-computing networks, data networks, and mobile communications, one of the main problems is connected with the large dimension of descriptive processes and complexity of the phase space of the stochastic model. To overcome such problems, the approach of asymptotic merging for nodes set of multichannel stochastic networks is proposed in the work.&#xd;
For the first time the problem of asymptotic merging phase for complex stochastic systems was considered by V.S. Korolyuk. His works contain methodological aspects of this problem.&#xd;
In our work we use the approach of asymptotic merging for investigation of multichannel stochastic networks as queueing networks operating in a heavy traffic regime. Input flows of calls are Poisson processes with their rates can be dependent on time. For such networks we consider a multidimensional service process that is a stochastic process indicating the number of calls at the nodes of the network at the instant of time.&#xd;
Under heavy traffic conditions the service process of calls is studied for networks with generally distributed service times and two types of an input flow. For the service process of the merged network a limit Gaussian process is constructed. Due to the approach with merging, dimension of the limit process is reduced.</subfield>
   </datafield>
   <datafield ind1="8" ind2=" " tag="024">
      <subfield code="a">https://hdl.handle.net/10630/19365</subfield>
   </datafield>
   <datafield tag="653" ind2=" " ind1=" ">
      <subfield code="a">Redes</subfield>
   </datafield>
   <datafield ind2="0" ind1="0" tag="245">
      <subfield code="a">Asymptotic merging of nodes set for stochastic networks with nonhomogeneous input</subfield>
   </datafield>
</record>
</metadata></record></GetRecord></OAI-PMH>