- Ryabko, Andriy V., Zaika, Oksana V., Kukharchuk, Roman P. and Vakaliuk, Tetiana (orcid.org/0000-0001-6825-4697) (2021) Graph model of Fog Computing system Workshop on the Quantum Information Technologies + Edge Computing Workshop (2850). pp. 28-44. ISSN 1613-0073
Text
paper2.pdf - Published Version Download (827kB) |
Abstract
The development and effective application of Fog Computing technologies require the most complex tasks related to the management and processing of huge data sets, including the tasks of rational construction of low-level networks that ensure the functioning of end devices within the IoT concept. The article describes the use of graph theory methods to solve such problems. The proposed graph model can provide the ability to determine the basic properties of systems, networks, and network devices within the concept of Fog Computing, the optimal characteristics, and ways to maintain them in working condition. This paper shows how to plot graphs, and then customize the display to add labels or highlighting to the graph nodes and edges of pseudo-random task graphs which can be used for evaluating Mobile Cloud, Fog and Edge computing systems. The graphs are described and visualized in Matlab code. Each task has an amount of computational work to perform, expressed in Megacycles per second. Each edge has an amount of data to transfer between tasks, expressed in kilobits or kilobytes of data. The set can be used by researchers to evaluate cloud/fog/edge computing systems and computational offloading algorithms. The task graphs can be used in single-user systems, where one mobile device accesses a remote server, or in multi user systems, where many users access a remote server through a wireless channel.
Downloads
Downloads per month over past year
Actions (login required)
View Item |