Throughput-Optimal Scheduling via Rate Learning
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_ | 1866913500139356160 |
|---|---|
| author | Promponas, Panagiotis Valls, Víctor Nikolakakis, Konstantinos Kalogerias, Dionysis Tassiulas, Leandros |
| author_facet | Promponas, Panagiotis Valls, Víctor Nikolakakis, Konstantinos Kalogerias, Dionysis Tassiulas, Leandros |
| contents | We study the problem of designing scheduling policies for communication networks. This problem is often addressed with max-weight-type approaches since they are throughput-optimal. However, max-weight policies make scheduling decisions based on the network congestion, which can be sometimes unnecessarily restrictive. In this paper, we present a ``schedule as you learn'' (SYL) approach, where we learn an average rate, and then select schedules that generate such a rate in expectation. This approach is interesting because scheduling decisions do not depend on the size of the queue backlogs, and so it provides increased flexibility to select schedules based on other criteria or rules, such as serving high-priority queues. We illustrate the results with numerical experiments for a cross-bar switch and show that, compared to max-weight, SYL can achieve lower latency to certain flows without compromising throughput optimality. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_09198 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Throughput-Optimal Scheduling via Rate Learning Promponas, Panagiotis Valls, Víctor Nikolakakis, Konstantinos Kalogerias, Dionysis Tassiulas, Leandros Networking and Internet Architecture Systems and Control We study the problem of designing scheduling policies for communication networks. This problem is often addressed with max-weight-type approaches since they are throughput-optimal. However, max-weight policies make scheduling decisions based on the network congestion, which can be sometimes unnecessarily restrictive. In this paper, we present a ``schedule as you learn'' (SYL) approach, where we learn an average rate, and then select schedules that generate such a rate in expectation. This approach is interesting because scheduling decisions do not depend on the size of the queue backlogs, and so it provides increased flexibility to select schedules based on other criteria or rules, such as serving high-priority queues. We illustrate the results with numerical experiments for a cross-bar switch and show that, compared to max-weight, SYL can achieve lower latency to certain flows without compromising throughput optimality. |
| title | Throughput-Optimal Scheduling via Rate Learning |
| topic | Networking and Internet Architecture Systems and Control |
| url | https://arxiv.org/abs/2409.09198 |