Latency-aware segmentation and trust system placement in smart grid SCADA networks
Bibliographic record
Abstract
This paper proposes a latency-aware trust system placement scheme for smart grid SCADA networks. Trust systems are specialized security devices that are deployed to provide cyber protection to supervisory control and data acquisition (SCADA) systems. Their functionalities include firewalling and intrusion detection. They are capable of monitoring both types of traffic, ingress and egress. Only a selected number of nodes are equipped with trust systems due to budgetary constraints. Those nodes are known as the trust nodes. As trust nodes are responsible for distributing time critical messages, it is important to consider the impact of latency in the selection of trust nodes. Network segmentation is a commonly used way of trust node computations. This paper proposes a latency-aware segmentation approach that exploits the graph theoretic properties of minimum spanning trees (MSTs). Numerical results are obtained through case studies for the IEEE BUS 118 test system topology. The results reveal that the proposed scheme is capable of reducing the impact of latency.
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 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.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".