Abstract
The increased adoption of the IoT paradigm requires us to take a good look at the network weight it creates. As adoption increases, so does the network load and server cost, causing a jump in required expenses. A solution for this is Fog Computing, where we distribute the cloud load over the network devices so that the tasks get pre-processed before reaching the cloud level, or might not even have to reach the cloud level. To aid with this research, we wrote a simulator that calculates the optimal spread of the application over the network devices, and shows us how this spread will occur. This spread will be based on context, where for example processor-bound machines get smaller tasks and energy-bound machines get energy-efficient tasks. We use this simulator to compare algorithms used for placing the application.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chowdhury, M., Rahman, M.R., Boutaba, R.: ViNEYard: virtual network embedding algorithms with coordinated node and link mapping (2012). https://doi.org/10.1109/TNET.2011.2159308
FED4FIRE: FED4FIRE+. https://www.fed4fire.eu/the-project/. Accessed 28 Dec 2017
Gupta, H., Dasterdji, M., et al.: iFogSim: A toolkit for modeling and simulation of resource management techniques in the Internet of Things. In: Edge and Fog Computing Environments (2017). https://doi.org/10.1002/spe.2509
Hendrickson, B., Leland, R.W.: A multi-level algorithm for partitioning graphs, pp. 1–14 (1995)
MathWorks: how the genetic algorithm works. https://nl.mathworks.com/help/gads/how-the-genetic-algorithm-works.html. Accessed 25 May 2018
Mohan, N., Kangasharju, J.: Edge-fog cloud: a distributed cloud for internet of things computations, pp. 1–14 (2016)
Sharif, M., Mercelis, S., Hellinckx, P.: Context-aware optimization of distributed resources in internet of things using key performance indicators, pp. 733–742 (2018)
Singh, K., Chhabra, A.: A survey of evolutionary heuristic algorithm for job scheduling in grid computing, pp. 611–619 (2015)
Skiena, S.: The Algorithm Design Manual, pp. 251–253 (2015). https://doi.org/10.1007/978-1-84800-070-4
Talbi, E.G., Muntean, T.: Hill-climbing, simulated annealing and genetic algorithms: a comparative study and application to the mapping problem (1993). https://doi.org/10.1109/HICSS.1993.284069
Wang, S., Zafer, M., Leung, K.: Online placement of multi-component applications in edge computing, pp. 1–14 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Eyckerman, R., Sharif, M., Mercelis, S., Hellinckx, P. (2019). Context-Aware Distribution In Constrained IoT Environments. In: Xhafa, F., Leu, FY., Ficco, M., Yang, CT. (eds) Advances on P2P, Parallel, Grid, Cloud and Internet Computing. 3PGCIC 2018. Lecture Notes on Data Engineering and Communications Technologies, vol 24. Springer, Cham. https://doi.org/10.1007/978-3-030-02607-3_40
Download citation
DOI: https://doi.org/10.1007/978-3-030-02607-3_40
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-02606-6
Online ISBN: 978-3-030-02607-3
eBook Packages: EngineeringEngineering (R0)