Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "queueing network" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-7 z 7
    Tytuł:
    Asymptotic analysis of the closed queueing structure with time-dependent service parameters and single-type messages
    Autorzy:
    Matalytski, M.
    Rusilko, T.
    Pankov, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/122305.pdf
    Data publikacji:
    2013
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    queueing network
    differential equation
    asymptotic analysis
    Opis:
    A closed queueing structure is considered in the paper; the number of single-type messages is not constant and depends on time. The route of messages is given by an arbitrary stochastic matrix of transition probabilities. An asymptotic analysis of this structure in case of large number of service requests is conducted. The service parameters of each queueing system of this structure, as well as the probability of messages transition between systems, depend on time. A system of ordinary differential equations to calculate the average relative number of messages in each queueing system, depending on the time, was obtained.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2013, 12, 2; 73-80
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Vehicular flow simulators based on complex queuing systems
    Autorzy:
    Pasini, L.
    Feliziani, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/1955296.pdf
    Data publikacji:
    2013
    Wydawca:
    Politechnika Gdańska
    Tematy:
    traffic systems
    queueing network
    modeling and simulation
    Opis:
    The crux of this paper is to demonstrate how it is possible to model systems of vehicular trafic by means of complex queuing network models. The objects comprising the library that we define in this work all follow the approach whereby they are composed of one or more queuing networks of service systems that are traversed by customers (vehicles).
    Źródło:
    TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2013, 17, 3-4; 155--180
    1428-6394
    Pojawia się w:
    TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the law of the iterated logarithm in hybrid multiphase queueing systems
    Autorzy:
    Minkevičius, Saulius
    Powiązania:
    https://bibliotekanauki.pl/articles/1181931.pdf
    Data publikacji:
    2020
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    operations research
    model
    computer network
    queueing network
    performance evaluationi
    iterated logarithm
    Opis:
    The model of a hybrid multiphase queueing system (HMQS) has been developed to measure the performance of complex computer networks working under conditions of heavy traffic. Two probability limit theorems (laws of the iterated logarithm, LIL) are presented for a queue length of jobs in HMQS.
    Źródło:
    Operations Research and Decisions; 2020, 30, 4; 57-64
    2081-8858
    2391-6060
    Pojawia się w:
    Operations Research and Decisions
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Diffusion approximation of the network with limited number of same type customers and time dependent service parameters
    Autorzy:
    Matalytski, M.
    Kopats, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/122463.pdf
    Data publikacji:
    2016
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    queueing network
    birth and death process
    asymptotic analysis
    sieci kolejkowe
    analiza asymptotyczna
    proces losowy
    Opis:
    The article presents research of an open queueing network (QN) with the same types of customers, in which the total number of customers is limited. Service parameters are dependent on time, and the route of customers is determined by an arbitrary stochastic transition probability matrix, which is also dependent on time. Service times of customers in each line of the system is exponentially distributed. Customers are selected on the service according to FIFO discipline. It is assumed that the number of customers in one of the systems is determined by the process of birth and death. It generates and destroys customers with certain service times of rates. The network state is described by the random vector, which is a Markov random process. The purpose of the research is an asymptotic analysis of its process with a big number of customers, obtaining a system of differential equations (DE) to find the mean relative number of customers in the network systems at any time. A specific model example was calculated using the computer. The results can be used for modelling processes of customer service in the insurance companies, banks, logistics companies and other organizations.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2016, 15, 2; 77-84
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Asymptotic analysis of a closed G-network of unreliable nodes
    Autorzy:
    Rusilko, Tatiana
    Powiązania:
    https://bibliotekanauki.pl/articles/2175521.pdf
    Data publikacji:
    2022
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    G-network
    unreliable queueing systems
    positive customer
    negative customer
    birth-death process
    asymptotic analysis
    queueing network
    sieć G
    proces narodzin i śmierci
    analiza asymptotyczna
    sieci kolejkowe
    Opis:
    A closed exponential queueing G-network of unreliable multi-server nodes was studied under the asymptotic assumption of a large number of customers. The process of changing the number of functional servers in network nodes was considered as the birth-death process. The process of changing the number of customers at the nodes was considered as a continuous-state Markov process. It was proved that its probability density function satisfies the Fokker-Planck-Kolmogorov equation. The system of differential equations for the first-order and second-order moments of this process was derived. This allows us to predict the expectation, the variance and the pairwise correlation of the number of customers in the G-network nodes both in the transient and steady state.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2022, 21, 2; 91--102
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Expected volumes of requests in systems of the queueing network with a limited number of waiting places
    Autorzy:
    Zając, P.
    Matalytski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/121834.pdf
    Data publikacji:
    2017
    Wydawca:
    Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
    Tematy:
    sieci HM
    sieci kolejkowe
    system kolejkowy
    bezprzewodowy punkt dostępu
    HM-networks
    queueing network
    single-line queueing system
    queueing system
    queuing time
    limited queue
    demands total volume
    wireless access point
    volume of requests
    Opis:
    We present a method of finding the expected volume of requests in HM-network with homogeneous requests and bypass of the queueing systems of requests. The case was considered when the volume changes associated with the transitions between the states of the network are deterministic functions, depending on the state of the network and time, and the systems are single line. It is assumed that the probability of the states of the network systems, the parameters of the entrance flow of the requests and the service depend on the time.
    Źródło:
    Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2017, 22; 141-160
    2450-9302
    Pojawia się w:
    Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Investigation of G-networks with restart at a non-stationary mode and their application
    Autorzy:
    Matalytski, Mikhail
    Naumenko, Victor
    Kopats, Dmitry
    Powiązania:
    https://bibliotekanauki.pl/articles/122538.pdf
    Data publikacji:
    2019
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    queueing network
    G-network
    positive and negative customers
    non-stationary regime
    multiple type customers
    signals
    restart
    nonstationary state probabilities
    successive approximation method
    sieć kolejkowa
    sieć G
    sygnały
    metoda aproksymacji
    aproksymacja
    teoria kolejek
    pozytywny klient
    negatywny klient
    Opis:
    This article discusses the question of restarting the script, when restart is used by many users of the information network, which can be modelled as a G-network. Negative claims simulate the crash of the script and the re-sending of the request. Investigation of an open queuing network (QN) with several types of positive customers with the phase type of distribution of their service time and one type of negative customers have been carried out. Negative customers are signals whose effect is to restart one customers in a queue. A technique is proposed for finding the probability of states. It is based on the use of a modified method of successive approximations, combined with the method of a series. The successive approximations converge with time to a stationary distribution of state probabilities, the form of which is indicated in the article, and the sequence of approximations converges to the solution of the difference-differential equations (DDE) system. The uniqueness of this solution is proved. Any successive approximation is representable in the form of a convergent power series with an infinite radius of convergence, the coefficients of which satisfy recurrence relations, which is convenient for computer calculations. A model example illustrating the finding of time-dependent probabilities of network states using the proposed technique is also presented.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2019, 18, 2; 41-51
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-7 z 7

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies