An approximation for multi-server queues with deterministic reneging times

Wei Xiong and Tayfur Altiok ()

Annals of Operations Research, 2009, vol. 172, issue 1, 143-151

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. Copyright Springer Science+Business Media, LLC 2009

Keywords: Reneging; Multi-server queues; Scaling approximation (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-009-0534-3 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:172:y:2009:i:1:p:143-151:10.1007/s10479-009-0534-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-009-0534-3

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().