MétaCan
Menu
Back to cohort
Record W2113811475 · doi:10.1109/ccece.2008.4564803

A novel distributed availability-aware provisioning framework for differentiated protection services in optical mesh networks

2008· article· en· W2113811475 on OpenAlex
Emad M. Al Sukhni, Hussein T. Mouftah

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.
venuePublished in a venue whose home country is Canada.

Bibliographic record

VenueConference proceedings - Canadian Conference on Electrical and Computer Engineering · 2008
Typearticle
Languageen
FieldEngineering
TopicAdvanced Optical Network Technologies
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsProvisioningComputer scienceComputer networkOptical mesh networkDistributed computingMesh networkingPath (computing)Metric (unit)Protection mechanismScheme (mathematics)Wavelength-division multiplexingPath protectionRouting (electronic design automation)Network topologyWireless mesh networkTelecommunicationsEngineeringWavelength

Abstract

fetched live from OpenAlex

In optical WDM mesh networks, different protection schemes can be used to satisfy the service availability against network failures. However, in order to satisfy a connectionpsilas service-availability requirement in a distributed controlled WDM networks with no wavelength converters, we need a mechanism to select a proper protection scheme for each connection request while provisioning the connection. In this paper, we propose to use connection availability as a metric for providing differentiated protection services in WDM mesh networks. In the case of shared-protection, we propose a novel distributed parallel provisioning framework based on fixed alternative routing to select the connectionpsilas working and protection paths as well as the wavelength(s) at the same time by probing the k most reliable paths in parallel. The probing technique used in this framework is the first probing technique that probes each path as both a candidate working path and a candidate shared protection path at the same time. Based on the availability information collected, our provisioning strategy assigns an appropriate level of protection to each connection. The effectiveness of our provisioning approaches is demonstrated through simulation results.

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 categoriesMeta-epidemiology (narrow)
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.821
Threshold uncertainty score1.000

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.001
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.015
GPT teacher head0.196
Teacher spread0.181 · 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