Demo Data from SIGIR 2026 / reviewers in the wild / expert
Roman Dunaytsev
dblp:17/972
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 2010
0000-0001-5154-9974ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 3 · 2 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
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Transport protocols and congestion control › TCP variants
TCP NewReno |
0.1 | 1 | 2006 | TCP NewReno Throughput in the Presence of Correlated Losses: The Slow-but-Steady Variant · INFOCOM 2006 |
Transport protocols and congestion control › TCP modeling
TCP throughput modeling |
0.1 | 1 | 2006 | TCP NewReno Throughput in the Presence of Correlated Losses: The Slow-but-Steady Variant · INFOCOM 2006 |
Transport protocols and congestion control
loss recovery |
0.0 | 1 | 2006 | TCP NewReno Throughput in the Presence of Correlated Losses: The Slow-but-Steady Variant · INFOCOM 2006 |
Methods — techniques the papers use, named apart from their topics
ns-2 simulation · 0.1analytical throughput model · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Modeling TCP SACK performance over wireless channels with semi-reliable ARQ/FEC
Dmitri Moltchanov, Roman Dunaytsev |
Wirel. Networks | 2 |
| 2006 | TCP NewReno Throughput in the Presence of Correlated Losses: The Slow-but-Steady VariantabstractThis paper presents an analytical model of steady state throughput of the Slow-but-Steady variant of TCP NewReno as a function of loss event rate, average number of segments lost per loss event, average round trip time, and retransmission timeout value. The presented model is based on the approach proposed by Padhyeetal.for TCP Reno throughput modeling and extends it by capturing the effect of fast recovery algorithm of the Slow-but-Steady variant of TCP NewReno on throughput and taking into consideration slow start phase after timeout expiration. Validation by ns-2 simulations shows good agreement and accuracy of the proposed model. Roman Dunaytsev, Yevgeni Koucheryavy, Jarmo Harju |
INFOCOM | 1 |
| 2006 | The PFTK-model revised
Roman Dunaytsev, Yevgeni Koucheryavy, Jarmo Harju |
Comput. Commun. | 1 |