COVID-19 Networking Demand: An Auction-Based Mechanism for Automated Selection of Edge Computing Services
Bibliographic record
Abstract
Network and cloud service providers are facing an unprecedented challenge to meet the demand of end-users during the COVID-19 pandemic. Currently, billions of people around the world are ordered to stay at home and use remote connection technologies to prevent the spread of the disease. The COVID-19 crisis brought a new reality to network service providers that will eventually accelerate the deployment of edge computing resources to attract the massive influx of users' traffic. The user can elect to procure its resource needs from any edge computing provider based on a variety of attributes such as price and quality. The main challenge for the user is how to choose between the price and multiple quality of service deals when such offerings are changing continually. This problem falls under multi-attribute decision-making. This paper investigates and proposes a novel auction mechanism by which network service brokers would be able to automate the selection of edge computing offers to support their end-users. We also propose a multi-attribute decision-making model that allows the broker to maximize its utility when several bids from edge-network providers are present. The evaluation and experimentation show the practicality and robustness of the proposed model.
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.009 | 0.012 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.004 |
| Open science | 0.005 | 0.003 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.006 | 0.001 |
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".