A Measurement Study of Network Coding in Peer-to-Peer Video-on-Demand Systems
Bibliographic record
Abstract
In recent years, Peer-to-Peer (P2P) multimedia streaming has become an alternative to cable/satellite TV services. Many P2P streaming applications further provide users with DVD-like operations: play, pause, chapter selection, fast-forward, and rewind. Such a real-time interactive multimedia streaming is commonly referred to as the P2P Video-on-Demand (VoD). To further improve the streaming quality, recent research employs network coding as the key enabling technology. However, the practicality and implementation challenges of network coding received very little attention. In this paper, we present a practical implementation of network coding in a P2P VoD system, VoD+NC, based on which we conduct a measurement study on the actual performance gain provided by network coding. In the meantime, we identify design pitfalls when incorporating network coding into a P2P VoD system. Our study shows that, unlike P2P live streaming, directly applying network coding to a P2P VoD system does not necessarily lead to an immediate improvement in playback quality. With the proper configuration, network coding not only brings the same benefits as it does in P2P live streaming, but also better accommodates the asymmetric interests among peers and simplifies the neighbourhood management.
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.004 | 0.037 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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 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".