MétaCan
Menu
Back to cohort

Fair Connectivity-Oriented Allocation for Combined Resources in VCC Networks

2022· article· en· W4312936628 on OpenAlexafffund
Binal Tejani, Robson E. De Grande

Bibliographic record

Venue2022 IEEE Symposium on Computers and Communications (ISCC) · 2022
Typearticle
Languageen
FieldComputer Science
TopicBlockchain Technology Applications and Security
Canadian institutionsBrock University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceResource allocationPruningCloud computingOverhead (engineering)Resource management (computing)Service (business)Game theoryResource (disambiguation)Distributed computingComputer network

Abstract

fetched live from OpenAlex

The allocation and management of vehicular resources are essential in enabling services in Vehicular Cloud networks. Combined Resource Units (CRUs) allow for relaxed resource management by utilizing vehicular resources clustered in virtualized units and easing the fulfillment of service requests. Previous works have used mobility-based models such as SMDP and MDP for resource allocation. However, these models have presented significant system overhead, which has impacted the network's performance. Therefore, this work proposes a game theory model for assigning CRUs to satisfy service requests. The utility function of CRUs is maximized by playing a non-cooperative game between service requests. Two different game models are implemented based on exhaustive search and pruning methods. These models use distinct utility functions, which differ in terms of distance and signal strength of the CRUs. Comparing the performance of the two models, the pruning model offers a 90% success rate towards satisfying service requests.

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 categoriesScience and technology studies
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.924
Threshold uncertainty score1.000

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.0010.000
Scholarly communication0.0000.000
Open science0.0020.001
Research integrity0.0000.001
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.011
GPT teacher head0.234
Teacher spread0.223 · 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.

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

Citations0
Published2022
Admission routes2
Has abstractyes

Explore more

Same venue2022 IEEE Symposium on Computers and Communications (ISCC)Same topicBlockchain Technology Applications and SecurityFrench-language works237,207