MétaCan
Menu
Back to cohort
Record W2061128065 · doi:10.1109/icc.2010.5501754

Cross-Layer Design for TCP Throughput Optimization in Cooperative Relaying Networks

2010· article· en· W2061128065 on OpenAlexaff
Yifei Wei, F. Richard Yu, Meina Song, Yan Zhang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsCarleton University
Fundersnot available
KeywordsComputer scienceThroughputRetransmissionComputer networkRelayTransmission Control ProtocolNetwork packetPhysical layerLink layerWirelessTelecommunications

Abstract

fetched live from OpenAlex

In this paper, we investigate the transmission control protocol (TCP) throughput in cooperative relaying networks and take an cross-layer design approach when selecting a relay to optimize the TCP throughput. A first-order finite-sate Markov channel (FSMC) is used to model the wireless time varying channels, and the TCP throughput is estimated as a function of physical layer signal-to-noise ratio (SNR) and link-layer frame size and retransmission times. Since relay selection is crucial in improving the TCP performance, we proposed a stochastic decision making approach to select the optimal relay for every TCP packet according to the states of each relay. We formulated the cross-layer TCP throughput optimization problem as a restless bandit system and obtained the statistically optimal relay selection policy, which has an indexability property and can be easily implemented in real system. We compare the proposed scheme through simulations under different parameters of physical layer and link-layer, simulation results show that the TCP throughput can be improved significantly by the optimal relay selection scheme.

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 imitation

Not 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.

metaresearch head score (Codex)0.005
metaresearch head score (Gemma)0.007
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.025

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.007
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.071
GPT teacher head0.334
Teacher spread0.263 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
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

Citations7
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207