Narzędzia help

Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
first last
cannonical link button

http://yadda.icm.edu.pl:80/baztech/element/bwmeta1.element.baztech-1493aba2-028a-4d7b-8541-55f8257865d4

Czasopismo

Journal of Applied Mathematics and Computational Mechanics

Tytuł artykułu

Application of HM-networks with inpatient claims in finding the memory capacity in information systems

Autorzy Matalytski, M.  Zajac, P. 
Treść / Zawartość
Warianty tytułu
Języki publikacji EN
Abstrakty
EN To solve the problem of determining the memory capacity of the information systems (IS), the use of the stochastic model is proposed, based on the use of НМ (Howard-Matalytski) - queueing networks with revenues. This model allows one to take into account time dependencies of the message processing from their capacities, the possibility changes of the messages capacities over time and also the possibility of leaving messages from queues in nodes of IS, without getting into them appropriate processing. The expressions for the mean (expected) values of total message capacities in the IS nodes have been obtained.
Słowa kluczowe
PL system informacyjny   sieci kolejkowe   pojemność pamięci  
EN НМ-networks   information systems   inpatient claims   capacities of claims  
Wydawca Wydawnictwo Politechniki Częstochowskiej
Czasopismo Journal of Applied Mathematics and Computational Mechanics
Rocznik 2017
Tom Vol. 16, nr 3
Strony 47--59
Opis fizyczny Bibliogr. 9 poz., rys.
Twórcy
autor Matalytski, M.
autor Zajac, P.
  • Institute of Mathematics, Czestochowa University of Technology Czestochowa, Poland, pawel_zajac@vp.pl
Bibliografia
[1] Tikhonenko O., Metody probalistyczne analizy systemov informacyjnych, Akademicka Oficyna Wydawnicza EXIT, Warszawa 2006.
[2] Matalytski М., Tikhonenko O., Koluzaeva E., Systems and queueing networks: analysis and application [In Russian: Sistemy i seti massovogo obsluzhivaniya: analiz i primeneniya]. Monograph, GrSU, Grodno 2011.
[3] Bufferbloat [Electronic resource]: https://en.wikipedia.org/wiki/Bufferbloat.
[4] Matalytski М., Statkevich S., Stochastic networks with bounded waiting time of claims and unreliable service [In Russian: Stokhasticheskiye seti s ogranichennym vremenem ozhidaniya zayavok i nenadezhnym obsluzhivaniyem], Monograph, GrSU, Grodno 2014.
[5] Matalytski M., Naumenko V., Stochastic networks with non-standard customers movement. [In Russian: Stokhasticheskiye seti s nestandartnymi peremeshcheniyami zayavok]. Monograph, GrSU, Grodno 2016.
[6] Matalytski М., Statkevich S., HM-network analysis with a limited waiting time and random incomes from transitions between states [In Russian: Analiz NM-seti s ogranichennym vremenem ozhidaniya i sluchaynymi dokhodami ot perekhodov mezhdu sostoyaniyami], Vestnik of GrSU, 2009, Ser 2, 3, 6-13.
[7] Matalytski M., Analysis and forecasting of expected incomes in Markov network with bounded waiting time for the claims, Automation and Remote Control 2015, 76(6), 1005-1017.
[8] Matalytski M., Naumenko V., Zastosowanie HM-sieci kolejkowych dla wyznaczenia objetosci pamieci systemow informacyjnych, Studia Informatica 2014, 35(3), 63-69.
[9] Zajac P., Matalytski M., Finding of expected volumes of request in systems of the queueing network with limited amount of spaces of expectation, Studia Informatica 2016, 37(4), 89-104.
Uwagi
Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę (zadania 2017).
Kolekcja BazTech
Identyfikator YADDA bwmeta1.element.baztech-1493aba2-028a-4d7b-8541-55f8257865d4
Identyfikatory
DOI 10.17512/jamcm.2017.3.05