MétaCan
Menu
Back to cohort
Record W2133630653 · doi:10.1109/ccgrid.2004.1336572

GTP: group transport protocol for lambda-grids

2004· article· en· W2133630653 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.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsnot available
FundersCanarieNational Science Foundation
KeywordsComputer networkComputer scienceBandwidth (computing)Wavelength-division multiplexingDistributed computingMultiplexingGTP'Transfer (computing)ThroughputProtocol (science)WirelessTelecommunicationsWavelengthPhysics

Abstract

fetched live from OpenAlex

The notion of lambda-Grids posits plentiful collections of computing and storage resources richly interconnected by dedicated dense wavelength division multiplexing (DWDM) optical paths. In lambda-Grids, the DWDM links form a network with plentiful bandwidth, pushing contention and sharing bottlenecks to the end systems (or their network links) and motivating the group transport protocol (GTP). GTP features a request-response data transfer model, rate-based explicit flow control, and more importantly, receiver-centric max-min fair rate allocation across multiple flows to support multipoint-to-point data movement. Our studies show that GTP performs as well as other UDP based aggressive transport protocols (e.g. RBUDP, SABUL) for single flows, and when converging flows (from multiple senders to one receiver) are introduced, GTP achieves both high throughput and much lower loss rates than others. This superior performance is due to new techniques in GTP for managing end system contention.

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: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.847
Threshold uncertainty score0.366

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.0000.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.017
GPT teacher head0.267
Teacher spread0.250 · 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

Quick stats

Citations45
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicNetwork Traffic and Congestion ControlFrench-language works237,207