Results 1 to 10 of about 1,354 (129)
Rare-Event Simulation for Many-Server Queues [PDF]
Mathematics of Operations Research, 2014 We develop rare-event simulation methodology for the analysis of loss events in a many-server loss system under the quality-driven regime, focusing on the steady-state loss probability (i.e., fraction of lost customers over arrivals) and the behavior of the whole system leading to loss events. The analysis of these events requires working with the full
JOSÉ Blanchet, Henry Lam
exaly +3 more sources
SRPT Scheduling Discipline in Many-Server Queues with Impatient Customers [PDF]
Management Science, 2021 The shortest-remaining-processing-time (SRPT) scheduling policy has been extensively studied, for more than 50 years, in single-server queues with infinitely patient jobs. Yet, much less is known about its performance in multiserver queues. In this paper, we present the first theoretical analysis of SRPT in multiserver queues with abandonment.
Rouba Ibrahim
exaly +3 more sources
Approximations for the Queue Length Distributions of Time-Varying Many-Server Queues [PDF]
INFORMS Journal on Computing, 2017 This paper presents a novel and computationally efficient methodology for approximating the queue length (the number of customers in the system) distributions of time-varying non-Markovian many-server queues (e.g., Gt/Gt/nt queues), where the number of servers (nt) is large. Our methodology consists of two steps.
Jamol Pender, Young Myoung Ko
exaly +4 more sources
On many-server queues in heavy traffic
Annals of Applied Probability, 2010 We establish a heavy-traffic limit theorem on convergence in distribution for the number of customers in a many-server queue when the number of servers tends to infinity. No critical loading condition is assumed. Generally, the limit process does not have trajectories in the Skorohod space. We give conditions for the convergence to hold in the topology
Anatolii A Puhalskii
exaly +5 more sources
Mathematics, 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.
Alexander Dudin +3 more
doaj +1 more source
Mathematics, 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.
Sergei Dudin, Olga Dudina
doaj +1 more source
Design and implementation of high-performance and high-availability redis client
Dianzi Jishu Yingyong, 2022 Redis is an unstructured database based on memory storage. It is known for high I/O(Input/Output) performance and high response speed. It plays an important role in data buffering, message queues, key-value storage and other scenarios.
Liu Shichao, Yang Bin, Liu Weiguo
doaj +1 more source
A queueing model with server breakdowns, repairs, vacations, and backup server
Operations Research Perspectives, 2020 Queueing models wherein having a backup server during the absences (caused by vacations and breakdowns) of the main server have found many applications in practice.
Srinivas R. Chakravarthy +2 more
doaj +1 more source
Teletraffic analysis of a mobile crowdsensing system: The pedestrian-to-vehicle scenario
International Journal of Distributed Sensor Networks, 2022 Crowdsensing systems are developed in order to use the computational and communication capabilities of registered users to monitor specific variables and phenomena in an opportunistic manner.
David Miguel-Santiago +4 more
doaj +1 more source
Jurnal Sisfokom, 2020 A common problem that is often faced by almost most Barbershop is in terms of serving customer queues, for barbershops who have many customers and have many service chairs, then of course a good customer queue service management concept is needed as well.
Yurindra Yurindra +3 more
doaj +1 more source