The MAP|GN|1|1 Queueing System with Two Special Service Disciplines
Automation and Remote Control
Queueing Systems: Theory and Applications
An extended combinatorial analysis framework for discrete-time queueing systems with general sources
IEEE/ACM Transactions on Networking (TON)
A Discrete-Time Geo/G/1 Retrial Queue with General Retrial Times
Queueing Systems: Theory and Applications
On discrete-time multiserver queues with finite buffer: GI/Geom/m/N
Computers and Operations Research
Hi-index | 0.01 |
This paper considers a queueing system Geo/G/1/∞ with inversive service order and probabilistic priority that is determined as follows. Upon arrival into the system of a new customer its length i is compared with the (remaining) length j of the customer in the device and with the probability of d(i, j), which depends only on i and j, a new arrival will occupy the server while pushing out a servicing customer to the first place in the queue, and with the supplemental probability d(i, j) = 1 - d(i, j), alternatively, a customer that was under service keeps on being served while the newly arrived one occupies the first position in the queue. The remaining queue shifts by one state. The main stationary characteristics of such system's behavior have been found.