Cellular networks provide communication for different applications. Some applications have strict and very short latency requirements, while others require high bandwidth with varying priorities. The challenge of satisfying the requirements grows in congested traffic where some packets might miss their deadlines. Unfortunately, we prove that the problem is NP-Hard. To overcome this, we propose a new scheduling policy for packets with multiple priorities, latency requirements, and strict deadlines. To alleviate the complexity, our solution incorporates a novel time domain relaxation solved by linear programming. Simulation results show that this method outperforms existing scheduling strategies.

翻译：细胞网络为不同应用程序提供通信。 有些应用程序有严格且非常短的延迟要求, 而另一些应用程序则需要高带宽, 且有不同的优先事项。 满足需求的挑战在拥挤的交通中增加, 有些包可能错过最后期限。 不幸的是, 我们证明问题在于 NP- Hard 。 为了解决这个问题, 我们为具有多个优先事项、 延迟要求和严格最后期限的包提出了新的时间安排政策 。 为了减轻复杂性, 我们的解决方案包含了通过线性编程解决的新时间域宽度。 模拟结果显示, 这种方法比现有的排期战略要好 。