An online secretary framework for fog network formation with minimal latency
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Fog computing is seen as a promising approach to perform distributed, low-latency computation for supporting Internet of Things applications. However, due to the unpredictable arrival of available neighboring fog nodes, the dynamic formation of a fog network can be challenging. In essence, a given fog node must smartly select the set of neighboring fog nodes that can provide low-latency computations. In this paper, this problem of fog network formation and task distribution is studied considering a hybrid cloud-fog architecture. The goal of the proposed framework is to minimize the maximum computational latency by enabling a given fog node to form a suitable fog network, under uncertainty on the arrival process of neighboring fog nodes. To solve this problem, a novel approach based on the online secretary framework is proposed. To find the desired set of neighboring fog nodes, an online algorithm is developed to enable a task initiating fog node to decide on which other nodes can be used as part of its fog network, to offload computational tasks, without knowing any prior information on the future arrivals of those other nodes. Simulation results show that the proposed online algorithm can successfully select an optimal set of neighboring fog nodes while achieving a latency that is as small as the one resulting from an ideal, offline scheme that has complete knowledge of the system. The results also show how, using the proposed approach, the computational tasks can be properly distributed between the fog network and a remote cloud server.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fog and IoT: An Overview of Research Opportunities
Chiang, M., & Zhang, T. (2016) · IEEE Internet of Things Journal · doi:10.1109/jiot.2016.2584538 · Cited by 2,362
Cited by
All one needs to know about fog computing and related edge computing paradigms: A complete survey
Yousefpour, A., Fung, C., Nguyen, T., Kadiyala, K., Jalali, F., Niakanlahiji, A., Kong, J., & Jue, J. P. (2019) · Journal of Systems Architecture · doi:10.1016/j.sysarc.2019.02.009 · Cited by 1,368
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
Dynamic Task Offloading and Resource Allocation for Ultra-Reliable Low-Latency Edge Computing
Liu, C.-F., Bennis, M., Debbah, M., & Poor, H. V. (2019) · IEEE Transactions on Communications · doi:10.1109/tcomm.2019.2898573 · Cited by 435
Self-citationAn Overview of Service Placement Problem in Fog and Edge Computing
Salaht, F. A., Desprez, F., & Lebre, A. (2021) · ACM Computing Surveys · doi:10.1145/3391196 · Cited by 336
Hierarchical Fog-Cloud Computing for IoT Systems: A Computation Offloading Game
Shah-Mansouri, H., & Wong, V. W. S. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2838022 · Cited by 322
Metadata
- Authors
- Lee, G., Saad, W., & Bennis, M.
- Venue
- 2017 IEEE International Conference on Communications (ICC)
- Publisher
- IEEE
- Published
- 2017-05
- Pages
- 1-6
- ISSN
- 1550-3607 (ISSN-L)
- OpenAlex
- W2594402205
- Cited by
- 78
- References
- 1
- FWCI
- 10.96
- Type
- conference paper
- Language
- en
- Open access
- green
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: An online secretary framework for fog network formation with minimal latency. https://app.cochat.ai/papers/10.1109/icc.2017.7996574
- The paper
- Lee, G., Saad, W., & Bennis, M. (2017). An online secretary framework for fog network formation with minimal latency. 2017 IEEE International Conference on Communications (ICC). https://doi.org/10.1109/icc.2017.7996574
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.