Fog computing dynamic load balancing mechanism based on graph repartitioning
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Because of cloud computing's high degree of polymerization calculation mode, it can't give full play to the resources of the edge device such as computing, storage, etc. Fog computing can improve the resource utilization efficiency of the edge device, and solve the problem about service computing of the delay-sensitive applications. This paper researches on the framework of the fog computing, and adopts Cloud Atomization Technology to turn physical nodes in different levels into virtual machine nodes. On this basis, this paper uses the graph partitioning theory to build the fog computing's load balancing algorithm based on dynamic graph partitioning. The simulation results show that the framework of the fog computing after Cloud Atomization can build the system network flexibly, and dynamic load balancing mechanism can effectively configure system resources as well as reducing the consumption of node migration brought by system changes.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Central to resource management are dynamic load balancing [166] and developing resource allocation platforms [16].”
From Edge AI: A survey (2023) · cites this paper as [166]
Citations
Cites
Armbrust, M., Fox, A., Griffith, R., Joseph, A. D., Katz, R., Konwinski, A., Lee, G., Patterson, D., Rabkin, A., Stoica, I., et al. (2010) · Communications of the ACM · doi:10.1145/1721654.1721672 · Cited by 9,464
(2011) · Cited by 5,203
Cited by
A Comprehensive Survey on Fog Computing: State-of-the-Art and Research Challenges
Mouradian, C., Naboulsi, D., Yangui, S., Glitho, R. H., Morrow, M. J., & Polakos, P. A. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2771153 · Cited by 1,022
“From a similar perspective, Ningning et al. [93] propose a dynamic load balancing algorithm in the fog stratum.”
BackgroundSurvey of Fog Computing: Fundamental, Network Applications, and Research Challenges
Mukherjee, M., Shu, L., & Wang, D. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2814571 · Cited by 684
Singh, R., & Gill, S. S. (2023) · Internet of Things and Cyber-Physical Systems · doi:10.1016/j.iotcps.2023.02.004 · Cited by 572
Resource Management in Fog/Edge Computing: A Survey on Architectures, Infrastructure, and Algorithms
Hong, C.-H., & Varghese, B. (2020) · ACM Computing Surveys · doi:10.1145/3326066 · Cited by 461
Task Offloading in Vehicular Edge Computing Networks: A Load-Balancing Solution
Zhang, J., Guo, H., Liu, J., & Zhang, Y. (2020) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2019.2959410 · Cited by 421
Metadata
- Authors
- Ningning, S., Chao, G., Xingshuo, A., & Qiang, Z.
- Affiliations
- University of Science and Technology Beijing (CN)
- School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing China
- Venue
- China Communications
- Published
- 2016-03
- Volume
- 13
- Issue
- 3
- Pages
- 156-164
- ISSN
- 1673-5447 (ISSN-L)
- OpenAlex
- W2331637764
- Cited by
- 188
- References
- 2
- Citations by year
- 2026: 3 · 2025: 7 · 2024: 10 · 2023: 19 · 2022: 25 · 2021: 33 · 2020: 28 · 2019: 32 · 2018: 20 · 2017: 11
- FWCI
- 19.81
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- China Communications (publishedVersion)
- 中国通信:英文版
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- Physical Sciences › Computer Science › Information Systems › Cloud Computing and Resource Management
- Physical Sciences › Computer Science › Hardware and Architecture › Energy Efficiency in Computing
- Keywords
- fog computing, dynamic load balancing, graph partitioning, delay-sensitive applications, node migration
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.