An approximation for multi-server queues with deterministic reneging times

An approximation for multi-server queues with deterministic reneging times

0.00 Avg rating0 Votes
Article ID: iaor200973431
Volume: 172
Issue: 1
Start Page Number: 143
End Page Number: 151
Publication Date: Nov 2009
Journal: Annals of Operations Research
Authors: ,
Abstract:

This work was motivated by the timeout mechanism used in managing application servers in transaction processing environments. In such systems, a customer who stays in the queue longer than the timeout period is lost. We modeled a server node with a timeout threshold as a multi-server queue with Poisson arrivals, general service time distribution and deterministic reneging times. We proposed a scaling approach, and a fast and accurate approximation for the expected waiting time in the queue.

Reviews

Required fields are marked *. Your email address will not be published.