Processor-shared buffers with reneging
Performance Evaluation - Special issue on bandwidth management and congestion control of high-speed networks
Erlang capacity and uniform approximations for shared unbuffered resources
IEEE/ACM Transactions on Networking (TON)
Simulation run lengths to estimate blocking probabilities
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Improving Service by Informing Customers About Anticipated Delays
Management Science
Designing a Call Center with Impatient Customers
Manufacturing & Service Operations Management
Properties of the Reflected Ornstein–Uhlenbeck Process
Queueing Systems: Theory and Applications
A Diffusion Approximation for a GI/GI/1 Queue with Balking or Reneging
Queueing Systems: Theory and Applications
A Diffusion Approximation for a GI/GI/1 Queue with Balking or Reneging
Queueing Systems: Theory and Applications
Call Centers with Impatient Customers: Many-Server Asymptotics of the M/M/n + G Queue
Queueing Systems: Theory and Applications
The impact of reneging in processor sharing queues
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Estimation for queues from queue length data
Queueing Systems: Theory and Applications
Monotonicity Properties For Multiserver Queues With Reneging And Finite Waiting Lines
Probability in the Engineering and Informational Sciences
Stationary delays for a two-class priority queue with impatient customers
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Probability in the Engineering and Informational Sciences
Optimal Capacity Overbooking for the Regular Treatment of Chronic Conditions
Operations Research
Properties of the first passage times of the reflected O-U process with a two-sided barrier
Queueing Systems: Theory and Applications
The n-network model with upgrades
Probability in the Engineering and Informational Sciences
Dynamic control of a single-server system with abandonments
Queueing Systems: Theory and Applications
Computers & Mathematics with Applications
Service center trade-offs between customer impatience and power consumption
Performance Evaluation
A Diffusion Regime with Nondegenerate Slowdown
Operations Research
Large-Scale Service Marketplaces: The Role of the Moderating Firm
Management Science
First passage times of reflected Ornstein---Uhlenbeck processes with two-sided jumps
Queueing Systems: Theory and Applications
Trading power consumption against performance by reserving blocks of servers
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
Trading power consumption against performance by reserving blocks of servers
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
Multiresource Allocation Scheduling in Dynamic Environments
Manufacturing & Service Operations Management
Diffusion approximations for open Jackson networks with reneging
Queueing Systems: Theory and Applications
On the time-dependent moments of Markovian queues with reneging
Queueing Systems: Theory and Applications
Dynamic scheduling of a GI/GI/1+GI queue with multiple customer classes
Queueing Systems: Theory and Applications
Hi-index | 0.01 |
Consider a single-server queue with a Poisson arrival process and exponential processing times in which each customer independently reneges after an exponentially distributed amount of time. We establish that this system can be approximated by either a reflected Ornstein–Uhlenbeck process or a reflected affine diffusion when the arrival rate exceeds or is close to the processing rate and the reneging rate is close to 0. We further compare the quality of the steady-state distribution approximations suggested by each diffusion.