MétaCan
Menu
Back to cohort
Record W2128809037 · doi:10.1109/ccnc.2012.6181156

Reliable interactive video streaming in peer-to-peer networks

2012· article· en· W2128809037 on OpenAlexaff
Xiangyang Zhang, Glen Takahara, Hossam S. Hassanein

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicPeer-to-Peer Network Technologies
Canadian institutionsQueen's University
Fundersnot available
KeywordsComputer scienceBurstinessForward error correctionComputer networkCommunication sourcePeer-to-peerThe InternetNetwork packetPacket lossDisjoint setsPath (computing)UnicastCoding (social sciences)Markov chainDistributed computingAlgorithmDecoding methodsMachine learning

Abstract

fetched live from OpenAlex

Forward error correction (FEC) coding is the preferred error correction technique for interactive video streaming applications on the Internet. Because its performance is impaired by the burstiness of packet loss of Internet links, peer-to-peer (P2P) networks are often proposed to provide multiple paths between a sender and a receiver. However, peers may leave abruptly and the number of disjoint paths may be limited; it is unclear whether or when the use of P2P networks for path diversity can be justified. In this paper, we study the packet loss ratio after FEC correction when using P2P networks to provide multiple paths. We examine two situations: a sender can find enough disjoint paths, or uses a limited number of disjoint paths. We model Internet links using Markov chains, provide numerical analysis of the performance of systematic FEC codes, and verify the results by simulation. We find that although using P2P networks for path diversity often results in a lower post-FEC loss ratio, conditions apply. There exist guidelines but no simple formula to determine when to use P2P networks for path diversity and coding parameters. An application should carefully evaluate the performance gain before taking actions.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.006
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.006
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.

Opus teacher head0.015
GPT teacher head0.267
Teacher spread0.253 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations1
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicPeer-to-Peer Network TechnologiesFrench-language works237,207