MétaCan
Menu
Back to cohort
Record W2006179939 · doi:10.1109/iscc.2012.6249383

Flow-based routing architecture for Valiant Load-Balanced networks

2012· article· en· W2006179939 on OpenAlexaff
Imad Khazali, Anjali Agarwal

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Optical Network Technologies
Canadian institutionsConcordia University
Fundersnot available
KeywordsComputer scienceComputer networkNetwork packetLoad balancing (electrical power)The InternetIP forwardingDistributed computingIdentifierStateless protocolRouting (electronic design automation)Network architectureArchitectureSource routingRouting protocolRouting tableOperating systemMathematics

Abstract

fetched live from OpenAlex

A novel routing architecture that balances incoming Internet flows over the Valiant Load-Balanced (VLB) networks is proposed. The architecture is based on the adaptive highest random weight (Adaptive HRW) algorithm proposed to design load balanced Internet routers. To reduce flow remapping, the architecture extends the adaptive HRW algorithm with a minimal flow remapping selection scheme that identifies the traffic causing imbalance in the network and needs to be rerouted, where rerouting is implemented by adapting the weight vectors associated with the traffic. Compared to the adaptive HRW method, the selection scheme further reduces flow remapping and the effect of packets reordering. The architecture is stateless and can compute routes quickly based on the packet flow identifier. This is important when deploying the VLB network as a backbone network where the number of flows is large and storing flow state information in lookup tables could limit the network performance.

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 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.626
Threshold uncertainty score0.655

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.010
GPT teacher head0.224
Teacher spread0.214 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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

Citations1
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Optical Network TechnologiesFrench-language works237,207