Optimizing queues with deadlines under infrequent monitoring
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917619095830528 |
|---|---|
| author | Farahvash, Faraz Tang, Ao |
| author_facet | Farahvash, Faraz Tang, Ao |
| contents | In this paper, we aim to improve the percentage of packets meeting their deadline in discrete-time M/M/1 queues with infrequent monitoring. More specifically, we look into policies that only monitor the system (and subsequently take actions) after a packet arrival. We model the system as an MDP and provide the optimal policy for some special cases. Furthermore, we introduce a heuristic algorithm called "AB-n" for general deadlines. Finally, we provide numerical results demonstrating the desirable performance of "AB-n" policies. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_14525 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Optimizing queues with deadlines under infrequent monitoring Farahvash, Faraz Tang, Ao Systems and Control Networking and Internet Architecture In this paper, we aim to improve the percentage of packets meeting their deadline in discrete-time M/M/1 queues with infrequent monitoring. More specifically, we look into policies that only monitor the system (and subsequently take actions) after a packet arrival. We model the system as an MDP and provide the optimal policy for some special cases. Furthermore, we introduce a heuristic algorithm called "AB-n" for general deadlines. Finally, we provide numerical results demonstrating the desirable performance of "AB-n" policies. |
| title | Optimizing queues with deadlines under infrequent monitoring |
| topic | Systems and Control Networking and Internet Architecture |
| url | https://arxiv.org/abs/2403.14525 |