Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Olga Dudina"'
Autor:
Sergei Dudin, Olga Dudina
Publikováno v:
Mathematics, Vol 11, Iss 22, p 4587 (2023)
In this paper, we consider a multi-server queue with a finite buffer. Request arrivals are defined by the Markov arrival process. Service is provided to groups of requests. The minimal and maximal group sizes are fixed. The service time of a group ha
Externí odkaz:
https://doaj.org/article/bddd0d86232c4dd0986f1c340e03b21e
Publikováno v:
IEEE Access, Vol 9, Pp 106933-106946 (2021)
A model of a cell of a communication network, divided into zones, with the dependence of the users’ service time on the zone, in which they are located, is considered. The arrival flow of users is defined by a marked Markovian process. The number o
Externí odkaz:
https://doaj.org/article/21c55161dd5741bbaff2c21ef9827d42
Publikováno v:
Mathematics, Vol 11, Iss 4, p 1040 (2023)
In this paper, a multi-server queueing system providing service to two correlated flows of requests was considered. Non-preemptive priority was granted to one flow via the preliminary delay of requests in the intermediate buffers with different rates
Externí odkaz:
https://doaj.org/article/6718f70a9f76478488b68ecf85c587f7
Publikováno v:
Mathematics, Vol 10, Iss 3, p 297 (2022)
A multi-server infinite buffer queueing system with additional servers (assistants) providing help to the main servers when they encounter problems is considered as the model of real-world systems with customers’ self-service. Such systems are wide
Externí odkaz:
https://doaj.org/article/74625be5d7b549ea8bfabccea9ef092d
Publikováno v:
Mathematics, Vol 9, Iss 17, p 2134 (2021)
A novel multi-server vacation queuing model is considered. The distinguishing feature of the model, compared to the standard queues, is the self-sufficiency of servers. A server can terminate service and go on vacation independently of the system man
Externí odkaz:
https://doaj.org/article/b5688eab7708442d811934a89baac924
Publikováno v:
Mathematics, Vol 9, Iss 11, p 1257 (2021)
A single-server non-pre-emptive priority queueing system of a finite capacity with many types of customers is analyzed. Inter-arrival times can be correlated and batch arrivals are allowed. Possible unreliability of the server, implying the loss of a
Externí odkaz:
https://doaj.org/article/08dc0eb879d94eb2a3370638a8156231
Publikováno v:
Mathematics, Vol 8, Iss 8, p 1292 (2020)
A single-server queueing system with a finite buffer, several types of impatient customers, and non-preemptive priorities is analyzed. The initial priority of a customer can increase during its waiting time in the queue. The behavior of the system is
Externí odkaz:
https://doaj.org/article/5a1b5b2f4e1a41be8ad1f95c6bf0dedf
Publikováno v:
Mathematics, Vol 8, Iss 6, p 929 (2020)
A new flexible discipline for providing priority to one of two types of customers in a single-server queue is proposed. This discipline assumes the use of additional finite storages for each type of arriving customer. During the stay in a storage, a
Externí odkaz:
https://doaj.org/article/d6e69234929e443bb4c66127a478bd9c
Publikováno v:
Mathematics, Vol 8, Iss 5, p 824 (2020)
The use of priorities allows us to improve the quality of service of inhomogeneous customers in telecommunication networks, inventory and health-care systems. An important modern direction of research is to analyze systems in which priority of a cust
Externí odkaz:
https://doaj.org/article/39cb82c32dad4d51bec79ac74502713f
Publikováno v:
Mathematics, Vol 7, Iss 9, p 825 (2019)
We consider a queueing network with a finite number of nodes and servers moving between the nodes as a model of car sharing. The arrival process of customers to various nodes is defined by a marked Markovian arrival process. The customer that arrives
Externí odkaz:
https://doaj.org/article/34cd4ca1e8d345deb347e162d6eb0177