Dataplane-Based Fast Failover in SDN-Enabled Wide Area Measurement System of Smart Grid
Bibliographic record
Abstract
In the wide area measurement system (WAMS) of smart grid, the real-time monitoring and protection applications have stringent requirements for the end-to-end transmission delays between phasor measurement units and phasor data concentrator, and fast failover (FF) is required to ensure the communication performance after link failures. In this work, the software-defined network (SDN) technology is utilized to enable datapath failover upon a link failure with a global view of the communication network. Then, a novel dataplane-based fast failover (DFF) mechanism is proposed todirectlyreroute the data packet in dataplane without interacting with the SDN controller. Based on the mathematical analysis over the WAMS topology features, the proposed DFF optimizes two procedures of failover: backup path construction and backup path installation. Using the proposed backup path construction algorithms, the 3-approximate and (1+2$\varepsilon$)-approximate ($0< \varepsilon < 1$) backup paths can be constructed, theoretically guaranteeing the data transmission delays bothduringandafterfailover. Using the proposed LinkID-based FF group table installation method, the conflict of forwarding rules between original and backup paths can be eliminated, while the storage cost is also optimized. The simulation results on six IEEE benchmark test power systems show that the proposed DFF mechanism could achieve lower data transmission delays during and after failover compared with the existing control plane based and dataplane-based failover mechanisms.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".