MétaCan
Menu
Back to cohort
Record W2989643311 · doi:10.1109/mnet.001.1900333

SDATP: An SDN-Based Adaptive Transmission Protocol for Time-Critical Services

2019· article· en· W2989643311 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

VenueIEEE Network · 2019
Typearticle
Languageen
FieldComputer Science
TopicCaching and Content Delivery
Canadian institutionsHuawei Technologies (Canada)University of Waterloo
Fundersnot available
KeywordsComputer scienceComputer networkRetransmissionDistributed computingQuality of serviceNetwork packetNetwork congestionLatency (audio)Packet loss

Abstract

fetched live from OpenAlex

In this article, a comprehensive approach is proposed for 5G communication networks. In SDATP, a slice-level customized protocol is developed for supporting time-critical services that require high reliability and low-latency, such as MTC services for industrial automation. To satisfy service quality requirements for an MTC service, we introduce in-network intelligence in the proposed protocol, by enabling the functionalities of in-path caching, in-path retransmission, in-network congestion detection and congestion control. To minimize the E2E delay, we optimize the configuration of caching functionalities, including the number of enabled caching nodes, caching node placement, and probabilistic packet caching policy. Since the optimization problem is NP-hard, we simplify the problem by reducing the number of decision variables and propose a low-complexity algorithm to solve the simplified problem. Extensive simulation results are presented to validate the effectiveness of the proposed algorithm in terms of retransmission hops and its adaptiveness to network dynamics.

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.000
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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.785
Threshold uncertainty score0.530

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.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.022
GPT teacher head0.284
Teacher spread0.262 · 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