Scheduling in Multi-Hop Wireless Networks With Deadlines
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910146305720320 |
|---|---|
| author | Jones, Nicholas Modiano, Eytan |
| author_facet | Jones, Nicholas Modiano, Eytan |
| contents | We analyze the problem of scheduling in wireless networks to meet end-to-end service guarantees, defined by instantaneous throughput and hard packet deadlines. Using a network slicing model to decouple the queueing dynamics between flows, we show that the network's ability to meet hard deadline guarantees under interference is largely influenced by the link scheduling policy. We characterize throughput- and deadline-optimal policies for a solitary flow operating in isolation, which provide bounds on feasibility in the general case with multiple flows. We prove that packet delays can grow arbitrarily large in the multi-flow setting under a worst-case stabilizing policy, showing that queue stability is not sufficient to guarantee tight deadlines. We derive conditions on end-to-end packet delays in terms of link inter-scheduling times, and show that it is possible to make hard guarantees under any interference model by solving a generalized version of the pinwheel scheduling problem. Finally, we introduce a decentralized polynomial-time algorithm which can meet tight end-to-end packet deadlines while achieving near-optimal throughput. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_17493 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Scheduling in Multi-Hop Wireless Networks With Deadlines Jones, Nicholas Modiano, Eytan Networking and Internet Architecture We analyze the problem of scheduling in wireless networks to meet end-to-end service guarantees, defined by instantaneous throughput and hard packet deadlines. Using a network slicing model to decouple the queueing dynamics between flows, we show that the network's ability to meet hard deadline guarantees under interference is largely influenced by the link scheduling policy. We characterize throughput- and deadline-optimal policies for a solitary flow operating in isolation, which provide bounds on feasibility in the general case with multiple flows. We prove that packet delays can grow arbitrarily large in the multi-flow setting under a worst-case stabilizing policy, showing that queue stability is not sufficient to guarantee tight deadlines. We derive conditions on end-to-end packet delays in terms of link inter-scheduling times, and show that it is possible to make hard guarantees under any interference model by solving a generalized version of the pinwheel scheduling problem. Finally, we introduce a decentralized polynomial-time algorithm which can meet tight end-to-end packet deadlines while achieving near-optimal throughput. |
| title | Scheduling in Multi-Hop Wireless Networks With Deadlines |
| topic | Networking and Internet Architecture |
| url | https://arxiv.org/abs/2604.17493 |