Using Modified Floyd-Warshall Algorithm to Implement SPB IEEE 802.1aq Protocol Simulator on NS-3
Bibliographic record
Abstract
Ethernet has evolved to support various network topologies while maintaining its backward compatibility and simplicity.Virtualization of the provider's Ethernet network enables support for finegrained services for different users.Spanning Tree Protocol (STP) meets these properties but, still could benefit from improvements on utilization and convergence time.Shortest Path Bridging (SPB, IEEE 802.1aq) has been developed to overcome the shortcomings of STP.This paper presents the design and implementation of an SPB simulator for NS-3.The modified version of Floyd-Warshall algorithm is used to compute routes.Multicast and unicast communications are simulated in SPBM (SPB Mac-in-Mac) mode to show the simulator's capability.The results prove that the communication maintains the crucial property of SPB; congruency between multicast and unicast, and symmetry between forward and backward paths.The traffic route selected among candidate paths with the same cost is in accordance with the SPB standard.The contribution of this work is a powerful simulator that can be used to conduct experiments without the usual cost attached to the physical implementation.
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.001 | 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.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".