Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Qianwen Yin

dblp:142/5421 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
2since 2021 · last 2025
0000-0002-9725-3412ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 5 · 2 first-author · 2 since 2021Security and privacy · 2 · 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
5 papers
Datacenter networks · 54% Transport protocols and congestion control · 30% Routing and switching · 11%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Interconnection networks and networks-on-chip · 100%

Topics — the 10 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control
delay-based congestion control
0.912025
Falcon: A Reliable, Low Latency Hardware Transport · SIGCOMM 2025
Datacenter networks › load balancing
multipath load balancing
0.912025
Falcon: A Reliable, Low Latency Hardware Transport · SIGCOMM 2025
Datacenter networks › load balancing
congestion-aware load balancing
0.612022
PLB: congestion signals are simple and effective for network load balancing · SIGCOMM 2022
Routing and switching › multipath routing
equal-cost multipath
0.612022
PLB: congestion signals are simple and effective for network load balancing · SIGCOMM 2022
Datacenter networks
load balancing
0.612022
PLB: congestion signals are simple and effective for network load balancing · SIGCOMM 2022
Transport protocols and congestion control
end-to-end congestion control
0.312017
Packet-Scale Congestion Control Paradigm · IEEE/ACM Trans. Netw. 2017
Network measurement and analytics
bandwidth estimation
0.212014
Can Bandwidth Estimation Tackle Noise at Ultra-high Speeds? · ICNP 2014
Transport protocols and congestion control
congestion feedback
0.212022
PLB: congestion signals are simple and effective for network load balancing · SIGCOMM 2022
Network performance modeling
benchmarking
0.112017
TCP Rapid: From theory to practice · INFOCOM 2017
Interconnection networks and networks-on-chip
high-speed networks
0.112017
Packet-Scale Congestion Control Paradigm · IEEE/ACM Trans. Netw. 2017

Methods — techniques the papers use, named apart from their topics

programmable engine · 0.9hardware retransmission · 0.9bandwidth probing · 0.9repathing · 0.6rate adaptation · 0.6IPv6 flow label · 0.6linux implementation · 0.3high-precision timestamping · 0.3spike smoothing · 0.2packet-pair probing · 0.2
YearPublicationVenuePosition
2025 Falcon: A Reliable, Low Latency Hardware Transport
abstract
Hardware transports such as RoCE deliver high performance with minimal host CPU, but are best suited to special-purpose deployments that limit their use, e.g., backend networks or Ethernet with Priority Flow Control (PFC). We introduce Falcon, the first hardware transport that supports multiple Upper Layer Protocols (ULPs) and heterogeneous application workloads in general-purpose Ethernet datacenter environments (with losses and without special switch support). Key design elements include: delay-based congestion control with multipath load balancing; a layered design with a simple request-response transaction interface for multi-ULP support; hardware-based retransmissions and error-handling for scalability; and a programmable engine for flexibility. The first Falcon hardware implementation delivers a peak performance of 200 Gbps, 120 Mops/sec, with near-optimal operation completion times that are up to 8× lower than CX-7 RoCE under network congestion, and up to 65% higher goodput under lossy conditions.
Arjun Singhvi, Nandita Dukkipati, Prashant Chandra, Hassan M. G. Wassel, Naveen Kr. Sharma, Anthony Rebello, Henry Schuh, Praveen Kumar 0003, Behnam Montazeri, Neelesh Bansod, Sarin Thomas, Inho Cho, Hyojeong Lee Seibert, Baijun Wu, Rui Yang 0034, Qianwen Yin, Srinivas Vaduvatha, Weihuang Wang, Masoud Moshref, David Wetherall, Amin Vahdat
SIGCOMM18
2022 PLB: congestion signals are simple and effective for network load balancing
abstract
We present a new, host-based design for link load balancing and report the first experiences of link imbalance in datacenters. Our design, PLB (Protective Load Balancing), builds on transport protocols and ECMP/WCMP to reduce network hotspots. PLB randomly changes the paths of connections that experience congestion, preferring to repath after idle periods to minimize packet reordering. It repaths a connection by changing the IPv6 Flow Label on its packets, which switches include as part of ECMP/WCMP. Across hosts, this action drives down hotspots in the network, and lowers the latency of RPCs.
Mubashir Adnan Qureshi, Yuchung Cheng, Qianwen Yin, Qiaobin Fu, Gautam Kumar 0001, Masoud Moshref, Junhua Yan, Van Jacobson, David Wetherall, Abdul Kabbani
SIGCOMM3
2017 TCP Rapid: From theory to practice
abstract
Delay and rate-based alternatives to TCP congestion-control have been around for nearly three decades and have seen a recent surge in interest. However, such designs have faced significant resistance in being deployed on a wide-scale across the Internet - this has been mostly due to serious concerns about noise in delay measurements, pacing inter-packet gaps, and/or required changes to the standard TCP stack/headers. With the advent of high-speed networking, some of these concerns become even more significant. In this paper, we consider Rapid, a recent proposal for ultra-high speed congestion control, which perhaps stretches each of these challenges to the greatest extent. Rapid adopts a framework of continuous fine-scale bandwidth probing, which requires a potentially different and finely-controlled gap for every packet, high-precision timestamping of received packets, and reliance on fine-scale changes in inter-packet gaps. While simulation-based evaluations of Rapid show that it has outstanding performance gains along several important dimensions, these will not translate to the real-world unless the above challenges are addressed. We design a Linux implementation of Rapid after carefully considering each of these challenges. Our evaluations on a 10Gbps testbed confirm that the implementation can indeed achieve the claimed performance gains, and that it would not have been possible unless each of the above challenges was addressed.
Qianwen Yin, Jasleen Kaur 0001, F. Donelson Smith
INFOCOM1
2017 Packet-Scale Congestion Control Paradigm
abstract
This paper presents the packet-scale paradigm for designing end-to-end congestion control protocols for ultra-high speed networks. The paradigm discards the legacy framework of RTT-scale protocols, and instead builds upon two revolutionary foundations-that of continually probing for available bandwidth at short timescales, and that of adapting the data sending rate so as to avoid overloading the network. Through experimental evaluations with a prototype, we report high performance gains along several dimensions in high-speed networks-the steady-state throughput, adaptability to dynamic cross-traffic, RTT-fairness, and co-existence with the conventional TCP traffic mixes. The paradigm also opens up several issues that are less of a concern for traditional protocols-we summarize our approaches for addressing these.
Rebecca Lovewell, Qianwen Yin, Tianrong Zhang, Jasleen Kaur 0001, F. Donelson Smith
IEEE/ACM Trans. Netw.2
2016 Can Machine Learning Benefit Bandwidth Estimation at Ultra-high Speeds?
Qianwen Yin, Jasleen Kaur 0001
PAM1
2014 Can Bandwidth Estimation Tackle Noise at Ultra-high Speeds?
abstract
While existing bandwidth estimation tools have been shown to perform well on 100Mbps networks, they fail to do so at gigabit and higher network speeds. This is because finer inter-packet gaps are needed to probe for higher rates -- fine gaps are more susceptible to be disturbed by small-scale buffering-related noise. In this paper, we evaluate existing noise reduction techniques for tackling the issue, and show that they are ineffective on 10Gbps links. We propose a novel smoothing strategy, Buffering-aware Spike Smoothing (BASS), which can be applied effectively to both single-rate and multi-rate probing frameworks and help significantly in scaling bandwidth estimation to ultra-high speed networks. Besides, we provide first evidence that accurate bandwidth estimation using our strategy can help improve the performance of congestion-control protocols on real 10Gbps networks.
Qianwen Yin, Jasleen Kaur 0001, F. Donelson Smith
ICNP1
2014 Scaling Bandwidth Estimation to High Speed Networks
Qianwen Yin, Jasleen Kaur 0001, F. Donelson Smith
PAM1