Placement Strategy for Intercommunicating Tasks of an Elastic Request in Fog-Cloud Environment

Abstract

Cloud computing hosts large number of modern day applications using the virtualization concept. However, end-to-end network latencies are detrimental to the performance of IoT (Internet of Things) applications like video surveillance and health monitoring. Although edge/fog computing alleviates the latency concerns to some extent, it is still not suitable for applications having intercommunicating tasks. Further, these applications can be elastic in nature and demand more tasks during their life-time. To address this gap, in this paper a network aware co-allocation strategy for the tasks of an individual applications is proposed. After modelling the problem using bin packing approach with additional constraints, the authors propose a novel heuristic IcAPER,(Inter-communication Aware Placement for Elastic Requests) algorithm. The proposed algorithm uses the network neighborhood machine for placement, once current resource is fully utilized by the application. Using CloudsimPlus simulator the performance IcAPER algorithm is compared with First Come First Serve (FCFS), Random and First Fit Decreasing (FFD) algorithms for the parameters (a) resource utilization (b) resource fragmentation and (c) Number of requests having intercommunicating tasks placed on to same PM. Extensive simulation results shows IcAPER maps 34% more tasks on to the same PM and also increase the resource utilization by 13% while decreasing the resource fragmentation by 37.8% when compared to other algorithms in our consideration.

A 3D Offline Packing Algorithm considering Cargo Orientation and Stability

“…The bin packing problem has a long history and has been extensively studied by scholars Fazili et al [1], such as the one-dimensional bin packing problems represented by resource scheduling, time scheduling, and load management, the two-dimensional bin packing problem represented by fabric cutting and sheet processing, and the threedimensional bin packing problem represented by container loading and vehicle loading. Among them, threedimensional bin packing problem is one of the most concerned combinatorial optimization problems Sridharan and Domnic [2]. The main goal is to find a space allocation method that can achieve the highest space utilization or the lowest cost [3], which can be divided into container packing problem, box packing problem, and back packing problem (Kyungdaw et al [4]; Mhand et al [5]).…”