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ę "system kolejkowy" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 18
Tytuł:
Queueing system M/M/n/(m, V ) with non-identical servers
Autorzy:
Małek, J.
Ziółkowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/121812.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
Tematy:
queueing system
loss probability
system kolejkowy
prawdopodobieństwo straty
Opis:
We investigate multi-server queueing systems with Poisson arrivals, non-identical servers and customers of random volume, under assumption that customer’s service time having an exponential distribution doesn’t depend on his volume, but service time parameters can be different for different servers. We also assume that the total volume of customers present in the system at arbitrary time instant is bounded by some constant value V > 0. For such systems the stationary customers number distribution and loss probability are determined.
Źródło:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2013, 18; 29-39
2450-9302
Pojawia się w:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Investigation into the bimodal transportation process by modelling rail module states
Autorzy:
Lavrukhin, O.
Zapara, V.
Zapara, Y.
Shapatina, O.
Bogomazova, G.
Powiązania:
https://bibliotekanauki.pl/articles/375391.pdf
Data publikacji:
2017
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
rail module
bimodal transportation
queueing system
fractal arrivals
moduł kolejowy
transport bimodalny
system kolejkowy
Opis:
The bimodal transportation process, which takes into account the modelling of rail module states, has been studied. The article demonstrates marked graphs of rail module states with and without running gear change in operation. It has been established which states have the greatest impact on the probability of a steady mode. The work has considered fractality of arrivals and its range in the queueing system with priorities.
Źródło:
Transport Problems; 2017, 12, 2; 99-112
1896-0596
2300-861X
Pojawia się w:
Transport Problems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of an M|G|1|R queue with batch arrivals and two hysteretic overload control policies
Autorzy:
Gaidamaka, Y.
Pechinkin, A.
Razumchik, R.
Samouylov, K.
Sopin, E.
Powiązania:
https://bibliotekanauki.pl/articles/330114.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
queueing system
batch arrival
general service time
overload
hysteretic load control
system kolejkowy
czas obsługi
przeciążenie
Opis:
Hysteretic control of arrivals is one of the most easy-to-implement and effective solutions of overload problems occurring in SIP-servers. A mathematical model of an SIP server based on the queueing system [...] with batch arrivals and two hysteretic loops is being analyzed. This paper proposes two analytical methods for studying performance characteristics related to the number of customers in the system. Two control policies defined by instants when it is decided to change the system’s mode are considered. The expression for an important performance characteristic of each policy (the mean time between changes in the system mode) is presented. Numerical examples that allow comparison of the efficiency of both policies are given.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 3; 519-534
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
From exhaustive vacation queues to preemptive priority queues with general interarrival times
Autorzy:
Fiems, D.
De Vuyst, S.
Powiązania:
https://bibliotekanauki.pl/articles/330948.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
queueing system
preemptive priority
server interruption
server breakdown
exhaustive vacations
system kolejkowy
zawieszenie serwera
awaria serwera
Opis:
We consider the discrete-time G/GI/1 queueing system with multiple exhaustive vacations. By a transform approach, we obtain an expression for the probability generating function of the waiting time of customers in such a system. We then show that the results can be used to assess the performance of G/GI/1 queueing systems with server breakdowns as well as that of the low-priority queue of a preemptive MX+G/GI/1 priority queueing system. By calculating service completion times of low-priority customers, various preemptive breakdown/priority disciplines can be studied, including preemptive resume and preemptive repeat, as well as their combinations. We illustrate our approach with some numerical examples.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2018, 28, 4; 695-704
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multiline queueing system with random time limitations and limited buffer space
Autorzy:
Tikhonenko, O.
Zając, P.
Powiązania:
https://bibliotekanauki.pl/articles/122703.pdf
Data publikacji:
2018
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
total demands volume
system buffer capacity
loss probability
Stieltjes convolution
system kolejkowy
splot Stieltjesa
pojemność bufora
Opis:
In the paper, we investigate multi-server queueing systems with demands of random space requirements (volumes), in which buffer space is limited by constant value and queueing ore (and) service time are limited by exponentially distributed random variables. For such systems, stationary demands number distribution and loss probability are determined. Some numerical results are attached as well.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2018, 17, 4; 99-106
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of an MAP/PH/1 queue with flexible group service
Autorzy:
Brugno, A.
D’Apice, C.
Dudin, A.
Manzo, R.
Powiązania:
https://bibliotekanauki.pl/articles/330419.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
queueing system
batch service
multirate service
stationary distribution
optimization
system kolejkowy
usługa wsadowa
usługa wielotaryfowa
rozkład stacjonarny
Opis:
A novel customer batch service discipline for a single server queue is introduced and analyzed. Service to customers is offered in batches of a certain size. If the number of customers in the system at the service completion moment is less than this size, the server does not start the next service until the number of customers in the system reaches this size or a random limitation of the idle time of the server expires, whichever occurs first. Customers arrive according to a Markovian arrival process. An individual customer’s service time has a phase-type distribution. The service time of a batch is defined as the maximum of the individual service times of the customers which form the batch. The dynamics of such a system are described by a multi-dimensional Markov chain. An ergodicity condition for this Markov chain is derived, a stationary probability distribution of the states is computed, and formulas for the main performance measures of the system are provided. The Laplace–Stieltjes transform of the waiting time is obtained. Results are numerically illustrated.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 1; 119-131
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Calculating steady-state probabilities of queueing systems using hyperexponential approximation
Autorzy:
Zhernovyi, Yuriy
Kopytko, Bohdan
Powiązania:
https://bibliotekanauki.pl/articles/122829.pdf
Data publikacji:
2019
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
non-Markovian queueing system
hyperexponential approximation
complex and paradoxical parameters of distribution
system kolejkowy
aproksymacja
rozkład hiperesponencjalny
Opis:
This article proposes an analysis of the results of the application of hyperexponential approximations with parameters of the paradoxical and complex type for calculating the steady-state probabilities of the G/G/n/m queueing systems with the number of channels n = 1, 2 and 3. The steady-state probabilities are solutions of a system of linear algebraic equations obtained by the method of fictitious phases. Approximation of arbitrary distributions is carried out using the method of moments. We verified the obtained numerical results using potential method and simulation models, constructed by means of GPSS World.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2019, 18, 2; 111-122
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
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ł:
Analiza porównawcza protokołów przesyłania wiadomościasynchronicznych w systemach kolejkowych
Comparative analysis of transfer protocols asynchronous messages on systems queuing
Autorzy:
Derlatka, Grzegorz
Kopniak, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/24083634.pdf
Data publikacji:
2023
Wydawca:
Politechnika Lubelska. Instytut Informatyki
Tematy:
message broker
asynchronous communication
amqp protocol
mqtt protocol
system kolejkowy
broker komunikatów
komunikacja asynchroniczna
protokół AMQP
protokół MQTT
Opis:
W tym artykule została przedstawiona analiza wydajności dwóch protokołów obsługiwanych przez systemy kolejkowe, tj. protokołu MQTT (ang. MQ Telemetry Transport) oraz AMQP (ang. Advanced Message Queuing Protocol). Analiza ta została przeprowadzona z użyciem dwóch brokerów wiadomości - ActiveMQ oraz RabbitMQ. Analizie został poddany czas przesłania wiadomości wyznaczony na podstawie czasu wysłania i odebrania komunikatu dla obu protokołów w obu przytoczonych systemach kolejkowych. Testy zostały przeprowadzone przy pomocy własnych aplikacji napisanych w języku Java oraz szkielecie aplikacji Spring.
This article presents an analysis of the performance of two protocols supported by queuing systems, i.e. MQTT and AMQP. This analysis was performed using two message brokers - ActiveMQ and RabbitMQ. The time of sending the message was analyzed, determined on the basis of the time of sending and receiving the message for both protocols in both of the above-mentioned queuing systems. The tests were carried out using proprietary applications written in Java and the Spring application framework.
Źródło:
Journal of Computer Sciences Institute; 2023, 26; 29--32
2544-0764
Pojawia się w:
Journal of Computer Sciences Institute
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of an MMAP/PH1, PH2/N/∞ queueing system operating in a random environment
Autorzy:
Kim, C.
Dudin, A.
Dudin, S.
Dudina, O.
Powiązania:
https://bibliotekanauki.pl/articles/330607.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
random environment
marked Markovian arrival process
phase type distribution
Laplace–Stieltjes transform
rozkład fazowy
transformata Laplace'a-Stieltjesa
system operacyjny
system kolejkowy
Opis:
A multi-server queueing system with two types of customers and an infinite buffer operating in a random environment as a model of a contact center is investigated. The arrival flow of customers is described by a marked Markovian arrival process. Type 1 customers have a non-preemptive priority over type 2 customers and can leave the buffer due to a lack of service. The service times of different type customers have a phase-type distribution with different parameters. To facilitate the investigation of the system we use a generalized phase-type service time distribution. The criterion of ergodicity for a multi-dimensional Markov chain describing the behavior of the system and the algorithm for computation of its steady-state distribution are outlined. Some key performance measures are calculated. The Laplace–Stieltjes transforms of the sojourn and waiting time distributions of priority and non-priority customers are derived. A numerical example illustrating the importance of taking into account the correlation in the arrival process is presented.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 3; 485-501
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of AQM queues with queue size based packet dropping
Autorzy:
Chydziński, A.
Chróst, Ł.
Powiązania:
https://bibliotekanauki.pl/articles/907529.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
system kolejkowy
porzucanie pakietu
wielkość rozproszenia
aktywne zarządzanie kolejką
single-server queue
packet dropping
queue size distribution
active queue management
Opis:
Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size distribution, loss ratio and throughput. The analytical results are illustrated via numerical examples that include some commonly used blocking probabilities (dropping functions).
Źródło:
International Journal of Applied Mathematics and Computer Science; 2011, 21, 3; 567-577
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
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ł:
A queueing system with heterogeneous impatient customers and consumable additional items
Autorzy:
Baek, J.
Dudina, O.
Kim, C.
Powiązania:
https://bibliotekanauki.pl/articles/907646.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
marked Markovian arrival process
consumable additional items
phase type distribution
impatient customer
Markowski proces zgłoszeń
system kolejkowy
rozkład fazowy
klient niecierpliwy
Opis:
A single-server queueing system with a marked Markovian arrival process of heterogeneous customers is considered. Type-1 customers have limited preemptive priority over type-2 customers. There is an infinite buffer for type-2 customers and no buffer for type-1 customers. There is also a finite buffer (stock) for consumable additional items (semi-products, half-stocks, etc.) which arrive according to the Markovian arrival process. Service of a customer requires a fixed number of consumable additional items depending on the type of the customer. The service time has a phase-type distribution depending on the type of the customer. Customers in the buffer are impatient and may leave the system without service after an exponentially distributed amount of waiting time. Aiming to minimize the loss probability of type-1 customers and maximize throughput of the system, a threshold strategy of admission to service of type-2 customers is offered. Service of type-2 customer can start only if the server is idle and the number of consumable additional items in the stock exceeds the fixed threshold. Stationary distributions of the system states and the waiting time are computed. In the numerical example, we show some interesting effects and illustrate a possibility of application of the presented results for solution of optimization problems.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 2; 367-384
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A finite-buffer queue with a single vacation policy: An analytical study with evolutionary positioning
Autorzy:
Woźniak, M.
Kempa, W. M.
Gabryel, M.
Nowicki, R. K.
Powiązania:
https://bibliotekanauki.pl/articles/330346.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
finite buffer queue
evolutionary strategy
object positioning
queueing system
busy period
idle time
single vacation
strategia ewolucyjna
pozycjonowanie obiektu
system kolejkowy
czas bezczynności
Opis:
In this paper, application of an evolutionary strategy to positioning a GI/M/1/N-type finite-buffer queueing system with exhaustive service and a single vacation policy is presented. The examined object is modeled by a conditional joint transform of the first busy period, the first idle time and the number of packets completely served during the first busy period. A mathematical model is defined recursively by means of input distributions. In the paper, an analytical study and numerical experiments are presented. A cost optimization problem is solved using an evolutionary strategy for a class of queueing systems described by exponential and Erlang distributions.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 4; 887-900
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 18

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