Demo Data from EDBT 2026 / reviewers in the wild / expert
Robin F. Wright
dblp:116/7945
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1999
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 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 |
Internet architecture and protocols · 77% Transport protocols and congestion control · 23% | |
| 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 |
|---|---|---|---|---|
Internet architecture and protocols › multicast
reliable multicast |
0.0 | 1 | 1999 | H-RMC: A Hybrid Reliable Multicast Protocol for the Linux Kernel · SC 1999 |
Operating systems › kernel
linux kernel |
0.0 | 1 | 1999 | H-RMC: A Hybrid Reliable Multicast Protocol for the Linux Kernel · SC 1999 |
Transport protocols and congestion control
flow control |
0.0 | 1 | 1999 | H-RMC: A Hybrid Reliable Multicast Protocol for the Linux Kernel · SC 1999 |
Methods — techniques the papers use, named apart from their topics
window-based flow control · 0.0rate-based flow control · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1999 | H-RMC: A Hybrid Reliable Multicast Protocol for the Linux KernelabstractThis paper describes H-RMC, a reliable multicast protocol designed for implementation in the Linux kernel.H-RMC takes advantage of IP multicast and is primarily a NAK-based protocol.To accommodate low-loss environments, where feedback in the form of NAKs is scarce, H-RMC receivers return periodic update messages in the absence of other reverse traffic.H-RMC uses a combination of rate-based and window-based flow control.The sender maintains minimal information about each receiver so that buffered data is not released prematurely, and polls receivers in case it has not heard from them at the time of buffer release.Combined, these techniques produce a reliable multicast data stream with a relatively low rate of feedback.Performance results show that adequate kernel buffer space, combined with a two-stage rate control method and polling, are effective in minimizing feedback from receivers and thereby in maintaining reasonable throughputs. Philip K. McKinley, Ravi T. Rao, Robin F. Wright |
SC | 3 |