Fog computing in multi-tier data center networks: A hierarchical game approach
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
With the increasing popularity of data services and applications, data center networks have been introduced to serve users in a centralized fashion. Furthermore, the flexibility of the data service subscribers' (DSSs') requirements motivates data center virtualization so as to optimize the resource allocation among all DSSs. However, as the massive data centers are usually far away from the DSSs, the quality of services are severely affected for delay-sensitive DSSs. Accordingly, fog computing is considered to solve the problem, where some virtualized edge data centers acting as fog nodes (FNs) are added in the network and help massive data center operators (MDCOs) serve DSSs. In this paper, we analyze the resource management problem in the multi-FN multi-MDCO, and multi-DSS networks. We model the network architecture with 3-layer model, where the FNs are in the upper layer, MDCOs in the middle layer, the DSSs in the bottom layer. The FNs first share computing resource with the MDCOs, and thus the MDCOs are able to serve their DSSs with low delay. Based on the model, we propose a hierarchical game, where the interaction between FNSs and MDCOs is regarded as a multi-leader multi-follower Stackelberg game, and the interactions between MDCOs and DSSs are regarded as the single-leader single-follower Stackelberg games. By making decisions distributively, all FNs, MDCOs, and DSSs receive high utilities. Simulation results show the correctness of the analysis and the performance improvement of the proposed strategies in the fog computing networks.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.003 | 0.005 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it