Bin Yu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Bin Yu has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Hanxu Hou
Dongguan University of Technology, Dongguan, China
2 shared publications - Linqi Song
City University of Hong Kong
2 shared publications - Zhengyi Jiang
Department of Mathematics Sciences, Tsinghua University, Beijing, China
2 shared publications - Zhongyi Huang
Tsinghua University, Beijing, China
2 shared publications - Bo Bai
Huawei Technologies Company Ltd., Shenzhen, China
1 shared publication - Gong Zhang
Huawei Technologies CO., Ltd, Shenzhen, China
1 shared publication
Latest Publications
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 3252-3266
Cross-Rack Update Bandwidth for Rack-Aware Storage Systems
Rack-aware storage systems organize the storage nodes in racks such that the cross-rack communication cost is much more expensive than the intra-rack communication cost. In this paper, we primarily investigate the cross-rack update bandwidth defined as the average amount of symbols transferred across different racks during an update process of one single node. It is critical to design erasure codes that minimize the cross-rack update bandwidth. Our main contributions are as follows. First, we establish the model of cross-rack update bandwidth of irregular array codes over rack-aware storage systems. Second, we derive the tight lower bound on cross-rack update bandwidth, and define minimum cross-rack update bandwidth (MCUB) codes as the irregular array codes that can achieve our tight lower bound. Third, we derive the tight lower bound on redundancy defined as the total number of parity symbols for MCUB codes, and define minimum redundancy MCUB (MR-MCUB) codes as the MCUB codes that can achieve the redundancy lower bound. Fourth, we present explicit constructions of MR-MCUB codes that achieve both the minimum cross-rack update bandwidth and the minimum redundancy, which means that the two lower bounds are tight. Last, we define intra-rack update bandwidth as the average amount of symbols incurred within one rack in an update process, and derive the lower bound of intra-rack update bandwidth of MCUB codes. Moreover, we show that our MCUB codes constructions can also achieve the lower bound of intra-rack update bandwidth.
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 3252-3266
Cross-Rack Update Bandwidth for Rack-Aware Storage Systems
Rack-aware storage systems organize the storage nodes in racks such that the cross-rack communication cost is much more expensive than the intra-rack communication cost. In this paper, we primarily investigate the cross-rack update bandwidth defined as the average amount of symbols transferred across different racks during an update process of one single node. It is critical to design erasure codes that minimize the cross-rack update bandwidth. Our main contributions are as follows. First, we establish the model of cross-rack update bandwidth of irregular array codes over rack-aware storage systems. Second, we derive the tight lower bound on cross-rack update bandwidth, and define minimum cross-rack update bandwidth (MCUB) codes as the irregular array codes that can achieve our tight lower bound. Third, we derive the tight lower bound on redundancy defined as the total number of parity symbols for MCUB codes, and define minimum redundancy MCUB (MR-MCUB) codes as the MCUB codes that can achieve the redundancy lower bound. Fourth, we present explicit constructions of MR-MCUB codes that achieve both the minimum cross-rack update bandwidth and the minimum redundancy, which means that the two lower bounds are tight. Last, we define intra-rack update bandwidth as the average amount of symbols incurred within one rack in an update process, and derive the lower bound of intra-rack update bandwidth of MCUB codes. Moreover, we show that our MCUB codes constructions can also achieve the lower bound of intra-rack update bandwidth.
- 24 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (10) , 8635-8646
Explicit Constructions of Rack-Aware Regenerating Codes for Multi-Node Failures
In data centers, storage nodes are typically organized in racks and rack-aware regenerating codes (RRCs) can achieve the optimal trade-off between storage capacity and cross-rack repair bandwidth. In this paper, we present explicit constructions for multiple erasure tolerance of rack-aware regenerating codes (MET-RRCs), i.e., RRCs with optimal cross-rack repair bandwidth for multi-node failures. We refine the MET-RRC framework in [2] under more extensive parameters and extend the existing construction methods of RRCs. Specifically, we leverage the parity-check matrix structure to present a general framework for multiple erasure tolerance of minimum storage rack-aware regenerating (MET-MSRR) codes. The existing parity-check matrix construction of MSRR codes can be elucidated with this framework. Moreover, we present the construction for multiple erasure tolerance of minimum bandwidth rack-aware regenerating (MET-MBRR) codes using the product-matrix framework.
- 24 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (10) , 8635-8646
Explicit Constructions of Rack-Aware Regenerating Codes for Multi-Node Failures
In data centers, storage nodes are typically organized in racks and rack-aware regenerating codes (RRCs) can achieve the optimal trade-off between storage capacity and cross-rack repair bandwidth. In this paper, we present explicit constructions for multiple erasure tolerance of rack-aware regenerating codes (MET-RRCs), i.e., RRCs with optimal cross-rack repair bandwidth for multi-node failures. We refine the MET-RRC framework in [2] under more extensive parameters and extend the existing construction methods of RRCs. Specifically, we leverage the parity-check matrix structure to present a general framework for multiple erasure tolerance of minimum storage rack-aware regenerating (MET-MSRR) codes. The existing parity-check matrix construction of MSRR codes can be elucidated with this framework. Moreover, we present the construction for multiple erasure tolerance of minimum bandwidth rack-aware regenerating (MET-MBRR) codes using the product-matrix framework.