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 systems" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-15 z 15
    Tytuł:
    Firefly algorithm in optimization of queueing systems
    Autorzy:
    Kwiecień, J.
    Filipowicz, B.
    Powiązania:
    https://bibliotekanauki.pl/articles/201299.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    queueing systems
    firefly algorithm
    Opis:
    Queueing theory provides methods for analysis of complex service systems in computer systems, communications, transportation networks and manufacturing. It incorporates Markovian systems with exponential service times and a Poisson arrival process. Two queueing systems with losses are also briefly characterized. The article describes firefly algorithm, which is successfully used for optimization of these queueing systems. The results of experiments performed for selected queueing systems have been also presented.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 2; 363-368
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    M/M/n/m queueing systems with non-identical servers
    Autorzy:
    Ziółkowski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/121808.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
    Tematy:
    queueing theory
    queueing systems
    teoria kolejkowania
    system kolejkowania
    Opis:
    M/M/n/m queueing systems with identical servers are well known in queueing theory and its applications. The analysis of these systems is very simple thanks to the fact that the number of customers ɳ(t) in the system at arbitrary time instant t forms a Markov chain. The main purpose of this paper is to analyse the M/M/n/m system under assumption that its servers are different, i.e. they have different parameters of service time.
    Źródło:
    Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2011, 16; 163-168
    2450-9302
    Pojawia się w:
    Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Performance evaluation of unreliable system with infinite number of servers
    Autorzy:
    Tikhonenko, O.
    Ziółkowski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/201519.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    queueing systems with non-homogeneous customers
    unreliable queueing systems
    total volume
    loss probability
    Laplace–Stieltjes transform
    Opis:
    In the paper, we investigate queueing system M/G/∞ with non-homogeneous customers. By non-homogeneity we mean that each customer is characterized by some arbitrarily distributed random volume. The arriving customers appear according to a stationary Poisson process. Service time of a customer is proportional to his its volume. The system is unreliable, which means that all its servers can break simultaneously and then the repair period goes on for random time having an arbitrary distribution. During this period, customers present in the system and arriving to it are not served. Their service continues immediately after repair period termination. Time intervals of the system in good repair mode have an exponential distribution. For such system, we determine steady-state sojourn time and total volume of customers present in it distributions. We also estimate the loss probability for the similar system with limited total volume. An analysis of some special cases and some numerical examples are attached as well.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2020, 68, 2; 289-297
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    M/G→ /n/0 Erlang queueing system with heterogeneous servers and non-homogeneous customers
    Autorzy:
    Ziółkowski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/199840.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    multi-server queueing systems
    queueing systems with non-homogeneous customers
    queueing systems with heterogeneous servers
    total volume distribution
    Laplace–Stieltjes transform
    system kolejkowania
    transformata Laplace'a-Stieltjesa
    dystrybucja
    Opis:
    In the present paper, we investigate a multi-server queueing system with heterogeneous servers, unlimited memory space, and non-homogeneous customers. The arriving customers appear according to a stationary Poisson process. Service time distribution functions may be different for every server. Customers are additionally characterized by some random volume. On every server, the service time of the customer depends on their volume. The number of customers distribution function is obtained in the classical model of the system. In the model with non-homogeneous customers, the stationary total volume distribution function is determined in the term of Laplace–Stieltjes transform. The stationary first and second moments of a total customers volume are calculated. An analysis of some special cases of the model and some numerical examples are also included.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 1; 59-66
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Graphical application for the construction of a simulator of urban vehicular traffic flows
    Autorzy:
    Pasini, L.
    Feliziani, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/1955303.pdf
    Data publikacji:
    2013
    Wydawca:
    Politechnika Gdańska
    Tematy:
    discrete event simulators
    vehicular flows
    complex queueing systems
    Opis:
    One of the most fundamental problems encountered during the construction of a simulator of urban vehicular traffic flows concerns the method of gathering the data describing the real system. In this paper, we present a graphical application developed for AutoCAD. This application allows to process the images of a vehicular traffic system in AutoCAD. During the graphical processing performed by means of our application, a file describing the system is generated. This file is subsequently read by a procedure which generates the simulator of the system. The images of the traffic system can be acquired by means of several applications available on the Internet, such as Google Maps, Google Earth, Bing, etc. Performing image processing in the context of AutoCAD allows to consistently handle distance measurements in the system, and, in general, to address the problems related to the scale ratios of an image.
    Źródło:
    TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2010, 14, 4; 405-430
    1428-6394
    Pojawia się w:
    TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    M/M/n/(m,V) queueing systems with a rejection mechanism based on AQM
    Autorzy:
    Ziółkowski, M.
    Małek, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/122605.pdf
    Data publikacji:
    2013
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    Markovian process
    queueing systems with non-homogeneous customers
    active queue management introduction
    Opis:
    M/M/n/(m,V) queueing systems with service time independent of customer volume are well known models used in computer science. In real computer systems (computer networks etc.) we often deal with the overload problem. In computer networks we solve the problem using AQM techniques, which are connected with introducing some accepting function that lets us reject in random way some part of the arriving customers. It causes reduction of each customer's mean waiting time and let us avoid jams in consequence. Unfortunately, in this way the loss probability increases. In this paper we investigate the analogous model based on some generalization of M/M/n/(m,V) queueing system. We obtain formulas for a stationary number of customers distribution function and loss probability and we do some computations in special cases.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2013, 12, 1; 121-130
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Comparison of firefly and cockroach algorithms in selected discrete and combinatorial problems
    Autorzy:
    Kwiecień, J.
    Filipowicz, B.
    Powiązania:
    https://bibliotekanauki.pl/articles/200148.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    queueing systems
    flow shop scheduling
    firefly algorithm
    cockroach algorithm
    systemy kolejkowe
    planowanie przepływów
    algorytm świetlika
    algorytm karaluch
    Opis:
    In recent years, newer algorithms inspired by nature have been created and used to solve various problems. Therefore, in the paper we present the application of firefly and cockroach algorithms to optimize two queueing systems and permutation flow shop problems with the objective of minimizing the makespan. The article briefly describes these algorithms to solve selected problems and their results. Because these algorithms were originally developed for continuous optimization problems, we introduce a new formula to transform the position of ith individual to solve the discrete problems.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 4; 797-804
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    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ł:
    On global maxima in multiphase queues
    Autorzy:
    Minkevicius, S.
    Steisunas, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/970104.pdf
    Data publikacji:
    2005
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    system kolejek
    kolejka wielofazowa
    queueing systems
    multiphase queue
    heavy traffic
    global maxima
    total waiting time of a customer
    waiting time of a customer
    law of the iterated logarithm
    Opis:
    The target of this research in the queueing theory is to prove the law of the iterated logarithm (LIL) under the conditions of heavy traffic in multiphase queueing systems. In this paper, the LIL for global maxima is proved in the phases of a queueing system studied for an important probability characteristic of the system (total waiting time of a customer and waiting time of a customer).
    Źródło:
    Control and Cybernetics; 2005, 34, 2; 575-588
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Multi–server loss queueing system with random volume customers, non–identical servers and a limited sectorized memory buffer
    Autorzy:
    Ziółkowski, Marcin
    Powiązania:
    https://bibliotekanauki.pl/articles/27311432.pdf
    Data publikacji:
    2023
    Wydawca:
    Polska Akademia Nauk. Czasopisma i Monografie PAN
    Tematy:
    multi–server queueing system with heterogeneous servers
    queueing systems with random volume customers
    sectorized memory buffer
    loss probability
    Stieltjes convolution
    wieloserwerowy system kolejkowy z serwerami heterogenicznymi
    prawdopodobieństwo straty
    splot Stieltjesa
    bufor pamięci sektorowany
    system kolejkowy z losowymi klientami
    Opis:
    In the present paper, the model of multi–server queueing system with random volume customers, non–identical (heterogeneous) servers and a sectorized memory buffer has been investigated. In such system, the arriving customers deliver some portions of information of a different type which means that they are additionally characterized by some random volume vector. This multidimensional information is stored in some specific sectors of a limited memory buffer until customer ends his service. In analyzed model, the arrival flow is assumed to be Poissonian, customers’ service times are independent of their volume vectors and exponentially distributed but the service parameters may be different for every server. Obtained results include general formulae for the steady–state number of customers distribution and loss probability. Special cases analysis and some numerical computations are attached as well.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2023, 71, 5; art. no. e146764
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Single–server queueing system with limited queue, random volume customers and unlimited sectorized memory buffer
    Autorzy:
    Ziółkowski, Marcin
    Tikhonenko, Oleg
    Powiązania:
    https://bibliotekanauki.pl/articles/2173725.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    single-server queueing system
    queueing systems with random volume customers
    sectorized memory buffer
    total volume vector
    Laplace-Stieltjes transform
    system kolejkowy z jednym serwerem
    system kolejkowy z losowymi klientami
    bufor pamięci sektorowany
    wektor objętości całkowity
    transformata Laplace'a-Stieltjesa
    Opis:
    In the present paper, we analyze the model of a single–server queueing system with limited number of waiting positions, random volume customers and unlimited sectorized memory buffer. In such a system, the arriving customer is additionally characterized by a non– negative random volume vector whose indications usually represent the portions of unchanged information of a different type that are located in sectors of unlimited memory space dedicated for them during customer presence in the system. When the server ends the service of a customer, information immediately leaves the buffer, releasing resources of the proper sectors. We assume that in the investigated model, the service time of a customer is dependent on his volume vector characteristics. For such defined model, we obtain a general formula for steady–state joint distribution function of the total volume vector in terms of Laplace-Stieltjes transforms. We also present practical results for some special cases of the model together with formulae for steady–state initial moments of the analyzed random vector, in cases where the memory buffer is composed of at most two sectors. Some numerical computations illustrating obtained theoretical results are attached as well.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 6; art. no. e143647
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Formulas for average transition times between states of the Markov birth-death process
    Autorzy:
    Zhernovyi, Yuriy
    Kopytko, Bohdan
    Powiązania:
    https://bibliotekanauki.pl/articles/2175497.pdf
    Data publikacji:
    2021
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    birth-death process
    Markov models
    mean transition time
    mean time spent in the group of states
    queueing systems
    reliability model
    proces narodzin i śmierci
    modele Markova
    średni czas przejścia
    średni czas spędzony w grupie stanów
    systemy kolejkowe
    model niezawodności
    Opis:
    In this paper, we consider Markov birth-death processes with constant intensities of transitions between neighboring states that have an ergodic property. Using the exponential distributions properties, we obtain formulas for the mean time of transition from the state i to the state j and transitions back, from the state j to the state i. We found expressions for the mean time spent outside the given state i, the mean time spent in the group of states (0,...,i-1) to the left from state i, and the mean time spent in the group of states (i+1,i+2,...) to the right. We derive the formulas for some special cases of the Markov birth-death processes, namely, for the Erlang loss system, the queueing systems with finite and with infinite waiting room and the reliability model for a recoverable system.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2021, 20, 4; 99--110
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Performance Modeling of Database Systems: a Survey
    Autorzy:
    Krajewska, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/309263.pdf
    Data publikacji:
    2018
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    database systems
    NoSQL data stores
    performance evaluation
    queueing networks
    queueing Petri nets
    Opis:
    This paper presents a systematic survey of the existing database system performance evaluation models based on the queueing theory. The continuous evolution of the methodologies developed is classified according to the mathematical modeling language used. This survey covers formal models – from queueing systems and queueing networks to queueing Petri nets. Some fundamentals of the queueing system theory are presented and queueing system models are classified according to service time distribution. The paper introduces queueing networks and considers several classification criteria applicable to such models. This survey distinguishes methodologies, which evaluate database performance at the integrated system level. Finally, queueing Petri nets are introduced, which combine modeling power of queueing networks and Petri nets. Two performance models within this formalism are investigated. We find that an insufficient amount of research effort is directed into the area of NoSQL data stores. Vast majority of models developed focus on traditional relational models. These models should be adapted to evaluate performance of non-relational data stores.
    Źródło:
    Journal of Telecommunications and Information Technology; 2018, 4; 37-45
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    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ł:
    Zastosowanie teorii masowej obsługi do modelowania systemów transportowych
    Autorzy:
    Kisielewski, P.
    Sobota, Ł.
    Powiązania:
    https://bibliotekanauki.pl/articles/312316.pdf
    Data publikacji:
    2016
    Wydawca:
    Instytut Naukowo-Wydawniczy "SPATIUM"
    Tematy:
    system masowej obsługi
    systemy transportowe
    stacje paliw
    myjnie samochodowe
    sieci kolejkowe
    queueing system
    transport systems
    filling station
    car washes
    Opis:
    W artykule przedstawiono zastosowanie teorii masowej obsługi do analizy i modelowania wybranych systemów transportowych.
    Źródło:
    Autobusy : technika, eksploatacja, systemy transportowe; 2016, 17, 6; 600-604
    1509-5878
    2450-7725
    Pojawia się w:
    Autobusy : technika, eksploatacja, systemy transportowe
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-15 z 15

      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