CoChat

Steiner tree based optimal resource caching scheme in fog computing

Su, Jingtao, Lin, Fuhong, Zhou, Xianwei, Lu, Xing · 2015 · China Communications

The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.

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

Crossref · 10.1109/cc.2015.7224698

Cites

10 of 10 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 10 references

Cited by

Items 101–133 of 133

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

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.