Investigation on software‐defined networks’ reactive routing against BitTorrent
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
Technologies in software‐defined networks (SDNs) introduce programmatic ways to reorganise the network logical topology. A possible practical usage of SDNs is reactive routing, where the logical topology is continuously evolving based on traffic statistics and policies. Usually, the SDNs controllers are considered transparent to the higher layers. It is expected that changes in logical topology may not affect applications. The goal is to study the impact of logical topology changes on BitTorrent, a popular peer‐to‐peer protocol in practice. This study focuses on BitTorrent, and the experimental results show that BitTorrent may produce the opposite effect to the one expected. The authors have run 32 BitTorrent clients in an emulated SDN ring topology and changed the virtual topology periodically by removing one link at the time from the ring. The experiments produced lower propagation when logical topology changed periodically than when it was static for BitTorrent traffic. For comparison, the same experiments were recreated using HTTP. For HTTP, slower propagation is obtained when logical topology changed than when it was static. Finally, the results are discussed and it has been concluded that high layer protocols need to be carefully studied, and in some cases adapted, before being deployed in SDNs.
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.001 | 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