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.

翻译：我们分析了无线网络中满足端到端服务保障的调度问题，该保障由瞬时吞吐量和严格数据包截止时间定义。通过采用网络切片模型解耦流之间的排队动态，我们证明了在干扰条件下网络满足严格截止时间保障的能力在很大程度上受链路调度策略影响。我们刻画了孤立运行的单流场景下吞吐量与截止时间最优策略，这些策略为多流一般情况下的可行性提供了边界。我们证明在采用最坏情况稳定策略的多流配置中，数据包延迟可能任意增大，这表明队列稳定性不足以保障严格的截止时间。我们推导了基于链路调度时间间隔的端到端数据包延迟条件，并证明通过求解广义风车调度问题，可以在任何干扰模型下做出严格保障。最后，我们提出一种去中心化多项式时间算法，该算法在实现近最优吞吐量的同时满足严格的端到端数据包截止时间。