The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Steiner tree based optimal resource caching scheme in fog computing
Abstract
Fog Computing is a new platform that can serve mobile devices in the local area. In Fog Computing, the resources need to be shared or cached in the widely deployed Fog clusters. In this paper, we propose a Steiner tree based caching scheme, in which the Fog servers, when caching resources, first produce a Steiner tree to minimize the total path weight (or cost) such that the cost of resource caching using this tree could be minimized. Then we give a running illustration to show how the Fog Computing works and we compare the traditional shortest path scheme with the proposed one. The outcome shows that the Steiner tree based scheme could work more efficiently.
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
“FC has been claimed to be well suited for this purpose [174,175].”
From Edge AI: A survey (2023) · cites this paper as [175]
Citations
Cites
Fog computing and its role in the internet of things
Bonomi, F., Milito, R., Zhu, J., & Addepalli, S. (2012) · Proceedings of the first edition of the MCC workshop on Mobile cloud computing · doi:10.1145/2342509.2342513 · Cited by 6,244
Fog Computing: A Platform for Internet of Things and Analytics
Bonomi, F., Milito, R., Natarajan, P., & Zhu, J. (2014) · Studies in Computational Intelligence · doi:10.1007/978-3-319-05029-4_7 · Cited by 1,222
A fast algorithm for Steiner trees
Kou, L., Markowsky, G., & Berman, L. (1981) · Acta Informatica · doi:10.1007/bf00288961 · Cited by 1,188
Finding your Way in the Fog: Towards a Comprehensive Definition of Fog Computing
Vaquero, L. M., & Rodero-Merino, L. (2014) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2677046.2677052 · Cited by 1,066
The Fog Computing Paradigm: Scenarios and Security Issues
Stojmenovic, I., & Wen, S. (2014) · Annals of Computer Science and Information Systems · doi:10.15439/2014f503 · Cited by 1,037
Improving Web Sites Performance Using Edge Servers in Fog Computing Architecture
Zhu, J., Chan, D. S., Prabhu, M. S., Natarajan, P., Hu, H., & Bonomi, F. (2013) · 2013 IEEE Seventh International Symposium on Service-Oriented System Engineering · doi:10.1109/sose.2013.73 · Cited by 226
New Approximation Algorithms for the Steiner Tree Problems
Karpinski, M., & Zelikovsky, A. (1997) · Journal of Combinatorial Optimization · doi:10.1023/a:1009758919736 · Cited by 192
A series of approximation algorithms for the acyclic directed steiner tree problem
Zelikovsky, A. (1997) · Algorithmica · doi:10.1007/bf02523690 · Cited by 157
A Faster Algorithm for the Steiner Tree Problem
Mölle, D., Richter, S., & Rossmanith, P. (2006) · Lecture notes in computer science · doi:10.1007/11672142_46 · Cited by 75
The Euclidean Bottleneck Full Steiner Tree Problem
Abu-Affash, A. K. (2013) · Algorithmica · doi:10.1007/s00453-013-9788-x · Cited by 8
Cited by
Mobile edge computing, Fog et al.: A survey and analysis of security threats and challenges
Roman, R., Lopez, J., & Mambo, M. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2016.11.009 · Cited by 1,338
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
Survey 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
Fog Computing for Sustainable Smart Cities: A Survey
Perera, C., Qin, Y., Estrella, J. C., Reiff-Marganiec, S., & Vasilakos, A. V. (2018) · ACM Computing Surveys · doi:10.1145/3057266 · Cited by 459
Metadata
- Authors
- Su, J., Lin, F., Zhou, X., & Lu, X.
- Affiliations
- University of Science and Technology Beijing (CN)
- School of Science, Beijing Jiaotong University, Beijing, 100044, China
- Venue
- China Communications
- Published
- 2015-08
- Volume
- 12
- Issue
- 8
- Pages
- 161-168
- ISSN
- 1673-5447 (ISSN-L)
- OpenAlex
- W1678884566
- Cited by
- 113
- References
- 10
- Citations by year
- 2024: 1 · 2023: 5 · 2022: 7 · 2021: 5 · 2020: 53 · 2019: 10 · 2018: 17 · 2017: 11 · 2016: 4
- FWCI
- 12.20
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- China Communications (publishedVersion)
- 中国通信:英文版
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Caching and Content Delivery
- Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- Physical Sciences › Computer Science › Computer Networks and Communications › Software-Defined Networks and 5G
- Keywords
- fog computing, Steiner tree problem, fog servers, network cost reduction, shortest path comparison, mobile devices
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Steiner tree based optimal resource caching scheme in fog computing. https://app.cochat.ai/papers/10.1109/cc.2015.7224698
- The paper
- Su, J., Lin, F., Zhou, X., & Lu, X. (2015). Steiner tree based optimal resource caching scheme in fog computing. China Communications. https://doi.org/10.1109/cc.2015.7224698
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.