A graph theoretical approach to traffic engineering and network control problem
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
This paper looks at the problem of traffic engineering and network control from a new perspective. A graph-theoretical metric, betweenness, in combination with a network weight matrix is used to characterize the robustness of a network. Theoretical results lead to a definition of ”criticality” for nodes and links. It is shown that this quantity is a global network quantity and depends on the weight matrix of the graph. Strict convexity of network criticality is proved and an optimization problem is solved to minimize the network criticality as a function of weight matrix which in turn provides maximum robustness. Investigation of the condition of optimality suggests directions to design appropriate control laws and traffic engineering methods to robustly assign traffic flows. The choice of the path for routing the flow in these traffic engineering methods is in the direction of preserving the robustness of the network to the unforeseen changes in topology and traffic demands. The proposed method is useful in situations like MPLS and Ethernet networks where path assignment is required.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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