MétaCan
Menu
Back to cohort
Record W1965040534 · doi:10.1364/jon.6.000975

Demonstration of a time buffer for an all-optical packet router

2007· article· en· W1965040534 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

VenueJournal of Optical Networking · 2007
Typearticle
Languageen
FieldEngineering
TopicOptical Network Technologies
Canadian institutionsBell (Canada)
Fundersnot available
KeywordsRouterBuffer (optical fiber)Network packetOptical bufferWavelengthComputer scienceOptical switchElectronic engineeringComputer networkPacket switchingArrayed waveguide gratingWavelength-division multiplexingOptical performance monitoringMaterials scienceEngineeringOptoelectronicsTelecommunications

Abstract

fetched live from OpenAlex

We demonstrate an optical time buffer technology that meets the requirements of an all-optical packet router with a load-balancing architecture. The buffer is based on wavelength switching and an arrayed waveguide grating, which selects one of the delays in an array of fiber delay lines of increasing length. This buffer is unique because it enables the maximal sharing of delay lines among multiple input ports. Each of the N delays can simultaneously support N different wavelengths; therefore, for N input ports, the total buffer capacity is of the order of N3 packets. Measurements performed with data at 10 Gbits/s and N=3 show that there is only a 2 dB bit error rate (BER) penalty resulting from wavelength switching.

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.001
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.748
Threshold uncertainty score0.656

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.023
GPT teacher head0.266
Teacher spread0.243 · 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