Multi‐objective container scheduling and multi‐path routing for elastic business process management in autonomic multi‐tenant cloud

Summary Cloud multi‐tenancy has a variant requirement, due to its resource sharing nature, satisfying such requirements and maintaining a balance between the resources and the business workloads of multiple tenants is a challenging task, and also the communication between scheduled containers leads...

Full description

Saved in:
Bibliographic Details
Published in:Concurrency and computation 2023-03, Vol.35 (6), p.1-1
Main Authors: Naji Saif, Mufeed Ahmed, Niranjan Aradhya, SK, Hezam Murshed, Belal Abdullah, Farhan Alnaggar, Omar Abdullah Murshed, Ali, Issa Mohammed Saeed
Format: Article
Language:English
Subjects:
Algorithms
autonomic multi‐tenant cloud
Business process management
Communication
container scheduling
Containers
elasticity
Energy consumption
multi‐path routing
multi‐tenancy
multi‐tenancy graph
Optimization
Power consumption
Resource utilization
Route planning
Scheduling
Search algorithms
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Summary Cloud multi‐tenancy has a variant requirement, due to its resource sharing nature, satisfying such requirements and maintaining a balance between the resources and the business workloads of multiple tenants is a challenging task, and also the communication between scheduled containers leads to high power consumption. To address these issues, this article proposes an autonomic approach to ensure the elasticity of BPM in multi‐tenant cloud. Where it employs the autonomic computing capabilities for scheduling the containers into the available servers then regulates the communication between the containers using multi‐path routing. For the container scheduling, a multi‐objective crow search optimization algorithm is proposed to schedule the containers into appropriate servers. Then, the discrete wolf search algorithm based multipath routing is proposed to route the communication flows between the containers by finding the optimal path with an objective to minimize the energy consumption. The optimal path is constructed as a multi‐tenancy graph with bandwidths determining the shortest distance between the servers and containers. The overall simulations shows that the proposed algorithm outperformed the other compared approaches in terms of make‐span, resource utilization, execution cost, execution time, and energy consumption.
ISSN:1532-0626
1532-0634
DOI:10.1002/cpe.7584