Optimal Slicing and Scheduling with Service Guarantees in Multi-Hop Wireless Networks
Name
3641512.3686385.pdf
Size
800.96 KB
Format
Adobe PDF
Checksum (MD5)
e3003d1d5006f7d63563f643f158e4e7
Author(s)
Jones, Nicholas
Modiano, Eytan
Date Issued
October 14, 2024
Publisher
ACM|The Twenty-fifth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing
Citation
Jones, Nicholas and Modiano, Eytan. 2024. "Optimal Slicing and Scheduling with Service Guarantees in Multi-Hop Wireless Networks."
Version
Final published version
Abstract
We analyze the problem of scheduling in wireless networks to meet end-to-end service guarantees. Using network slicing to decouple the queueing dynamics between flows, we show that the network's ability to meet hard throughput and deadline requirements is largely influenced by the scheduling policy. We characterize the feasible throughput/deadline region for a flow under a fixed route and set of slices, and find throughput- and deadline-optimal policies for a solitary flow. We formulate the feasibility problem for multiple flows in a general topology, and show its equivalence to finding a bounded-cost cycle on an exponentially large graph, which is un-solvable in polynomial time by the best-known algorithm. Using a novel concept called delay deficit, we develop a sufficient condition for meeting deadlines as a function of inter-scheduling times, and show that regular schedules are optimal for satisfying this condition. Motivated by this, we design a polynomial-time algorithm that returns an (almost) regular schedule, optimized to meet service guarantees for all flows.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3641512.3686385
