Load Balancing at Fog Nodes using Scheduling Algorithms

Abstract

Cloud Computing proves to be most predominant innovative field in the area of Information technology. Cloud is best suited for small scale to large scale businesses and personal purposes such as storing, computing, managing data & resources, running applications and many more. Due to increasing large volumes of data over cloud servers created subsequent specific issues like data maintainability, network elasticity, managing Internet of Things (I.o.T’s) devices and many more. Recent progresses in Technology are given rise to fog computing or decentralized cloud to overcome cloud server issues called fog nodes. In this paper we present a brief note on how cloud issues can overcome using fog nodes benefits along with elaboration of load balancing factor. To maintain load balancing of fog nodes no much appreciable work took place in the field of fog computing. This paper proposes a scheduler which receives the devices in to a Job Queue to be connected over cloud. To apply scheduling algorithms like F.C.F.S, S.J.F, P.S, R.R and W.R.R. over fog nodes will be discussed along with their merits & demerits. At last we try to compare the various parameters of load balancing among various scheduling algorithms. In this paper we focus on how fog nodes perform functions like considerable storages, low latency, heterogeneity, allocation & interaction with limited IoT devices and Security along with architecture cloud to fog. During allocation of IoT devices to various fog nodes we will come across a serious issues i.e load balancing on fog nodes. Our detailed study presents the comparison of above mentioned scheduling algorithms load balancing factors such as rich resources allocations & Balancing among fog nodes, Identification of devices, Authentication of fog nodes, bandwidth consumption, location awareness, response time, cost maintenances, Intrusion detection, fault forbearances and maintainability.