Demo Data from VLDB 2026 / reviewers in the wild / expert
Jianxin Qiu
dblp:264/4333
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 since 2021
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 · 87% Datacenter networks · 13% |
Topics — the 1 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Transport protocols and congestion control › congestion control algorithm design
proactive congestion control |
0.5 | 1 | 2021 | FlashPass: Proactive Congestion Control for Shallow-buffered WAN · ICNP 2021 |
Methods — techniques the papers use, named apart from their topics
send time calibration · 0.5credit-based scheduling · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | FlashPass: Proactive Congestion Control for Shallow-buffered WANabstractIn recent years, large enterprises (e.g., Google, Alibaba, etc.) have been building and deploying their wide-area routers based on shallow-buffered switching chips. However, with legacy reactive transport (e.g., TCP Cubic), shallow buffer can easily get overwhelmed by large BDP wide-area traffic, leading to high packet losses and degraded throughput. To address it, we ask: can we design a transport to simultaneously achieve high throughput and low loss for shallow-buffered WAN?We answer this question affirmatively by employing proactive congestion control (PCC). However, two issues exist for existing PCC to work on WAN. Firstly, wide-area traffics have diverse RTTs, leading to what we called imperfect scheduling issue (e.g., data crash in time). Secondly, there is one RTT delay for credits to trigger data sending, which may degrade network performance. Therefore, we propose a novel PCC design - FlashPass. To address the first issue, FlashPass adopts sender-driven emulation process with send time calibration to avoid the data packet crash. To address the second issue, FLASHPASS enables early data transmission in the starting phase, and incorporates an over-provisioning with selective dropping mechanism for efficient credit allocation in the finishing phase. Our evaluation with production workload demonstrates that FlashPass reduces the overall flow completion times of TCP Cubic and ExpressPass by up to 32% and 11.4%, and the 99-th tail completion times of small flows by up to 49.5% and 38%, respectively. Gaoxiong Zeng, Jianxin Qiu, Hongqiang Liu, Kai Chen 0005 |
ICNP | 2 |