A Market-Based Framework for Multi-Resource Allocation in Fog Computing
The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
Fog computing is transforming the network edge into an intelligent platform by bringing storage, computing, control, and networking functions closer to end users, things, and sensors. How to allocate multiple resource types (e.g., CPU, memory, bandwidth) of capacity-limited heterogeneous fog nodes to competing services with diverse requirements and preferences in a fair and efficient manner is a challenging task. To this end, we propose a novel market-based resource allocation framework in which the services act as buyers and fog resources act as divisible goods in the market. The proposed framework aims to compute a market equilibrium (ME) solution at which every service obtains its favorite resource bundle under the budget constraint, while the system achieves high resource utilization. This paper extends the general equilibrium literature by considering a practical case of satiated utility functions. In addition, we introduce the notions of non-wastefulness and frugality for equilibrium selection and rigorously demonstrate that all the non-wasteful and frugal ME are the optimal solutions to a convex program. Furthermore, the proposed equilibrium is shown to possess salient fairness properties, including envy-freeness, sharing-incentive, and proportionality. Another major contribution of this paper is to develop a privacy-preserving distributed algorithm, which is of independent interest, for computing an ME while allowing market participants to obfuscate their private information. Finally, extensive performance evaluation is conducted to verify our theoretical analyses.
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
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806 · cited 2×
“Another approach to enable data privacy is to employ cryptographic techniques such as Garble Circuit (GC) [23] and Fully Homomorphic Encryption (HE) [28], which are often used in secure multi-party computation [24].”
BackgroundMethodA Survey on Mobile Edge Computing: The Communication Perspective
Mao, Y., You, C., Zhang, J., Huang, K., & Letaief, K. B. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2745201 · Cited by 5,607 · cited 2×
“Another major line of research considers the joint allocation of communication and computational resources for task offloading in wireless networks [2].”
BackgroundThe Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2014) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000042 · Cited by 5,557
The Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2013) · doi:10.1561/9781601988195 · Cited by 3,856
Protocols for secure computations
Yao, A. C. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.38 · Cited by 3,306
Protocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,696
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 2×
“, edge clouds, micro data centers in campus buildings, enterprises, hospitals, malls, and telecom central offices, servers at base stations, and idle PCs in research labs) [1]–[3].”
BackgroundA tutorial on decomposition methods for network utility maximization
Palomar, D. P., & Chiang, M. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879350 · Cited by 1,647 · cited 2×
“Finally, although numerous distributed optimization techniques [13], [14], [25]–[27] are available in the literature, most of them require agents to exchange and reveal their estimates explicitly to neighboring agents in every iteration to reach consensus on the final optimal solution.”
BackgroundMethod
Cited by
AI-based fog and edge computing: A systematic review, taxonomy and future directions
Iftikhar, S., Gill, S. S., Song, C., Xu, M., Aslanpour, M. S., Toosi, A. N., Du, J., Wu, H., Ghosh, S., Chowdhury, D., et al. (2023) · Internet of Things · doi:10.1016/j.iot.2022.100674 · Cited by 260
Fog computing: a taxonomy, systematic review, current trends and research challenges
Singh, J., Singh, P., & Gill, S. S. (2021) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2021.06.005 · Cited by 154
Alsadie, D. (2024) · IEEE Access · doi:10.1109/access.2024.3447097 · Cited by 81
Energy Efficient and Multi-resource Optimization for Virtual Machine Placement by Improving MOEA/D
Wei, W., Gu, H., Xiao, Z., & Chen, Y. (2025) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2025.3538525 · Cited by 15
“Duong et al. [33] introduced the concept of balanced selection of non-waste and frugality to meet the multidimensional resource requirements of services under budget constraints and maximize resource utilization efficiency.”
Metadata
- Authors
- Nguyen, D. T., Le, L. B., & Bhargava, V. K.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2019-06
- Volume
- 27
- Issue
- 3
- Pages
- 1151-1164
- ISSN
- 1063-6692 (ISSN-L)
- 1558-2566
- OpenAlex
- W2883077902
- Cited by
- 78
- References
- 8
- FWCI
- 4.96
- Type
- journal article
- Language
- en
- Open access
- closed
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: A Market-Based Framework for Multi-Resource Allocation in Fog Computing. https://app.cochat.ai/papers/10.1109/tnet.2019.2912077
- The paper
- Nguyen, D. T., Le, L. B., & Bhargava, V. K. (2019). A Market-Based Framework for Multi-Resource Allocation in Fog Computing. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/tnet.2019.2912077
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.