MétaCan
Menu
Back to cohort
Record W4382894810 · doi:10.1002/cpe.7858

A fairness‐aware task offloading method in edge‐enabled IIoT with multi‐constraints using AGE‐MOEA and weighted MMF

2023· article· en· W4382894810 on OpenAlexaff
Kai Peng, Chengfang Ling, Bohai Zhao, Victor C. M. Leung

Bibliographic record

VenueConcurrency and Computation Practice and Experience · 2023
Typearticle
Languageen
FieldComputer Science
TopicIoT and Edge/Fog Computing
Canadian institutionsUniversity of British Columbia
FundersQuanzhou City Science and Technology ProgramChina Postdoctoral Science FoundationNational Natural Science Foundation of ChinaFundamental Research Funds for the Central UniversitiesNational Science Foundation
KeywordsComputer scienceTask (project management)Quality of serviceLatency (audio)Industrial InternetDistributed computingInterconnectionPareto principleResource constraintsMathematical optimizationComputer networkInternet of ThingsComputer securityMathematics

Abstract

fetched live from OpenAlex

Summary By providing distributed and ultra‐low‐latency communication between industrial devices and resource components, the Industrial Internet of Things (IIoT) is at the forefront of a new trend. Such a distributed paradigm is viewed as a collection of autonomous computing resources utilized by multiple heterogeneous devices to achieve higher‐quality interconnection and data exchange. However, stringent requirements of exceptional service and fairness guarantees pose many formidable challenges. To this end, this study investigates the aforementioned concerns in an integrated manner and further proposes a fairness‐aware task offloading method, called FOIMAM. Specifically, the ‐norm is introduced to accommodate the Pareto plane under the non‐Euclidean geometry framework while the evaluation and elimination of low‐quality solutions are completed based on survival scores. Particularly, the fairness requirements are formulated as a multi‐constraint problem and resolved using weighted max‐min fairness. Eventually, numerical results indicate that the proposed method brings substantial improvement in both service efficiency and fairness guarantees.

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 distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.984
Threshold uncertainty score0.895

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.002
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.050
GPT teacher head0.365
Teacher spread0.315 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations4
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueConcurrency and Computation Practice and ExperienceSame topicIoT and Edge/Fog ComputingFrench-language works237,207