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ę "negative customers" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-8 z 8
    Tytuł:
    Investigation of G-network with bypasses of queueing systems by positive customers at a non-stationary regime
    Autorzy:
    Naumenko, Victor
    Kopats, Dmitry
    Matalytski, Mikhail
    Pankov, Andrey
    Powiązania:
    https://bibliotekanauki.pl/articles/1839756.pdf
    Data publikacji:
    2020
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    queuing network
    non-stationary regime
    negative customers
    bypass
    sieć kolejkowa
    negatywny klient
    pozytywny klient
    Opis:
    An open queuing network (QN) with single-line queuing systems (QS) is considered. QS are characterized by the presence of bypasses and the possibility of coming of negative customers. The network receives two independent elementary streams. The first stream is formed from the ordinary (positive) customers, while the second is composed of negative customers. Arriving of each negative customer to the system destroys exactly one positive customer in the queue, if those are contained. Negative customers do not require maintenance as the service of positive customers in the network systems is carried out in accordance with the FIFO discipline. Positive customers with a probability depending on the state of the node when they are sent to it are added to the queue, and with an additional probability, they immediately bypass it and behave in the future as served. The service in the systems is exponential, the routing of positive customers in the network is Markov, taking into account the possibility of turning the customer into a negative one after sending it to another system.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2020, 19, 3; 85-97
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Analysis of the queueing network with a random waiting time of negative customers at a non-stationary regime
    Autorzy:
    Naumenko, V.
    Matalytski, M.
    Kopats, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/122923.pdf
    Data publikacji:
    2016
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    G-network
    positive customers
    negative customers
    random waiting time
    heavy-traffic regime
    state probabilities
    mean characteristics
    non-stationary regime
    sieci kolejkowe
    sieć G
    pozytywny klient
    negatywny klient
    czas oczekiwania
    równania różniczkowe
    Opis:
    In the article a queueing network (QN) with positive customers and a random waiting time of negative customers has been investigated. Negative customers destroy positive customers on the expiration of a random time. Queueing systems (QS) operate under a heavy-traffic regime. The system of difference-differential equations (DDE) for state probabilities of such a network was obtained. The technique of solving this system and finding mean characteristics of the network, which is based on the use of multivariate generating functions was proposed.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2016, 15, 3; 111-122
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    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ł
    Tytuł:
    About one method of finding expected incomes in HM-queueing network with positive customers and signals
    Autorzy:
    Matalytski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/122974.pdf
    Data publikacji:
    2016
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    HM-queueing network
    positive and negative customers
    signals
    expected incomes
    ransient regime
    kolejkownie sieci
    systemy kolejkowe
    pozytywny klient
    negatywny klient
    teoria kolejek
    Opis:
    In the paper an open Markov HM(Howard-Matalytski)-Queueing Network (QN) with incomes, positive customers and signals (G(Gelenbe)-QN with signals) is investigated. The case is researched, when incomes from the transitions between the states of the network are random variables (RV) with given mean values. In the main part of the paper a description is given of G-network with signals and incomes, all kinds of transition probabilities and incomes from the transitions between the states of the network. The method of finding expected incomes of the researched network was proposed, which is based on using of found approximate and exact expressions for the mean values of random incomes. The variances of incomes of queueing systems (QS) was also found. A calculation example, which illustrates the differences of expected incomes of HM-networks with negative customers and QN without them and also with signals, has been given. The practical significance of these results consist of that they can be used at forecasting incomes in computer systems and networks (CSN) taking into account virus penetration into it and also at load control in such networks.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2016, 15, 1; 87-98
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Analysis of the queueing network with a random bounded waiting time of positive and negative customers at a non-stationary regime
    Autorzy:
    Matalytski, M.
    Naumenko, V.
    Powiązania:
    https://bibliotekanauki.pl/articles/122455.pdf
    Data publikacji:
    2017
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    G-network
    positive and negative customers
    random bounded waiting time of customers
    non-stationary regime
    generation function
    non-stationary state probabilities
    expected revenues
    sieć G
    pozytywny klient
    negatywny klient
    teoria kolejek
    czas oczekiwania
    Opis:
    In the first part of the article, an investigation of an open Markov queueing network with positive and negative customers (G-networks) has been carried out. The network receives two exponential arrivals of positive and negative customers. Negative customers do not receive service. The waiting time of customers of both types in each system is bounded by a random variable having an exponential distribution with different parameters. When the waiting time of a negative customer in the queue is over it reduces the number of positive customers per unit if the system has positive customers. The Kolmogorov system of difference-differential equations for non-stationary state probabilities has been derived. The method for finding state probabilities of an investigated network, based on the use of apparatus of multidimensional generating functions has been proposed. Expressions for finding the mean number of positive and negative customers in the network systems have also been found. In the second part the same network has been investigated, but with revenues. The case when revenues from the network transitions between states are random variables with given mean values has been considered. A method for finding expected revenues of the network systems has been proposed. Obtained results may be used for modeling of computer viruses in information systems and networks and also for forecasting of costs, considering the viruses penetration.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2017, 16, 1; 97-108
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Finding the expected revenues in Markov networks with positive and negative customers at a stationary regime
    Autorzy:
    Matalytski, M.
    Kopats, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/122624.pdf
    Data publikacji:
    2018
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    G-network
    positive and negative customers
    signals
    expected revenues
    stationary regime
    sieć G
    pozytywny klient
    negatywny klient
    system kolejkowy
    Opis:
    Finding the expected revenues in the queueing systems (QS) of open Markov G-networks of two types, with positive and negative customers and with positive customers and signals, has been described in the paper. A negative customer arriving to the system destroys one positive customer if at least one is available in the system, thus reducing the number of positive customers in the system by one. The signal, coming into an empty system (where there are no positive customers), does not have any impact on the network and immediately disappears from it. Otherwise, if the system is not empty, when it receives a signal, the following events can occur: the incoming signal instantly moves the positive customer from one QS into another with a certain probability, or with the other probability, the signal is triggered as a negative customer.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2018, 17, 1; 49-60
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Finding the probabilistically-temporal characteristics of Markov G-network with batch removal of positive customers
    Autorzy:
    Matalytski, M.
    Naumenko, V.
    Kopats, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/122998.pdf
    Data publikacji:
    2016
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    G-network
    positive and negative customers
    customers batch removal
    nonstationary regime
    generation function
    state probabilities
    teoria kolejek
    systemy kolejkowe
    pozytywny klient
    Opis:
    The investigation of a Markov queueing network with positive and negative customers and positive customers batch removal has been carried out in the article. The purpose of the research is analysis of such a network at the non-stationary regime, finding the time-dependent state probabilities and mean number of customers. In the first part of this article, a description of the G-network operation is provided with one-line queueing systems. When a negative customer arrives to the system, the count of positive customers is reduced by a random value, which is set by some probability distribution. Then for the non-stationary state probabilities a Kolmogorov system was derived of differencedifferential equations. A technique for finding the state probabilities and the mean number of customers of the investigated network, based on the use of an apparatus of multidimensional generating functions has been proposed. The theorem about the expression for the generating function has been given. A model example has been calculated.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2016, 15, 4; 125-136
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A discrete-time system with service control and repairs
    Autorzy:
    Atencia, I.
    Powiązania:
    https://bibliotekanauki.pl/articles/331340.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    discrete time queue
    unreliable server
    negative customers
    busy period
    sojourn times
    continuous time counterpart
    serwer niepewny
    odbiorca ujemny
    system czasu dyskretnego
    Opis:
    This paper discusses a discrete-time queueing system with starting failures in which an arriving customer follows three different strategies. Two of them correspond to the LCFS (Last Come First Served) discipline, in which displacements or expulsions of customers occur. The third strategy acts as a signal, that is, it becomes a negative customer. Also examined is the possibility of failures at each service commencement epoch. We carry out a thorough study of the model, deriving analytical results for the stationary distribution. We obtain the generating functions of the number of customers in the queue and in the system. The generating functions of the busy period as well as the sojourn times of a customer at the server, in the queue and in the system, are also provided. We present the main performance measures of the model. The versatility of this model allows us to mention several special cases of interest. Finally, we prove the convergence to the continuous-time counterpart and give some numerical results that show the behavior of some performance measures with respect to the most significant parameters of the system.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2014, 24, 3; 471-484
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-8 z 8

      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