An approximation for multi-server queues with deterministic reneging times

This work was motivated by the timeout mechanism used ill 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.