Demo Data from EDBT 2026 / reviewers in the wild / expert
Boyan Huang
dblp:124/4990
· DBLP profile ↗
6ranked-venue papers
3as first author
3since 2021 · last 2025
0000-0002-7460-3563ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-authorComputer 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 |
Routing and switching · 50% Internet architecture and protocols · 50% | |
| Artificial intelligence
1 paper |
Reinforcement learning · 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 › buffer management
buffer sharing |
0.9 | 1 | 2025 | Automatic Dual Threshold Tuning for Switch Buffer Sharing in Datacenter Networking · IEEE Trans. Netw. 2025 |
Routing and switching
switch buffer management |
0.9 | 1 | 2025 | Automatic Dual Threshold Tuning for Switch Buffer Sharing in Datacenter Networking · IEEE Trans. Netw. 2025 |
Machine learning › Reinforcement learning
deep reinforcement learning |
0.3 | 1 | 2025 | Automatic Dual Threshold Tuning for Switch Buffer Sharing in Datacenter Networking · IEEE Trans. Netw. 2025 |
Methods — techniques the papers use, named apart from their topics
p4 programming · 1.7deep reinforcement learning · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Automatic Dual Threshold Tuning for Switch Buffer Sharing in Datacenter NetworkingabstractFor the widely deployed on-chip shared buffer, efficient buffer management is the key to absorbing bursts and avoiding packet loss during transient congestion. However, as the buffer-per-port-per-Gbps in production data centers decreases, it becomes more challenging to provide efficient buffer management to meet the requirements of heterogeneous traffic. We observe that typical shared buffer management policies have two steps: first, they identify short flows arriving at ports and then allocate more buffer room for these ports. Unfortunately, the lack of isolation between long and short flows leads to increased queue buildup and even packet loss of short flows. To address this limitation, we propose D2T, which uses different queue length thresholds for long and short flows. Specifically, we first design a compact data structure to distinguish between long and short flows. Then when two kinds of flows coexist at the same port, the threshold of long flows will decrease to absorb the bursty short flows. What’s more, we introduce D2T${}^{*}$which combines D2T with advanced DRL techniques to move toward mastering buffer management for further improving performance across various scenarios. We implement D2T at a P4-programmable switch and large-scale simulations. The results demonstrate that D2T reduces both average and tail flow completion times (FCT) of short flows by up to 29% and 62% compared with the state-of-the-art policies, respectively. Jingling Liu, Hui Li 0120, Jiawei Huang 0001, Ping Zhong 0002, Boyan Huang, Pingping Dong, Wensheng Tang, Wanchun Jiang, Jianxin Wang 0001, Yong Cui 0001 |
IEEE Trans. Netw. | 6 |
| 2024 | Online bone/air-conducted speech fusion in the presence of strong narrowband noise
Boyan Huang, Baiyu Liu, Wenqi Jia 0005, Yifeng Lin, Tetsuya Shimamura |
Signal Process. | 1 |
| 2022 | A Robust Feedback Active Noise Control System With Online Secondary-Path ModelingabstractIn this letter, a robust feedback active noise control (FBANC) system with an online secondary-path modeling (OSPM) subsystem is proposed for suppressing sinusoidal noise signals. First, a decoupling scheme is proposed by using of an adaptive linear prediction filter (LPF) that takes the FBANC residual noise as its input and separates the remaining sinusoidal noise from the broadband noise that includes an inherent additive noise within the primary noise as well as a broadband component due to an auxiliary white Gaussian noise (AWGN). The remaining sinusoidal noise (LPF output) is used effectively not only to update the FIR controller but also to scale the AWGN, while the broadband noise (LPF error) serves as a desired signal for the OSPM. In this way, the hostile coupling between the FIR controller and the OSPM subsystem is significantly mitigated, leading to both faster system convergence and improved noise reduction performance (NRP). Second, a simple and practical scheme for refreshing the proposed FBANC system is also developed to enhance its robustness against even abrupt changes with the SP and/or the primary noise signal. Extensive simulations with synthetic and real secondary paths and noise signals are conducted to demonstrate the effectiveness of the proposed FBANC system. Yaping Ma, Yegui Xiao, Boyan Huang |
IEEE Signal Process. Lett. | 3 |
| 2016 | Efficient combination of feedforward and feedback structures for nonlinear narrowband active noise control
Lei Luo 0009, Jinwei Sun, Boyan Huang, Dung Duong Quoc |
Signal Process. | 3 |
| 2015 | A simplified variable step-size LMS algorithm for Fourier analysis and its statistical properties
Boyan Huang, Yegui Xiao, Yaping Ma, Jinwei Sun |
Signal Process. | 1 |
| 2013 | A Variable Step-Size FXLMS Algorithm for Narrowband Active Noise ControlabstractIn this paper, a variable step-size filtered-x LMS (VSS-FXLMS) algorithm is proposed for a typical narrowband active noise control system. The new algorithm converges much faster than the conventional FXLMS algorithm does, and indicates a convergence rate quite similar to that of the filtered-x recursive least square (FXRLS) algorithm in stationary noise environments. It also considerably outperforms these two existing algorithms in nonstationary situations. The proposed algorithm requires some more computations as compared with the FXLMS algorithm; however, its computational complexity is significantly less than that of the FXRLS algorithm. Numerous simulations for stationary and nonstationary scenarios are conducted to demonstrate the superior performance of the proposed VSS-FXLMS algorithm as compared with the FXLMS and the FXRLS algorithms. Boyan Huang, Yegui Xiao, Jinwei Sun |
IEEE Trans. Speech Audio Process. | 1 |