MétaCan
Menu
Back to cohort
Record W1739627315

VCG auction-based approach for efficient Virtual Network embedding

2013· article· en· W1739627315 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIntegrated Network Management · 2013
Typearticle
Languageen
FieldComputer Science
TopicSoftware-Defined Networks and 5G
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceEmbeddingProfit (economics)Computer networkVirtual networkReverse auctionNode (physics)Distributed computingCommon value auctionMicroeconomicsArtificial intelligenceEconomics
DOInot available

Abstract

fetched live from OpenAlex

In this paper, our focus is on the embedding problem which consists on the mapping of Virtual Network (VN) resources onto physical network. In literature, number of approaches have been proposed for embedding problem where the following limitations can be noticed: (i) mapping of VN links and nodes is performed on two separate stages, which may ensue in a high blocking of VN requests, and (ii) pricing of resources are based on linear functions, accordingly there is no competition among VN users resulting in reduced profit for the Physical Infrastructure Provider (PIP). To address these concerns, we propose deploying a periodical one-shot node and link embedding approach that increases the PIP profit's and VN users satisfaction ratio by allocating resources based on auction mechanism. Experiments on large mix of VN requests show a clear advantage of auctioning based models over benchmarks in terms of PIP profit's, VN users acceptance ratio and resources utilization.

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 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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.379
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.002
Science and technology studies0.0010.000
Scholarly communication0.0010.000
Open science0.0010.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.011
GPT teacher head0.224
Teacher spread0.212 · 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