Demo Data from SIGIR 2026 / reviewers in the wild / expert
Tilo Hamann
dblp:90/4311
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2000
—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 · 72% Network optimization and economics · 28% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Transport protocols and congestion control
explicit congestion notification |
0.0 | 1 | 2000 | A New Fair Window Algorithm for ECN-Capable TCP (New-ECN) · INFOCOM 2000 |
Network optimization and economics
fairness |
0.0 | 1 | 2000 | A New Fair Window Algorithm for ECN-Capable TCP (New-ECN) · INFOCOM 2000 |
Transport protocols and congestion control
TCP |
0.0 | 1 | 2000 | A New Fair Window Algorithm for ECN-Capable TCP (New-ECN) · INFOCOM 2000 |
Transport protocols and congestion control › TCP congestion control
congestion window |
0.0 | 1 | 2000 | A New Fair Window Algorithm for ECN-Capable TCP (New-ECN) · INFOCOM 2000 |
Transport protocols and congestion control › congestion control fairness
RTT bias |
0.0 | 1 | 2000 | A New Fair Window Algorithm for ECN-Capable TCP (New-ECN) · INFOCOM 2000 |
Methods — techniques the papers use, named apart from their topics
network simulation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2000 | A New Fair Window Algorithm for ECN-Capable TCP (New-ECN)abstractIn this paper we propose a modification of the explicit congestion notification (ECN) to correct the bias against connections with long round trip times (RTT) of TCP. The new-ECN algorithm achieves a fair sharing of the available bandwidth of a bottleneck gateway. The idea is to prevent a fast connection from opening its congestion window too quickly and to enable a slow connection to open its window more aggressively. This is done by modifying not only the congestion window size but also by modifying its rate of increase. Both are reduced while receiving marked packets and are increased during times of no congestion. We demonstrate the effect and performance of the new-ECN algorithm with the network simulator "ns" for different network topologies. Additionally, we study the TCP and ECN-TCP friendliness of the new-ECN algorithm. In this paper we only focus on the single bottleneck case. The behavior of new-ECN with multiple congested gateways needs further research. Tilo Hamann, Jean C. Walrand |
INFOCOM | 1 |