Results 11 to 20 of about 6,164 (256)
Fluid models of many-server queues with abandonment [PDF]
Queueing Systems, 2012 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.
Zhang, Jiheng
openaire +6 more sources
Heavy-traffic limits for many-server queues with service interruptions [PDF]
Queueing Systems, 2009 We establish many-server heavy-traffic limits for G/M/n + M queueing models, allowing cus- tomer abandonment (the +M), subject to exogenous regenerative service interruptions. With unscaled service interruption times, we obtain a FWLLN for the queue-length process, where the limit is an ordinary differential equation in a two-state random environment ...
Pang, Guodong, Whitt, Ward
openaire +6 more sources
Many-server queues with customer abandonment: Numerical analysis of their diffusion model [PDF]
Stochastic Systems, 2013 We use a multidimensional diffusion process to approximate the dynamics of aqueue served by many parallel servers. Waiting customers in this queue may abandonthe system without service.
Shuangchi He, Jim Dai
doaj +2 more sources
Research and Exploit of Resource Sharing Strategy at IHEP [PDF]
EPJ Web of Conferences, 2019 At IHEP (Institute of High Energy Physics, Chinese Academy of Sciences), computing resources are contributed by different experiments including BES, JUNO, DYW, HXMT, etc.
JIANG Xiaowei +5 more
doaj +1 more source
SIMULATION MODEL FOR DESIGN SUPPORT OF INFOCOMM REDUNDANT SYSTEMS [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2016 Subject of Research. The paper deals with the effectiveness of multipath transfer of request copies through the network and their redundant service without the use of laborious analytical modeling.
V. A. Bogatyrev +5 more
doaj +1 more source
Ergodicity of an SPDE associated with a many-server queue [PDF]
The Annals of Applied Probability, 2019 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
Heavy-traffic limit for the initial content process
Stochastic Systems, 2017 To understand the performance of a queueing system, it can be useful to focus on the evolution of the content that is initially in service at some time. That necessarily will be the case in service systems that provide service during normal working hours
A. Korhan Aras, Yunan Liu, Ward Whitt
doaj +1 more source
Queuing System with Two Types of Customers and Dynamic Change of a Priority
Mathematics, 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 customer
Valentina Klimenok +3 more
doaj +1 more source
An infinite dimensional model for a many server priority queue [PDF]
2017 51st Annual Conference on Information Sciences and Systems (CISS), 2017 6 pages.
Neal Master +2 more
openaire +2 more sources
Setting staffing requirements for time-dependent queueing networks: the case of accident and emergency departments [PDF]
, 2012 An incentive scheme aimed at reducing patients’ waiting times in accident and emergency departments was introduced by the UK government in 2000. It requires 98% of patients to be discharged, transferred, or admitted to inpatient care within 4 hours of ...
Dave Worthington +6 more
core +1 more source