A Multi-Tier Architecture for the Management of Supply Chain of Cloud Resources in a Virtualized Cloud Environment: A Novel SCM Technique for Cloud Resources Using Ant Colony Optimization and Spanning Tree

A Multi-Tier Architecture for the Management of Supply Chain of Cloud Resources in a Virtualized Cloud Environment: A Novel SCM Technique for Cloud Resources Using Ant Colony Optimization and Spanning Tree

Muhammad Aliyu, Murali M., Abdulsalam Y. Gital, Souley Boukari, Rumana Kabir, Maryam Abdullahi Musa, Fatima Umar Zambuk, Joshua Caleb Shawulu, Ibrahim M. Umar
DOI: 10.4018/IJISSCM.2021070101
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

As cloud resource demand grows, supply chain management (SCM), which is the core function of cloud computing, faces serious challenges. Quite a number of techniques have been proposed by many researchers for such a challenge. As such, numerous proposed strategies are still under reckoning and modification so as to enhance its potential. An optimized dynamic scheme that combined several algorithms' characteristics was proposed to map out such a challenge. The hybridized proposed scheme involved the meta-heuristic swarm mechanism of ant colony optimization (ACO) and deterministic spanning tree (SPT) algorithm as it obtained faster convergence chain, ensured resource utilization in least time and cost. Extensive experiments conducted in cloudsim simulator provided an efficient result in terms of minimized makespan time and throughput as compared to SPT, round robin (RR), and pre-emptive fair scheduling algorithm (PFSA) as it significantly improves performance.
Article Preview
Top

1. Introduction And Background

SCM involves the management of flow of goods and services (Syed and Zhang, 2019). It covers the management of work-in-progress inventory, storage of raw materials and resources from point of origin to point of consumption. Such management spans manufacturing companies, distribution firms, Cloud Service Providers (CSP) etc. CSP’s nowadays make use of consolidated and large Physical Internet (PI) with active hyperconnected supply chains for the provisioning of resources. As such, quite a number of challenges are encountered by the SCM systems as mentioned in (Ray et al., 2016) to include variety, velocity, volume value and verification. Velocity is the distance covered in specific direction (Rowland, 2019). The velocity in achieving an objective is equivalent to its speed. In terms of Cloud computing, it is the time covered for the optimal allocation of resources requested by user jobs. With the hyperconnected PI, it is the allocation of Virtual Machine (VM) in form of task request to satisfy user jobs (Aliyu et al. 2019). Several models are proposed by many researchers (Maryam et al., 2019; Sruthi et al., 2019; Ibrahim et al., 2016) for task scheduling. These authors considered different factors like Internet of Things (IoT), hyperconnected logistics, service level agreement aware application deployment etc. This research work proposes to involve two search characteristics to obtain faster convergence chain in Cloud task scheduling.

Task scheduling classification according to Aliyu et al, (2019) can be categorized either as real time, cloud service, workflow, or dynamic and static scheduling. Several dynamic techniques have been reviewed based on deterministic and metaheuristics to map out task scheduling disputes. Such researches can be seen in (Najme et al., 2019; Shabeera et al., 2016) and lots more. Dhinesh and Venkata (2013) adopted Linear Programming (LP) for Facility Location Problem (FLP) to reduce cost in setting up data centers. The LP technique used follows a stringent deterministic procedure that doesn’t scale well with dynamic environments like cloud. With heterogeneous Cloud environment, deterministic techniques perform poorly in terms of optimizing supply chain in task scheduling. Metaheuristic are sets of algorithmic concepts designed to find, generate, or select a heuristic that can render a sufficiently good result to an optimization problem with little alterations. They provide good quality result through exploration and exploitation especially with limited computation capacity or incomplete information applicable to a wide set of problems. Examples of metaheuristics include, clonal selection, ACO, gentic algorithm and so on. They perform reasonably in optimizing CSP throughput in areas such as, makespan minimization, load balancing and scalability by rendering close optimal results within reasonable time period (Aliyu, et al., 2019).

CSP’s can be categorized into three basic tiers for the provisioning of cloud resources. The 1st tier actually controls the backbone which they serve as the manufacturers of all cloud services. Tier 2 purchase services from tier 1, as such becomes the retailers. Tier 3 purchase services from tier 2, as such becomes the suppliers to end users. Despite the categorization, Cloud’s efficiency needs to be enhanced and improved for faster supply chain of service distribution. In view of the above challenge, the key objective of this research work is to involve the optimization mechanism used by metaheuristic and Deterministic Algorithm (DA) so as to improve SCM in Cloud environment. It is believed that using two search characteristics by both algorithms will strengthen their behavior to promote faster convergence speed and foster SCM throughput.

Section 2 of this paper discusses the concept of ACO and formulates the supply chain system where an architectural framework for the two search characteristics was structured. The experimental setup was highlighted in section 3, where experimental results, analysis and Comparison were discussed in section 4. Related work and discussion was conducted in section 5, as section 6 concludes the entire work and provided future research study.

Complete Article List

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