Decision-Epoch Matters: Unveiling its Impact on the Stability of Scheduling with Randomly Varying Connectivity
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917624283136000 |
|---|---|
| author | Soprano-Loto, Nahuel Ayesta, Urtzi Jonckheere, Matthieu Verloop, Ina Maria |
| author_facet | Soprano-Loto, Nahuel Ayesta, Urtzi Jonckheere, Matthieu Verloop, Ina Maria |
| contents | A classical queuing theory result states that in a parallel-queue single-server model, the maximum stability region does not depend on the scheduling decision epochs, and in particular is the same for preemptive and non-preemptive systems. We consider here the case in which each of the queues may be connected to the server or not, depending on an exogenous process. In our main result, we show that the maximum stability region now does strongly depend on how the decision epochs are defined. We compare the setting where decisions can be made at any moment in time (the unconstrained setting), to two other settings: decisions are taken either (i) at moments of a departure (non-preemptive scheduling), or (ii) when an exponentially clock rings with rate $γ$. We characterise the maximum stability region for the two constrained configurations, allowing us to observe a reduction compared to the unconstrained configuration. In the non-preemptive setting, the maximum stability region is drastically reduced compared to the unconstrained setting and we conclude that a non-preemptive scheduler cannot take opportunistically advantage (in terms of stability) of the random varying connectivity. Instead, for the $γ$ decision epochs, we observe that the maximum stability region is monotone in the rate of the decision moments $γ$, and that one can be arbitrarily close to the maximum stability region in the unconstrained setting if we choose $γ$ large enough. We further show that Serve Longest Connected (SLC) queue is maximum stable in both constrained settings, within the set of policies that select a queue among the connected ones. From a methodological viewpoint, we introduce a novel theoretical tool termed a ``test for fluid limits'' (TFL) that might be of independent interest. TFL is a simple test that, if satisfied by the fluid limit, allows us to conclude for stability. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_18686 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Decision-Epoch Matters: Unveiling its Impact on the Stability of Scheduling with Randomly Varying Connectivity Soprano-Loto, Nahuel Ayesta, Urtzi Jonckheere, Matthieu Verloop, Ina Maria Probability Performance A classical queuing theory result states that in a parallel-queue single-server model, the maximum stability region does not depend on the scheduling decision epochs, and in particular is the same for preemptive and non-preemptive systems. We consider here the case in which each of the queues may be connected to the server or not, depending on an exogenous process. In our main result, we show that the maximum stability region now does strongly depend on how the decision epochs are defined. We compare the setting where decisions can be made at any moment in time (the unconstrained setting), to two other settings: decisions are taken either (i) at moments of a departure (non-preemptive scheduling), or (ii) when an exponentially clock rings with rate $γ$. We characterise the maximum stability region for the two constrained configurations, allowing us to observe a reduction compared to the unconstrained configuration. In the non-preemptive setting, the maximum stability region is drastically reduced compared to the unconstrained setting and we conclude that a non-preemptive scheduler cannot take opportunistically advantage (in terms of stability) of the random varying connectivity. Instead, for the $γ$ decision epochs, we observe that the maximum stability region is monotone in the rate of the decision moments $γ$, and that one can be arbitrarily close to the maximum stability region in the unconstrained setting if we choose $γ$ large enough. We further show that Serve Longest Connected (SLC) queue is maximum stable in both constrained settings, within the set of policies that select a queue among the connected ones. From a methodological viewpoint, we introduce a novel theoretical tool termed a ``test for fluid limits'' (TFL) that might be of independent interest. TFL is a simple test that, if satisfied by the fluid limit, allows us to conclude for stability. |
| title | Decision-Epoch Matters: Unveiling its Impact on the Stability of Scheduling with Randomly Varying Connectivity |
| topic | Probability Performance |
| url | https://arxiv.org/abs/2403.18686 |