The protected working capacity envelope concept: an alternate paradigm for automated service provisioning
Bibliographic record
Abstract
At present we see only one basic approach being considered by implementors and standards organizations for provisioning of dynamic protected lightpath services that make efficient use of shared protection capacity. This is the paradigm of a primary working path protected end-to-end by a disjoint backup path using shared spare capacity. Sharing is arranged among the backup paths associated with other primary paths that are failure-disjoint from the current primary path. This approach called shared backup path protection (SBPP) has many advantages but also provides a great deal of network state information to be available and current in every node. It also makes the arrangement of protection a per-connection task, rather than user-selectable service option supported by the network itself. We propose an alternative paradigm for consideration, partly summed up as provisioning over protected capacity rather than provisioning protection. Under a given distribution of spare capacity, locally acting protection or restoration schemes create an "envelope" of protected working channels. Dynamic provisioning within this envelope is simplified to a shortest path routing problem and (depending on the mode of operation) requires little or no dissemination of state changes on a per-connection basis. We explain how existing "static" capacity design methods can be adopted to the dimensioning of such a working capacity envelope and the envelope dimensions further adapted online to track evolution of the overall pattern of random demand. An important property is that nothing needs to be done to arrange protection for services on the per-connection timescale other than routing the service itself. Arbitrarily fast-paced demand arrivals and departures can be accommodated within a static distribution of spare capacity. Adjustments to the envelope itself are required only on the timescale on which the statistical parameters of the random demand changes. This may provide an inherently more scalable, less database-dependent, and higher-availability alternative than SBPP, or at least an additional service modality that can be offered to customers.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.004 |
| Scholarly communication | 0.005 | 0.009 |
| Open science | 0.004 | 0.003 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".