Hitting time in Erlang loss systems with moving boundaries
Number of Authors: 1
2014 (English)In: Queueing systems, ISSN 0257-0130, E-ISSN 1572-9443, Vol. 78, 225-254 p.Article in journal (Refereed) Published
When the boundary—the total number of servers—in an Erlang loss system is a function of time, customers may also be lost due to boundary variations. On condition that these customers are selected independently of their history, we solve for the hitting-time distribution and transient distribution of busy servers. We derive concise asymptotic expressions in the time domain for normal loads in the heavy-traffic limit, i.e., when the offered load ρ is high, and the number of servers scales as ρ+O(√ρ). The solutions are computationally efficient, and simulations confirm the theoretical results.
Place, publisher, year, edition, pages
Springer , 2014, 11. Vol. 78, 225-254 p.
Mathematics Subject Classification Primary: 60K25 Queueing theory, 90B22 Queues and service, Secondary: 60J80 Branching processes First passage time, Spectral decomposition, Charlier polynomial, Hermite function, Diffusion Colored noise
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-24397DOI: 10.1007/s11134-014-9399-5OAI: oai:DiVA.org:ri-24397DiVA: diva2:1043478