An M/M/c queue with queueing-time dependent service rates
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908334787919872 |
|---|---|
| author | D'Auria, Bernardo Adan, Ivo J. B. F. Bekker, René Kulkarni, Vidyadhar |
| author_facet | D'Auria, Bernardo Adan, Ivo J. B. F. Bekker, René Kulkarni, Vidyadhar |
| contents | Recent studies indicate that in many situations service times are affected by the experienced queueing delay of the particular customer. This effect has been detected in different areas, such as health care, call centers and telecommunication networks. In this paper we present a methodology to analyze a model having this property. The specific model is an M/M/c queue in which any customer may be tagged at her arrival time if her queueing time will be above a certain fixed threshold. All tagged customers are then served at a given rate that may differ from the rate used for the non-tagged customers. We show how it is possible to model the virtual queueing time of this queueing system by a specific Markov chain. Then, solving the corresponding balance equations, we give a recursive solution to compute the stationary distribution, which involves a mixture of exponential terms. Using numerical experiments, we demonstrate that the differences in service rates can have a crucial impact on queueing time performance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2107_04557 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | An M/M/c queue with queueing-time dependent service rates D'Auria, Bernardo Adan, Ivo J. B. F. Bekker, René Kulkarni, Vidyadhar Probability Recent studies indicate that in many situations service times are affected by the experienced queueing delay of the particular customer. This effect has been detected in different areas, such as health care, call centers and telecommunication networks. In this paper we present a methodology to analyze a model having this property. The specific model is an M/M/c queue in which any customer may be tagged at her arrival time if her queueing time will be above a certain fixed threshold. All tagged customers are then served at a given rate that may differ from the rate used for the non-tagged customers. We show how it is possible to model the virtual queueing time of this queueing system by a specific Markov chain. Then, solving the corresponding balance equations, we give a recursive solution to compute the stationary distribution, which involves a mixture of exponential terms. Using numerical experiments, we demonstrate that the differences in service rates can have a crucial impact on queueing time performance. |
| title | An M/M/c queue with queueing-time dependent service rates |
| topic | Probability |
| url | https://arxiv.org/abs/2107.04557 |