论文标题
截止日期和优先级的数据包的联合计划和资源分配
Joint Scheduling and Resource Allocation for Packets with Deadlines and Priorities
论文作者
论文摘要
蜂窝网络为不同的应用程序提供通信。某些应用程序具有严格且非常短的延迟要求，而另一些应用程序需要高的带宽，重点不同。满足需求的挑战在拥挤的交通中越来越大，一些数据包可能会错过他们的截止日期。不幸的是，我们证明问题是NP-HARD。为了克服这一点，我们为具有多个优先级，延迟要求和严格截止日期的数据包提出了一项新的调度策略。为了减轻复杂性，我们的解决方案结合了通过线性编程解决的新型时域松弛。仿真结果表明，此方法的表现优于现有的调度策略。
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.
