MétaCan
Menu
Back to cohort
Record W2148589749 · doi:10.1109/icme.2009.5202613

Improving the streaming capacity in P2P VoD systems with helpers

2009· article· en· W2148589749 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicPeer-to-Peer Network Technologies
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsComputer scienceBottleneckUploadVideo on demandLive streamingComputer networkPeer-to-peerVideo streamingReal Time Streaming ProtocolDistributed computingThe InternetWorld Wide Web

Abstract

fetched live from OpenAlex

Peer-to-peer (P2P) video-on-demand (VoD) is a promising solution to provide video service to a large number of users. Streaming capacity in a P2P VoD system is defined as the maximal streaming rate that every user can receive. Due to the upload bottleneck, the streaming capacity in the P2P VoD system is limited. In this paper, we introduce helpers in the P2P VoD system and then optimize the helper resources to improve the streaming capacity. Specifically, we first optimize the helper assignment using a greedy algorithm. Then we develop a proximal distributed algorithm to maximize the streaming capacity by optimizing the link rates. Through simulations, we demonstrate that the P2P VoD system with optimized helpers can obtain a much higher streaming capacity compared to the P2P VoD system without any helper or the one with randomly assigned helpers.

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.889
Threshold uncertainty score0.314

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.020
GPT teacher head0.202
Teacher spread0.182 · 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

Quick stats

Citations29
Published2009
Admission routes1
Has abstractyes

Explore more

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