EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Graph theory methods for fog computing: A pseudo-random task graph model for evaluating mobile cloud, fog and edge computing systems

Andriy V. Ryabko, Oksana V. Zaika, Roman P. Kukharchuk, Tetiana A. Vakaliuk

Journal of Edge Computing · 2022

DOI: 10.55056/jec.569 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Edge Computing, 2022. Verfasst von Andriy V. Ryabko und 3 weiteren Autor:innen. Die Arbeit wurde bisher 11-mal zitiert (Crossref) und nennt 21 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The development and efficient application of Fog Computing technologies necessitate complex tasks associated with the management and processing of large data sets, including the creation of low-level networks that guarantee the functioning of end devices within the Internet of Things (IoT) concept. This article presents the utilization of graph theory techniques to address these issues. The proposed graph model enables the determination of fundamental characteristics of systems, networks, and network devices in Fog Computing, including optimal features and methods to maintain them in a functioning condition. This work demonstrates how to create and personalize graph displays by adding labels or highlighting to the graph nodes and edges of pseudo-random task graphs. The task graphs, described and visualized in Matlab code, represent the computational work to perform and data transfer between tasks, expressed in Megacycles per second and kilobits/kilobytes of data, respectively. The task graphs can be applied in both single-user systems, where one mobile device accesses a remote server, and multi-user systems, where many users access a remote server through a wireless channel. This set can be utilized by researchers to evaluate cloud/fog/edge computing systems and computational offloading algorithms.

Zitieren

APA

Ryabko, A. V., Zaika, O. V., Kukharchuk, R. P., & Vakaliuk, T. A. (2022). Graph theory methods for fog computing: A pseudo-random task graph model for evaluating mobile cloud, fog and edge computing systems. Journal of Edge Computing. https://doi.org/10.55056/jec.569

Vancouver

Ryabko AV, Zaika OV, Kukharchuk RP, Vakaliuk TA. Graph theory methods for fog computing: A pseudo-random task graph model for evaluating mobile cloud, fog and edge computing systems. Journal of Edge Computing. 2022. doi:10.55056/jec.569

BibTeX
@article{Ryabko2022,
  author = {Ryabko, Andriy V. and Zaika, Oksana V. and Kukharchuk, Roman P. and Vakaliuk, Tetiana A.},
  title = {Graph theory methods for fog computing: A pseudo-random task graph model for evaluating mobile cloud, fog and edge computing systems},
  journal = {Journal of Edge Computing},
  year = {2022},
  doi = {10.55056/jec.569}
}
Kostenlos starten →