arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.06499cs.DC
收藏

HyEdge:混合边缘计算环境下的最优请求调度

HyEdge: Optimal Request Scheduling in Hybrid Edge Computing Environment

Siyuan Gu, Deke Guo, Guoming Tang, Lailong Luo, Yuchen Sun, Xueshan Luo

摘要:

随着物联网(IoT)设备的广泛使用和5G时代的到来,边缘计算已成为服务最终用户并提供更好QoS的有吸引力的范例。已经做了许多努力来在边缘提供一些合并的公共网络服务。我们发现,特定用户通常会调用私有和隔离的边缘服务来保护数据隐私并实现其他安全意图。然而,在边缘计算中满足这种混合请求仍然是开放的。在本文中,我们提出了混合边缘计算的框架,以系统地提供公共和私有边缘服务。为了充分利用这种新框架的好处,我们定义了一个给定的混合边缘服务器的放置解决方案的最优请求调度问题,以最大限度地减少响应延迟。这个问题被进一步建模为一个混合整数非线性问题(MINLP),这是典型的NP-难。因此,我们提出了基于划分的优化方法,它可以有效地解决这个NP难问题,通过问题分解和分支定界策略。最后,我们用真实世界的数据集进行了广泛的评估,以衡量我们的方法的性能。实验结果表明,该方法具有良好的性能和较低的计算复杂度.

英文摘要:

With the widespread use of Internet of Things (IoT) devices and the arrival of the 5G era, edge computing has become an attractive paradigm to serve end-users and provide better QoS. Many efforts have been done to provision some merging public network services at the edge. We reveal that it is very common that specific users call for private and isolated edge services to preserve data privacy and enable other security intentions. However, it still remains open to fulfill such kind of mixed requests in edge computing. In this paper, we propose the framework of hybrid edge computing to offer both public and private edge services systematically. To fully exploit the benefits of this novel framework, we define the problem of optimal request scheduling over a given placement solution of hybrid edge servers, so as to minimize the response delay. This problem is further modeled as a mixed integer non-linear problem (MINLP), which is typically NP-hard. Accordingly, we propose the partition-based optimization method, which can efficiently solve this NP-hard problem via the problem decomposition and the branch and bound strategies. We finally conduct extensive evaluations with a real-world dataset to measure the performance of our methods. The results indicate that the proposed method achieves elegant performance with low computation complexity.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑