arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.05971cs.DCcs.NE
收藏

混合云平台服务放置的增强型二进制粒子群优化(E-BPSO)算法

An Enhanced Binary Particle-Swarm Optimization (E-BPSO) Algorithm for Service Placement in Hybrid Cloud Platforms

Wissem Abbes, Zied Kechaou, Amir Hussain, Abdulrahman M. Qahtani, Omar Aimutiry, Habib Dhahri, Adel M. Alimi

摘要:

如今,混合云平台对于打算实施私有云和公共云应用程序的组织来说是一个有吸引力的解决方案,以满足其盈利能力要求。然而,这只能通过利用可用资源同时加快执行过程来实现。因此,部署新的应用程序需要将其中一些流程专用于私有云解决方案,而将其他流程分配给公共云。在这种情况下,目前的工作是为了帮助最大限度地减少相关成本,并提供有效的选择,在最短的执行时间内的最佳服务放置解决方案。一些进化算法已被应用于解决服务放置问题,并用于处理复杂的解决方案空间时,提供一个最佳的位置,往往产生一个很短的执行时间。标准的BPSO算法被发现显示一个显着的缺点,即,容易陷入局部最优,除了表现出显着缺乏鲁棒性,在处理服务放置问题。因此,为了克服与标准BPSO相关的关键缺点,提出了一种增强型二进制粒子群优化(E-BPSO)算法,该算法由粒子位置更新方程的修改组成,最初灵感来自连续PSO。我们提出的E-BPSO算法表现出优于国家的最先进的方法在成本和执行时间方面,使用一个真正的基准。

英文摘要:

Nowadays, hybrid cloud platforms stand as an attractive solution for organizations intending to implement combined private and public cloud applications, in order to meet their profitability requirements. However, this can only be achieved through the utilization of available resources while speeding up execution processes. Accordingly, deploying new applications entails dedicating some of these processes to a private cloud solution, while allocating others to the public cloud. In this context, the present work is set to help minimize relevant costs and deliver effective choices for an optimal service placement solution within minimal execution time. Several evolutionary algorithms have been applied to solve the service placement problem and are used when dealing with complex solution spaces to provide an optimal placement and often produce a short execution time. The standard BPSO algorithm is found to display a significant disadvantage, namely, of easily trapping into local optima, in addition to demonstrating a noticeable lack of robustness in dealing with service placement problems. Hence, to overcome critical shortcomings associated with the standard BPSO, an Enhanced Binary Particle Swarm Optimization (E-BPSO) algorithm is proposed, consisting of a modification of the particle position updating equation, initially inspired from the continuous PSO. Our proposed E-BPSO algorithm is shown to outperform state-of-the-art approaches in terms of both cost and execution time, using a real benchmark.

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

↑