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

Tsunyi Tuan

dblp:98/1889 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2000
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-authorComputer 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
Wireless networking · 62% Content delivery and video streaming · 38%

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

TopicWeightPapersLastEvidence papers
Wireless networking › link adaptation
adaptive FEC
0.012000
Multiple Time Scale Redundancy Control for QoS-Sensitive Transport of Real-Time Traffic · INFOCOM 2000
Content delivery and video streaming › video coding
MPEG video
0.012000
Multiple Time Scale Redundancy Control for QoS-Sensitive Transport of Real-Time Traffic · INFOCOM 2000
Content delivery and video streaming › video transmission
real-time video transmission
0.012000
Multiple Time Scale Redundancy Control for QoS-Sensitive Transport of Real-Time Traffic · INFOCOM 2000

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

multiple-time-scale control · 0.0adaptive FEC · 0.0ARQ · 0.0
YearPublicationVenuePosition
2000 Multiple Time Scale Redundancy Control for QoS-Sensitive Transport of Real-Time Traffic
abstract
End-to-end QoS control over best-effort and differentiated service networks which exhibit variability in their exported service properties looms as an important challenge. In previous work, we have shown how packet-level adaptive FEC can be used in dynamic networks to facilitate invariant user-specified QoS in an end-to-end manner. This paper addresses two important problems-self-similar burstiness and performance degradation of reactive controls subject to long feedback loops-complementing the stability/optimality considerations studied earlier. First, for adaptive redundancy control to be effective, its susceptibility to correlated packet drops and queueing delays stemming from self-similar burstiness must be fortified. Second, to preserve FEC's viability over ARQ when transporting real-time traffic in WAN, preactivity must be injected to offset the performance degradation of reactive feedback controls when subject to long RTT. In this paper, we use the recently advanced multiple-time-scale congestion control framework-first investigated in the throughput maximization context-to endow adaptive redundancy control with both selective protection against self-similar burstiness as well as preactivity to feedback redundancy control. We analyze, implement, and benchmark our protocol-AFEC-MT-in the context of transporting periodic real-time traffic, in particular, MPEG video.
Tsunyi Tuan, Kihong Park
INFOCOM1
1999 Multiple Time Scale Congestion Control for Self-Similar Network Traffic
Tsunyi Tuan, Kihong Park
Perform. Evaluation1