Han Tian
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Han Tian has a total of 78 co-authors. Here are the top co-authors by number of shared publications:
- Kai Chen
Hong Kong University of Science and Technology, Hong Kong, Hong Kong
16 shared publications - Xudong Liao
Hong Kong University of Science and Technology, Hong Kong, Hong Kong
8 shared publications - Junxue Zhang
University of Science and Technology of China, Hefei, China
7 shared publications - Yilun Jin
The Hong Kong University of Science and Technology
7 shared publications - Wenxue Li
Hong Kong University of Science and Technology, Hong Kong, Hong Kong
6 shared publications - Chaoliang Zeng
SING Laboratory, The Hong Kong University of Science and Technology, Hong Kong, SAR, China
5 shared publications
Latest Publications
- Open Access
- 17 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 14-26
FCP: Fast User-space RDMA Control Plane Setup for Elastic Computing
- 17 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 14-26
Open AccessFCP: Fast User-space RDMA Control Plane Setup for Elastic Computing
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1341-1355
PrefixFlow: Training-Time KV Caching for Schedule-Level Prefix Reuse in LLM RL Training
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1341-1355
Open AccessPrefixFlow: Training-Time KV Caching for Schedule-Level Prefix Reuse in LLM RL Training
- Open Access
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1430-1444
MFS: An Efficient Model Family Serving System for LLMs
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1430-1444
Open AccessMFS: An Efficient Model Family Serving System for LLMs
- Open Access
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 108-125
Learn-to-Probe: Achieving Signal Distinguishability in Learning-based Congestion Control
Internet congestion control remains a fundamental challenge, and recent learning-based congestion control algorithms (CCAs) have shown potential in optimizing network performance. However, their reliance on heuristically chosen input signals often leads to suboptimal behavior across diverse network conditions. In this paper, we identify the root cause as the lack of signal distinguishability-the ability of signals to reflect meaningful differences in network states. To address this, we propose Learn-to-Probe (LTP), a novel signal engineering paradigm that actively generates distinguishable network signals to improve the learning process. LTP (i) employs Bayesian filtering to accurately estimate network states from historical signals, and (ii) introduces an intrinsic reinforcement learning reward that encourages the flow to probe the network, inducing signal sequences that minimize the estimation uncertainty in (i). This probing behavior naturally enhances signal distinguishability, enabling the learning model to make more informed decisions. Extensive evaluations show that LTP consistently achieves high link utilization, low queuing delay, and stable convergence across diverse environments. Our results underscore the importance of signal distinguishability and offer a new direction for robust, adaptive congestion control.
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 108-125
Open AccessLearn-to-Probe: Achieving Signal Distinguishability in Learning-based Congestion Control
Internet congestion control remains a fundamental challenge, and recent learning-based congestion control algorithms (CCAs) have shown potential in optimizing network performance. However, their reliance on heuristically chosen input signals often leads to suboptimal behavior across diverse network conditions. In this paper, we identify the root cause as the lack of signal distinguishability-the ability of signals to reflect meaningful differences in network states. To address this, we propose Learn-to-Probe (LTP), a novel signal engineering paradigm that actively generates distinguishable network signals to improve the learning process. LTP (i) employs Bayesian filtering to accurately estimate network states from historical signals, and (ii) introduces an intrinsic reinforcement learning reward that encourages the flow to probe the network, inducing signal sequences that minimize the estimation uncertainty in (i). This probing behavior naturally enhances signal distinguishability, enabling the learning model to make more informed decisions. Extensive evaluations show that LTP consistently achieves high link utilization, low queuing delay, and stable convergence across diverse environments. Our results underscore the importance of signal distinguishability and offer a new direction for robust, adaptive congestion control.
- 13 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 2966-2980
Towards Fair and Efficient Congestion Control Through Multi-Agent Deep Reinforcement Learning
Recent years have witnessed a plethora of learning-based solutions for congestion control (CC) that demonstrate better performance over traditional TCP schemes. However, they fail to provide consistently good convergence properties, including fairness, fast convergence and stability, due to the mismatch between their objective functions and these properties. Despite being intuitive, integrating these properties into existing learning-based CC is challenging, because: 1) their training environments are designed for the performance optimization of single flow but incapable of cooperative multi-flow optimization, and 2) there is no directly measurable metric to represent these properties into the training objective function. We present Astraea, a new learning-based congestion control that ensures fast convergence to fairness with stability. At the heart of Astraea is a multi-agent deep reinforcement learning framework that explicitly optimizes these convergence properties during the training process by enabling the learning of interactive policy between multiple competing flows, while maintaining high performance. We further build a faithful multi-flow environment that emulates the competing behaviors of concurrent flows, explicitly expressing convergence properties to enable their optimization during training. We have fully implemented Astraea and our comprehensive experiments show that Astraea can quickly converge to fairness point and exhibit better stability than its counterparts. For example, Astraea achieves near-optimal bandwidth sharing (i.e., fairness) when multiple flows compete for the same bottleneck, delivers up to 8.4× faster convergence speed and 2.8× smaller throughput deviation, while achieving comparable or even better performance over prior solutions.
- 13 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 2966-2980
Towards Fair and Efficient Congestion Control Through Multi-Agent Deep Reinforcement Learning
Recent years have witnessed a plethora of learning-based solutions for congestion control (CC) that demonstrate better performance over traditional TCP schemes. However, they fail to provide consistently good convergence properties, including fairness, fast convergence and stability, due to the mismatch between their objective functions and these properties. Despite being intuitive, integrating these properties into existing learning-based CC is challenging, because: 1) their training environments are designed for the performance optimization of single flow but incapable of cooperative multi-flow optimization, and 2) there is no directly measurable metric to represent these properties into the training objective function. We present Astraea, a new learning-based congestion control that ensures fast convergence to fairness with stability. At the heart of Astraea is a multi-agent deep reinforcement learning framework that explicitly optimizes these convergence properties during the training process by enabling the learning of interactive policy between multiple competing flows, while maintaining high performance. We further build a faithful multi-flow environment that emulates the competing behaviors of concurrent flows, explicitly expressing convergence properties to enable their optimization during training. We have fully implemented Astraea and our comprehensive experiments show that Astraea can quickly converge to fairness point and exhibit better stability than its counterparts. For example, Astraea achieves near-optimal bandwidth sharing (i.e., fairness) when multiple flows compete for the same bottleneck, delivers up to 8.4× faster convergence speed and 2.8× smaller throughput deviation, while achieving comparable or even better performance over prior solutions.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 7424-7438
Understanding Communication Predictability of Distributed LLM Training
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 7424-7438
Understanding Communication Predictability of Distributed LLM Training
- 3 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 37 (1) , 155-168
FOSS: Learning-Based Multi-Level Design Makes FIFO More Adaptive for CDN Caching
With the rapid growth of data-intensive applications, such as artificial intelligence and the Internet of Things, CDNs, which use persistent storage (e.g., SSDs and HDDs) to cache data at the edge, have become crucial for enhancing network efficiency. Two metrics—hit ratio and processing latency—are essential for evaluating CDN caching performance. However, CDN caching faces the challenge of write amplification, creating a trade-off between random access for higher hit ratios and sequential writes for reducing processing latency. Existing cache designs struggle to effectively balance these conflicting requirements across diverse workloads. In this paper, we present FOSS, a caching system specifically optimized for CDNs deployed on SSD-based storage and hybrid SSD–HDD storage, which features a streamlined, thin file system that operates independently of the kernel. At its heart, FOSS employs a multi-level FIFO queue to strike a balance between local sequential and global random access on SSDs. Then, FOSS incorporates a learning-based method to dynamically configure the multi-level structure configuration, making the system adaptive to various workload characteristics and caching algorithm requirements. Therefore, FOSS ensures better performance across different scenarios. Our extensive experiments show FOSS improves hit ratios significantly over existing systems, reduces end-to-end response latency by 16.5% and demonstrates a consistent performance improvement in various settings on large-scale commercial CDN traces.
- 3 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 37 (1) , 155-168
FOSS: Learning-Based Multi-Level Design Makes FIFO More Adaptive for CDN Caching
With the rapid growth of data-intensive applications, such as artificial intelligence and the Internet of Things, CDNs, which use persistent storage (e.g., SSDs and HDDs) to cache data at the edge, have become crucial for enhancing network efficiency. Two metrics—hit ratio and processing latency—are essential for evaluating CDN caching performance. However, CDN caching faces the challenge of write amplification, creating a trade-off between random access for higher hit ratios and sequential writes for reducing processing latency. Existing cache designs struggle to effectively balance these conflicting requirements across diverse workloads. In this paper, we present FOSS, a caching system specifically optimized for CDNs deployed on SSD-based storage and hybrid SSD–HDD storage, which features a streamlined, thin file system that operates independently of the kernel. At its heart, FOSS employs a multi-level FIFO queue to strike a balance between local sequential and global random access on SSDs. Then, FOSS incorporates a learning-based method to dynamically configure the multi-level structure configuration, making the system adaptive to various workload characteristics and caching algorithm requirements. Therefore, FOSS ensures better performance across different scenarios. Our extensive experiments show FOSS improves hit ratios significantly over existing systems, reduces end-to-end response latency by 16.5% and demonstrates a consistent performance improvement in various settings on large-scale commercial CDN traces.
- Open Access
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 1232-1234
Coflow Scheduling for LLM Training
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 1232-1234
Open AccessCoflow Scheduling for LLM Training
- Open Access
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 554-574
MixNet: A Runtime Reconfigurable Optical-Electrical Fabric for Distributed Mixture-of-Experts Training
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 554-574
Open AccessMixNet: A Runtime Reconfigurable Optical-Electrical Fabric for Distributed Mixture-of-Experts Training
- Open Access
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 3055-3066
Exploiting Student Parallelism for Low-latency GPU Inference of BERT-like Models in Online Services
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 3055-3066
Open AccessExploiting Student Parallelism for Low-latency GPU Inference of BERT-like Models in Online Services