Improving the reliability of the label distribution protocol
Bibliographic record
Abstract
The LDP (label distribution protocol) is used in the control plane to control an optical network. The data plane and the control plane of an optical network could be physically separate. So a failure in the control plane does not necessarily imply a data plane failure and that user communications have to be interrupted. The standard LDP, however, does not provide any mechanism to recover the knowledge stored in LDP entities about the status of the data plane after the faults are fixed. This is a reliability problem of LDP and results in the unnecessary degradation of user communications. On the other hand, in MPLS-enabled IP networks, being able to recover LDP sessions would be potentially faster and more scalable than to re-establish all affected LSPs. The proposed recovery method of LDP for the control plane failures uses label information mirrors (LIMs) in upstream downstream label switching routers (LSRs). Each LIM is a copy of the label information database (LID) in the LSR of an LDP session. We propose a systematic approach to synchronize the contents of a LIM and the corresponding LID, and show how a LIM is used to handle a control plane failure. Detailed descriptions of the recovery procedure for both control channel failures and control node failures are presented. Some significant features of the proposal are outlined.
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.006 | 0.026 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.005 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".