MétaCan
Menu
Back to cohort
Record W2047453076 · doi:10.1109/glocom.2011.6133662

End-to-End Queueing Performance Evaluation for Multiuser Wireless Relay Networks

2011· article· en· W2047453076 on OpenAlexaff
M. Moghaddari, Yalda Farazmand, Ekram Hossain

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsComputer scienceRelayComputer networkQueueing theoryRelay channelAutomatic repeat requestThroughputNetwork packetWireless networkBase stationWirelessReal-time computingHybrid automatic repeat requestTelecommunications linkTelecommunications

Abstract

fetched live from OpenAlex

An analytical framework for the link-level end-to-end (e2e) queueing performance evaluation in a multiuser wireless relay network with automatic repeat request (ARQ)-based error control is presented. The e2e system consisting of a base station, a relay station, and multiple users is modeled as a probabilistic tandem of two finite queues for the relay and each user. The transmissions from the users are scheduled in a time-division multiplexing (TDM) fashion, i.e., in each time-slot only one user is in tandem with the relay's buffer with a certain probability. To make the analysis of such system tractable, the finite buffer of the relay is decomposed into smaller non-overlapping portions, each corresponding to an individual user's packets (i.e., per-user queueing). Using the decomposed model, radio link-level performance measures such as e2e packet loss rate, e2e delay and throughput are obtained analytically and compared with simulation results. As an application of this model, a method of obtaining optimum values for selection probabilities to maximize e2e aggregate throughput subject to users' individual delay constraints is presented.

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.004
metaresearch head score (Gemma)0.010
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.004
Threshold uncertainty score0.023

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.010
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.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.103
GPT teacher head0.306
Teacher spread0.203 · 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

Citations3
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207