An Osmosis-Based Intelligent Agent Scheduling Framework for Cloud Bursting in a Hybrid Cloud

An Osmosis-Based Intelligent Agent Scheduling Framework for Cloud Bursting in a Hybrid Cloud

Preethi Sheba Hepsiba, Grace Mary Kanaga E.
Copyright: © 2020 |Pages: 21
DOI: 10.4018/IJDST.2020070104
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

An intelligent system to efficiently provision resources in a hybrid cloud environment is necessary due to the high level of complexity. The semi-permeable agent for hybrid cloud scheduling (SPAH) is a bio-inspired agent that adapts the biological process of osmosis into cloud bursting. The primary objective of the agent is to minimize the makespan. The framework and algorithm for the two phases of SPAH, to recognize the state and decide on action are presented. A QoS (Quality of Service) deadline factor metric is proposed to study the indirect impact of SPAH in deadline satisfaction. SPAH shows significant improvement in deadline satisfaction of up to 85% as compared to other cloud bursting techniques. This is the result of a reduced makespan and a reduced cumulative waiting time. The analysis of SPAH shows that it works in quadratic time complexity.
Article Preview
Top

Background

Hybrid cloud scheduling is a multi-objective optimization problem. The objectives are often conflicting. To satisfy multiple objectives, several heuristics in the literature focus on deciding which tasks to offload to a public cloud while minimizing execution times, renting costs, maximizing resource utilization and profit, minimizing energy consumption and satisfying deadlines. (Chittaranjan, Padmanabh, and Saxena, 2017; Singh and Chana, 2016; Tang et al., 2018; Zhang et al., 2016). To meet multiple objectives, the focus of several heuristics in literature is to decide which tasks to offload to a public cloud and in doing so how the execution time can be reduced and the cost kept at a minimum.

The Forward-Backward (FB) and subsequently the Forward-Backward-Refinement (FBR) Algorithm is modeled with the objective of minimizing cost and communications (Charrada & Tata, 2016). FPTAS (Fully Polynomial-time approximation scheme) (Reza, Farahabady, Lee, & Zomaya, 2014) uses Pareto-optimality in dealing with conflicting objectives of cost and performance and reaches optimal solutions with reasonable computational overhead.

Complete Article List

Search this Journal:
Reset
Volume 15: 1 Issue (2024)
Volume 14: 2 Issues (2023)
Volume 13: 8 Issues (2022)
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing