Demo Data from EDBT 2026 / reviewers in the wild / expert
Mark Berryman
dblp:01/2388
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2000
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1
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% | |
| Software engineering, system software, and programming languages
1 paper |
Operating systems · 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
queue management |
0.0 | 1 | 2000 | Receiver Based Management of Low Bandwidth Access Links · INFOCOM 2000 |
Transport protocols and congestion control › congestion control algorithm design
receiver-driven congestion control |
0.0 | 1 | 2000 | Receiver Based Management of Low Bandwidth Access Links · INFOCOM 2000 |
Operating systems › network stack
socket buffer management |
0.0 | 1 | 2000 | Receiver Based Management of Low Bandwidth Access Links · INFOCOM 2000 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2000 | Receiver Based Management of Low Bandwidth Access LinksabstractIn this paper, we describe a receiver-based congestion control policy that leverages TCP flow control mechanisms to prioritize mixed traffic loads across access links. We manage queueing at the access link to: (1) improve the response time of interactive network applications; (2) reduce congestion-related packet losses; while (3) maintaining high throughput for bulk-transfer applications. Our policy controls queue length by manipulating receive socket buffer sizes. We have implemented this solution in a dynamically loadable Linux kernel module, and tested it over low-bandwidth links. Our approach yields a 7-fold improvement in packet latency over an unmodified system while maintaining 94% link utilization. In the common case, congestion-related packet losses at the access link can be eliminated. Finally, by prioritizing short flows, we show that our system reduces the time to download a complex Web page during a large background transfer by a factor of two. Neil Spring, Maureen Chesire, Mark Berryman, Vivek Sahasranaman, Thomas E. Anderson, Brian N. Bershad |
INFOCOM | 3 |