Optimal Cloud Network Control with Strict Latency Constraints
Optimal Cloud Network Control with Strict Latency Constraints
复制标题
DOI：
10.1109/icc42927.2021.9500573
复制
发表时间：
2021-06
期刊：
影响因子：
--
通讯作者：
Yang Cai;Jaime Llorca;A. Tulino;A. Molisch
中科院分区：
文献类型：
--
作者：
Yang Cai;Jaime Llorca;A. Tulino;A. Molisch
通过分布式计算网络（如移动边缘计算）及时交付资源密集型和对延迟敏感的服务（如工业自动化、增强现实）正引起越来越多的关注。由于现有研究提供的平均延迟性能保证不足，我们关注的关键目标是在相应的截止日期之前以每包为基础提供下一代实时服务，同时最大限度地降低整体云网络资源成本。我们介绍了一种新颖的排队系统，该系统能够跟踪数据包的生命周期，并形式化具有严格期限约束的最优云网络控制问题。在说明了在由于生命周期到期而被丢弃之前将数据包发送到目的地的主要挑战之后，我们构建了一个等效公式，其中放松流守恒允许利用Lyapunov优化来推导出一个可证明的接近最优的全分布式算法。数值结果验证了理论分析的正确性，并表明所提出的控制策略与目前最先进的云网络控制相比具有优越的性能。
The timely delivery of resource-intensive and latency-sensitive services (e.g., industrial automation, augmented reality) over distributed computing networks (e.g., mobile edge computing) is drawing increasing attention. Motivated by the insufficiency of average delay performance guarantees provided by existing studies, we focus on the critical goal of delivering next generation real-time services ahead of corresponding deadlines on a per-packet basis, while minimizing overall cloud network resource cost. We introduce a novel queuing system that is able to track data packets’ lifetime and formalize the optimal cloud network control problem with strict deadline constraints. After illustrating the main challenges in delivering packets to their destinations before getting dropped due to lifetime expiry, we construct an equivalent formulation, where relaxed flow conservation allows leveraging Lyapunov optimization to derive a provably near-optimal fully distributed algorithm for the original problem. Numerical results validate the theoretical analysis and show the superior performance of the proposed control policy compared with state-of-the-art cloud network control.