MétaCan
Menu
Back to cohort
Record W2114201820 · doi:10.1109/hspr.2008.4734417

Parallel distributed lightpath control and management for survivable optical mesh networks

2008· article· en· W2114201820 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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Optical Network Technologies
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceComputer networkDistributed computingScalabilityMesh networkingNode (physics)Routing protocolResource Reservation ProtocolPath vector protocolProtocol (science)Blocking (statistics)BackupWireless mesh networkOptical mesh networkRouting (electronic design automation)Wireless Routing ProtocolInternet protocol suiteWireless networkWirelessThe InternetEngineeringTelecommunications

Abstract

fetched live from OpenAlex

This paper presents a novel distributed protocol for online provisioning in survivable mesh-based wavelength-division multiplexed (WDM) networks. This protocol examines each of the k link disjoint shortest paths as a candidate working path and as a candidate shared protection path at the same time, in parallel which gives the destination node the ability to apply an intelligent adaptive routing and wavelength assignment. Moreover, this protocol is the first distributed protocol can provision the working and the backup paths in parallel. We discuss in details a control and management techniques to set up and tear down connections and determine restoration capacity shareability in a distributed manner. Since only local information is maintained at each node, protocol scalability is guaranteed. The significant contribution of this protocol in terms of connection request blocking probability and connection setup time are discussed. We show through setup time analysis and simulation experiments the effectiveness of the proposed protocol.

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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.756
Threshold uncertainty score0.552

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.009
GPT teacher head0.204
Teacher spread0.195 · 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

Citations6
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Optical Network TechnologiesFrench-language works237,207