Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Soo Hyun Choi

dblp:06/4204 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Transport protocols and congestion control · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › real-time communication
congestion control for real-time media
0.112007
Fairer TCP-friendly congestion control protocol for multimedia streaming applications · CoNEXT 2007
Transport protocols and congestion control › congestion control fairness
TCP-friendly congestion control
0.112007
Fairer TCP-friendly congestion control protocol for multimedia streaming applications · CoNEXT 2007
Transport protocols and congestion control
window-based congestion control
0.112007
Fairer TCP-friendly congestion control protocol for multimedia streaming applications · CoNEXT 2007

Methods — techniques the papers use, named apart from their topics

TCP throughput equation · 0.1ACK mechanism · 0.1
YearPublicationVenuePosition
2007 Fairer TCP-friendly congestion control protocol for multimedia streaming applications
abstract
We present TFWC, a TCP-friendly window-based congestion control mechanism for real-time multimedia streaming applications. Although TFRC is regarded as a de facto standard for those types of applications, under low stat-mux conditions fairness can be an issue. We re-introduce a TCP-like ACK mechanism while retaining the TCP throughput equation to compute the sending rate. We show that our proposed protocol is fairer than TFRC when competing with TCP flows under certain circumstances.
Soo Hyun Choi, Mark Handley
CoNEXT1