Fast Path Recovery for Single Link Failure in SDN-Enabled Wide Area Measurement System
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.
Bibliographic record
Abstract
In the wide area measurement system (WAMS), the end-to-end transmission delay between the phasor measurement unit (PMU) and phasor data concentrator (PDC) is strictly constrained for real-time monitoring and protection applications. When a communication link failure happens, fast path recovery is required to reduce the impact of measurement losses. In this work, the promising software-defined network (SDN) technique is leveraged to compute the re-routing path in a global view upon a single link failure. More specifically, a hybrid fast path recovery algorithm (HFPR-A) is proposed based on the principle of simplicity: in some cases, the shortest path or approximate shortest path between PMU and PDC can be recovered by <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">adding only one edge</i> to the original forwarding tree; while in the other cases, the shortest paths can be recovered with <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">lower computational complexity</i> than the traditional Dijkstra’s algorithm. The proposed HFPR-A is implemented on the Ryu + Mininet testbed, and the simulation results on different IEEE benchmark test power systems show that the proposed HFPR-A could find shorter re-routing paths than the existing methods with a low-enough response time.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it