A Distributed Orchestration Algorithm for Edge Computing Resources with Guarantees
A Distributed Orchestration Algorithm for Edge Computing Resources with Guarantees
复制标题
DOI：
10.1109/infocom.2019.8737532
复制
发表时间：
2019-04
期刊：
影响因子：
--
通讯作者：
Gabriele Castellano;Flavio Esposito;Fulvio Risso
中科院分区：
文献类型：
--
作者：
Gabriele Castellano;Flavio Esposito;Fulvio Risso
边缘计算在网络边缘带来了虚拟化技术的灵活性和可扩展性，使服务提供商能够在更丰富的网络基础设施上部署新的应用程序。然而，在相同的基础设施上共存的各种应用程序加剧了已经具有挑战性的问题，协调资源分配，同时保持资源分配最优。事实上，（i）由于其异构需求，每个应用程序可能需要不同的优化标准，（ii）由于边缘网络的高度动态性，我们可能不依赖集中式编排器。为了解决这个问题，我们提出了DRAGON，一个分布式资源分配和分层算法，寻求在一个共同的边缘基础设施上运行的不同应用程序之间的共享资源的最佳分区。我们设计的DRAGON，以保证收敛时间和最佳的（1-1/e）-近似的帕累托最优资源分配的约束。我们评估的融合和性能的DRAGON的原型实现，评估的好处相比，传统的编排方法。
Edge Computing brings flexibility and scalability of virtualization technologies at the edge of the network, enabling service providers to deploy new applications over a richer network infrastructure. However, the coexistence of such variety of applications on the same infrastructure exacerbates the already challenging problem of coordinating resource allocation while preserving the resource assignment optimality. In fact, (i) each application can potentially require different optimization criteria due to their heterogeneous requirements, and (ii) we may not count on a centralized orchestrator due to the highly dynamic nature of edge networks. To solve this problem, we present DRAGON, a Distributed Resource AssiGnment and OrchestratioN algorithm that seeks optimal partitioning of shared resources between different applications running over a common edge infrastructure. We designed DRAGON to guarantee both a bound on convergence time and an optimal (1-1/e)-approximation with respect to the Pareto optimal resource assignment. We evaluate convergence and performance of DRAGON on a prototype implementation, assessing the benefits compared to traditional orchestration approaches.