BlockQoS: Fair Monetization of On-demand Quality-of-Service using Blockchains
Bibliographic record
Abstract
Video conferencing has become an essential tool for working from home. However, poor audio/video quality resulting from unstable Internet connections undermines the productivity of important tasks. Additionally, the static monetization model for ISP networks, which employs third parties, cannot support on-demand and dynamic Quality-of-Service sessions that are necessary to maximize the Quality-of-Experience (QoE) of video conferencing. To address this, we introduce BlockQoS: Fair Monetization of On-Demand Quality-of-Service using Blockchains. BlockQoS allows clients to request and manage their Quality-of-Service requirements through a blockchain-based platform operating using a smart contract. It implements a decentralized monetization model to eliminate third parties, enforce transparency in service-level agreements (SLAs), and reduce blockchain operating costs by utilizing off-chain billing validated using zero-knowledge proofs (zk-SNARK). Additionally, we propose a Quality-of-Service delivery verification mechanism that enforces service level agreements on the hardware external to the blockchain, and a dynamic evaluation method based on the concept of Nash equilibrium in game theory that prevents malicious behavior by ISPs and users. We implemented BlockQoS over Ethereum with a Ryu controller, zk-SNARK, and SGX. Our experiments show that BlockQoS offers transaction cost reduction of up to 88% (gas cost) and latency reduction of up to 87% compared to the state-of-the-art on-chain solutions.
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.004 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.002 | 0.004 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.008 | 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".