Mohammed Islam Naas, Jalil Boukhobza, Philippe Raipin Parvédy, L. Lemarchand
{"title":"An Extension to iFogSim to Enable the Design of Data Placement Strategies","authors":"Mohammed Islam Naas, Jalil Boukhobza, Philippe Raipin Parvédy, L. Lemarchand","doi":"10.1109/CFEC.2018.8358724","DOIUrl":null,"url":null,"abstract":"Fog computing consists in extending Cloud services down to the network edge by using resources such as base stations, routers and switches. It presents a dense, heterogeneous and geo-distributed infrastructure which pushes to investigate how data are placed within this infrastructure in order to minimize service latency, network utilization and energy consumption. iFogSim is a Fog and IoT environments simulator dedicated to manage IoT services in a Fog infrastructure. In this paper, we present an extension to iFogSim to be able to model and simulate scenarios with strategies aiming to optimize data placement in Fog and IoT contexts. Data placement problem is NP-Hard due to the large number of Fog nodes and the high amount of data to be placed. Thus, we added a support to divide and conquer strategies to subdivide the issued infrastructure into several parts hence reducing the data placement computing time. Moreover, the extension involves a generic smart city scenario with different workloads making it possible for the users to investigate the behavior of their strategies using various workloads. In order to optimize the execution time of the simulations, we parallelized the Floyd-Warshall algorithm. This algorithm is used in iFogSim to compute all shortest paths between nodes in order to simulate data transmission. We have evaluated this extension using the proposed smart city scenario with various infrastructure configurations. The experiments show that our extension has a small overhead in terms of simulation time and memory utilization.","PeriodicalId":274968,"journal":{"name":"2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"45","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CFEC.2018.8358724","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 45
Abstract
Fog computing consists in extending Cloud services down to the network edge by using resources such as base stations, routers and switches. It presents a dense, heterogeneous and geo-distributed infrastructure which pushes to investigate how data are placed within this infrastructure in order to minimize service latency, network utilization and energy consumption. iFogSim is a Fog and IoT environments simulator dedicated to manage IoT services in a Fog infrastructure. In this paper, we present an extension to iFogSim to be able to model and simulate scenarios with strategies aiming to optimize data placement in Fog and IoT contexts. Data placement problem is NP-Hard due to the large number of Fog nodes and the high amount of data to be placed. Thus, we added a support to divide and conquer strategies to subdivide the issued infrastructure into several parts hence reducing the data placement computing time. Moreover, the extension involves a generic smart city scenario with different workloads making it possible for the users to investigate the behavior of their strategies using various workloads. In order to optimize the execution time of the simulations, we parallelized the Floyd-Warshall algorithm. This algorithm is used in iFogSim to compute all shortest paths between nodes in order to simulate data transmission. We have evaluated this extension using the proposed smart city scenario with various infrastructure configurations. The experiments show that our extension has a small overhead in terms of simulation time and memory utilization.