Results 21 to 30 of about 12,280 (289)
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.
Sergei Dudin, Olga Dudina
doaj +1 more source
Web-based Queue Machine Development using Raspberry and ESP8266
At a recent time, a computer-based queue machine, which is using the computer as both a client and a server, is rated to be less practical and inefficient.
Anggit Damaz Istoko, Aulia Faqih Rifa'i
doaj +1 more source
The online registration system at Semarang's Primary Health Care has been implemented in 2018, but online registration users are still small. The purpose of this study was to compare the effectiveness of online and offline registration at waiting times ...
Evina Widianawati +4 more
doaj +1 more source
Ergodicity of an SPDE associated with a many-server queue [PDF]
We consider the so-called GI/GI/N queueing network in which a stream of jobs with independent and identically distributed service times arrive according to a renewal process to a common queue served by $N$ identical servers in a First-Come-First-Serve manner.
Aghajani, Reza, Ramanan, Kavita
openaire +3 more sources
On a batch arrival queuing system equipped with a stand-by server during vacation periods or the repairs times of the main server [PDF]
We study a queuing system which is equipped with a stand-by server in addition to the main server. The stand-by server provides service to customers only during the period of absence of the main server when either the main server is on a vacation or it ...
Lukas, CA +6 more
core +1 more source
An infinite dimensional model for a many server priority queue [PDF]
6 pages.
Neal Master +2 more
openaire +2 more sources
The spectrum allocation in any auctioned wireless service primarily depends upon the necessity and the usage of licensed primary users (PUs) of a certain band of frequencies.
C. Rajesh Babu +4 more
doaj +1 more source
SPDE limits of many-server queues
A many-server queueing system is considered in which customers with independent and identically distributed service times enter service in the order of arrival. The state of the system is represented by a process that describes the total number of customers in the system, as well as a measure-valued process that keeps track of the ages of customers in ...
Kaspi, Haya, Ramanan, Kavita
openaire +4 more sources
Dynamic routing of customers with general delay costs [PDF]
We consider a network of parallel service stations each modelled as a single server queue. Each station serves its own dedicated customers as well as generic customers who are routed from a central controller.
Glazebrook, K D +7 more
core +1 more source
Fluid models of many-server queues with abandonment [PDF]
We study many-server queues with abandonment in which customers have general service and patience time distributions. The dynamics of the system are modeled using measure- valued processes, to keep track of the residual service and patience times of each customer.
openaire +4 more sources

