A Profitable and Energy-Efficient Cooperative Fog Solution for IoT Services
Bibliographic record
Abstract
Fog-to-fog communication has been introduced to deliver services to clients with minimal reliance on the cloud through resource and capability sharing of cooperative fogs. Current solutions assume full cooperation among the fogs to deliver simple and composite services. Realistically, each fog might belong to a different network operator or service provider and thus will not participate in any form of collaboration unless self-monetary profit is incurred. In this paper, we introduce a fog collaboration approach for simple and complex multimedia service delivery to cloud subscribers while achieving shared profit gains for the cooperating fogs. The proposed work dynamically creates short-term service-level agreements (SLAs) offered to cloud subscribers for service delivery while maximizing user satisfaction and fog profit gains. The solution provides a learning mechanism that relies on online and offline simulation results to build guaranteed workflows for new service requests. The configuration parameters of the short-term SLAs are obtained using a modified tabu-based search mechanism that uses previous solutions when selecting new optimal choices. Performance evaluation results demonstrate significant gains in terms of service delivery success rate, service quality, reduced power consumption for fog and cloud datacenters, and increased fog profits.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 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.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".