MétaCan
Menu
Back to cohort
Record W2146311503 · doi:10.1109/ccnc.2009.4784859

A Novel Optimistic Unchoking Algorithm for BitTorrent

2009· article· en· W2146311503 on OpenAlexaff
Zuhui Ma, Dongyu Qiu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicPeer-to-Peer Network Technologies
Canadian institutionsConcordia University
Fundersnot available
KeywordsBitTorrentComputer scienceUploadDownloadBitTorrent trackerBandwidth (computing)Free ridingComputer networkPeer-to-peerFile sharingDistributed computingThe InternetWorld Wide WebArtificial intelligence

Abstract

fetched live from OpenAlex

Optimistic unchoking plays an important role in BitTorrent peer-to-peer (P2P) file sharing networks. Peers use optimistic unchoking to find upload bandwidth information about their neighbors. However, free-riders can also take advantage of optimistic unchoking and download from the network without uploading anything. In this paper, we propose a novel optimistic unchoking algorithm for BitTorrent. The main purposes of our algorithm are to prevent free-riding and to improve the efficiency of optimistic unchoking. We then propose a stochastic model to analyze the performance of our algorithm. We also verify the results by simulations. Both theoretical and simulation results show that our algorithm can effectively prevent free-riding and significantly improve the download rate of normal peers at the same time.

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 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: Methods · Consensus signal: Methods
Teacher disagreement score0.961
Threshold uncertainty score0.497

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.000
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.025
GPT teacher head0.271
Teacher spread0.246 · 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 teacher head, not a consensus.

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

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

Citations12
Published2009
Admission routes1
Has abstractyes

Explore more

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