IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i19p2522-d651368.html
   My bibliography  Save this article

Optimized Task Group Aggregation-Based Overflow Handling on Fog Computing Environment Using Neural Computing

Author

Listed:
  • Harwant Singh Arri

    (School of Computer Science and Engineering, Lovely Professional University, Phagwara, Punjab 144411, India)

  • Ramandeep Singh

    (School of Computer Science and Engineering, Lovely Professional University, Phagwara, Punjab 144411, India)

  • Sudan Jha

    (School of Computational Sciences, CHRIST (Deemed to be University), Mariam Nagar, Meerut Road, Delhi NCR, Ghaziabad 201003, India)

  • Deepak Prashar

    (School of Computer Science and Engineering, Lovely Professional University, Phagwara, Punjab 144411, India)

  • Gyanendra Prasad Joshi

    (Department of Computer Science and Engineering, Sejong University, Gwangjin-gu, Seoul 05006, Korea)

  • Ill Chul Doo

    (Artificial Intelligence Education, Hankuk University of Foreign Studies, Dongdaemun-gu, Seoul 02450, Korea)

Abstract

It is a non-deterministic challenge on a fog computing network to schedule resources or jobs in a manner that increases device efficacy and throughput, diminishes reply period, and maintains the system well-adjusted. Using Machine Learning as a component of neural computing, we developed an improved Task Group Aggregation (TGA) overflow handling system for fog computing environments. As a result of TGA usage in conjunction with an Artificial Neural Network (ANN), we may assess the model’s QoS characteristics to detect an overloaded server and then move the model’s data to virtual machines (VMs). Overloaded and underloaded virtual machines will be balanced according to parameters, such as CPU, memory, and bandwidth to control fog computing overflow concerns with the help of ANN and the machine learning concept. Additionally, the Artificial Bee Colony (ABC) algorithm, which is a neural computing system, is employed as an optimization technique to separate the services and users depending on their individual qualities. The response time and success rate were both enhanced using the newly proposed optimized ANN-based TGA algorithm. Compared to the present work’s minimal reaction time, the total improvement in average success rate is about 3.6189 percent, and Resource Scheduling Efficiency has improved by 3.9832 percent. In terms of virtual machine efficiency for resource scheduling, average success rate, average task completion success rate, and virtual machine response time are improved. The proposed TGA-based overflow handling on a fog computing domain enhances response time compared to the current approaches. Fog computing, for example, demonstrates how artificial intelligence-based systems can be made more efficient.

Suggested Citation

  • Harwant Singh Arri & Ramandeep Singh & Sudan Jha & Deepak Prashar & Gyanendra Prasad Joshi & Ill Chul Doo, 2021. "Optimized Task Group Aggregation-Based Overflow Handling on Fog Computing Environment Using Neural Computing," Mathematics, MDPI, vol. 9(19), pages 1-15, October.
  • Handle: RePEc:gam:jmathe:v:9:y:2021:i:19:p:2522-:d:651368
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/19/2522/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/9/19/2522/
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ibrahim Attiya & Laith Abualigah & Doaa Elsadek & Samia Allaoua Chelloug & Mohamed Abd Elaziz, 2022. "An Intelligent Chimp Optimizer for Scheduling of IoT Application Tasks in Fog Computing," Mathematics, MDPI, vol. 10(7), pages 1-18, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:19:p:2522-:d:651368. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.