Informacja

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

Wyszukujesz frazę "Dudin, A." wg kryterium: Autor


Wyświetlanie 1-3 z 3
Tytuł:
Optimization of the service strategy in a queueing system with energy harvesting and customers’ impatience
Autorzy:
Dudin, A.
Lee, M. H.
Dudin, S.
Powiązania:
https://bibliotekanauki.pl/articles/331226.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
energy harvesting
threshold strategy
optimization
Markovian arrival process
uzyskiwanie energii
optymalizacja
Markowski proces zgłoszeń
Opis:
A single-server queueing system with an infinite buffer is considered. The service of a customer is possible only in the presence of at least one unit of energy, and during the service the number of available units decreases by one. New units of energy arrive in the system at random instants of time if the finite buffer for maintenance of energy is not full. Customers are impatient and leave the system without service after a random amount of waiting time. Such a queueing system describes, e.g., the operation of a sensor node which harvests energy necessary for information transmission from the environment. Aiming to minimize the loss of customers due to their impatience (and maximize the throughput of the system), a new strategy of control by providing service is proposed. This strategy suggests that service temporarily stops if the number of customers or units of energy in the system becomes zero. The server is switched off (is in sleep mode) for some time. This time finishes (the server wakes up) if both the number of customers in the buffer and the number of energy units reach some fixed threshold values or when the number of energy units reaches some threshold value and there are customers in the buffer. Arrival flows of customers and energy units are assumed to be described by an independent Markovian arrival process. The service time has a phase-type distribution. The system behavior is described by a multi-dimensional Markov chain. The generator of this Markov chain is derived. The ergodicity condition is presented. Expressions for key performance measures are given. Numerical results illustrating the dependence of a customer’s loss probability on the thresholds defining the discipline of waking up the server are provided. The importance of the account of correlation in arrival processes is numerically illustrated.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 2; 367-378
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
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 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ł
    Wyświetlanie 1-3 z 3

    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