Approximate Computation of Loss Probability for Queueing System with Capacity Sharing Discipline
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915050166419456 |
|---|---|
| author | Yashina, M. V. Tatashev, A. G. |
| author_facet | Yashina, M. V. Tatashev, A. G. |
| contents | A multi-channel queueing system is considered. The arriving requests differ in their type. Requests of each type arrive according to a Poisson process. The number of channels required for service with the rate equal to 1 depends of the request type. If a request is serviced with the rate equal to 1, then, by definition, the length of the request equals to the total service time. If at arrival moment, the idle channels is sufficient, then the arriving request is serviced with the rate 1. If, at the arrival moment, there are no idle channel, then the arriving request is lost. If, at arrival moment, there are idle channels but the number of idle channels is not sufficient for servicing with rate 1, then the request begins to be in service with rate equal to the ratio of the number of idle channels to the number of the channels required for service with the rate 1. If a request is serviced with a rate less than 1 and another request leaves the system, then the service rate increases for the request in consideration. Approximate formula for loss probability has been proposed. The accuracy of approximation is estimated. Approximate values are compared with exact values found from the system of equations for the related Markov chain stationary state probabilities. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_04500 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Approximate Computation of Loss Probability for Queueing System with Capacity Sharing Discipline Yashina, M. V. Tatashev, A. G. Optimization and Control Probability A multi-channel queueing system is considered. The arriving requests differ in their type. Requests of each type arrive according to a Poisson process. The number of channels required for service with the rate equal to 1 depends of the request type. If a request is serviced with the rate equal to 1, then, by definition, the length of the request equals to the total service time. If at arrival moment, the idle channels is sufficient, then the arriving request is serviced with the rate 1. If, at the arrival moment, there are no idle channel, then the arriving request is lost. If, at arrival moment, there are idle channels but the number of idle channels is not sufficient for servicing with rate 1, then the request begins to be in service with rate equal to the ratio of the number of idle channels to the number of the channels required for service with the rate 1. If a request is serviced with a rate less than 1 and another request leaves the system, then the service rate increases for the request in consideration. Approximate formula for loss probability has been proposed. The accuracy of approximation is estimated. Approximate values are compared with exact values found from the system of equations for the related Markov chain stationary state probabilities. |
| title | Approximate Computation of Loss Probability for Queueing System with Capacity Sharing Discipline |
| topic | Optimization and Control Probability |
| url | https://arxiv.org/abs/2412.04500 |