Optimised fuzzy clustering-based resource scheduling and dynamic load balancing algorithm for fog computing environment
by Bikash Sarma; R. Kumar; Themrichon Tuithung
International Journal of Computational Science and Engineering (IJCSE), Vol. 24, No. 4, 2021

Abstract: An influential and standard tool, fog computing performs applications of internet of things (IoT) and it is the cloud computing's extended version. In the network of edge computing, the applications of IoT are possibly implemented by fog computing which is an emerging technology. Load on cloud is minimised with proper resource allocation using fog computing methods. Throughput maximisation, available resources optimisation, response time reduction, and elimination of overloaded single resource are the goal of load balancing algorithm. This paper suggests an optimised fuzzy clustering-based resource scheduling and dynamic load balancing (OFCRS-DLB) procedure for resource scheduling and load balancing in fog computing. For resource scheduling, this paper recommends an enhanced form of fast fuzzy C-means (FFCM) with crow search optimisation (CSO) algorithm in fog computing. Finally, the load balancing is done using scalability decision technique. The proficiency of the recommended technique is obtained by comparing with other evolutionary methods.

Online publication date: Thu, 12-Aug-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com