Sen Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Sen Liu has a total of 137 co-authors. Here are the top co-authors by number of shared publications:
- Yang Xu
Fudan University, Shanghai, China
21 shared publications - Zehua Guo
Beijing Institute of Technology
11 shared publications - Zixuan Chen
China Telecom, Shanghai, China
11 shared publications - Hongfeng Chai
Fudan University, Shanghai, China
4 shared publications - Jiawei Huang
Central South University
4 shared publications - Ruyi Yao
Fudan University, Shanghai, China
4 shared publications
Latest Publications
- Open Access
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1228-1245
InfiniFlow: Decoupling Virtual Channel Scalability from Buffer Requirements in Lossless Datacenter Networks
Modern datacenters increasingly rely on Remote Direct Memory Access (RDMA) for high throughput and low latency. To ensure lossless transmission, RDMA fabrics employ hop-by-hop flow control at the granularity of Virtual Channels (VCs). However, multiplexing multiple flows within the same VC couples their backpressure behavior, leading to severe congestion spreading, degrading throughput and tail latency significantly. Existing methods try to improve isolation by increasing the number of VCs but require per-VC buffer reservation, causing buffer requirements to scale linearly with the number of VCs and fundamentally limiting VC scalability. We present InfiniFlow, a credit-based hop-by-hop flow control method that supports massive VCs with a limited buffer budget via per-port buffer sharing. InfiniFlow introduces a paradigm shift in buffer management: Upstream Allocates Buffer for Downstream (UABD), where, for each link, the upstream scheduler maintains a per-port shared credit pool and dynamically allocates credits to VCs. Building on UABD, InfiniFlow further incorporates a Buffer Usage Control Protocol that enforces per-VC dynamic credit thresholds using real-time backlog feedback to bound credit consumption and prevent buffer monopolization. With InfiniFlow, the required buffer size per port becomes independent of the number of VCs and is instead bounded by a small budget proportional to per-hop Bandwidth-Delay Product (BDP) (approximately 3× BDP). We implement InfiniFlow on a Xilinx Alveo U280 FPGA and demonstrate support for over 16k VCs using only 401 KB of on-chip memory per port while sustaining 100 Gbps line-rate transmission, achieving 512× and 1024× higher VC scalability than CBFC and PFC, respectively. Extensive NS-3 simulations show that InfiniFlow achieves near-optimal flow completion times under realistic workloads without relying on slow end-to-end rate adaptation, outperforming prior hop-by-hop flow control methods and state-of-the-art congestion control schemes.
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1228-1245
Open AccessInfiniFlow: Decoupling Virtual Channel Scalability from Buffer Requirements in Lossless Datacenter Networks
Modern datacenters increasingly rely on Remote Direct Memory Access (RDMA) for high throughput and low latency. To ensure lossless transmission, RDMA fabrics employ hop-by-hop flow control at the granularity of Virtual Channels (VCs). However, multiplexing multiple flows within the same VC couples their backpressure behavior, leading to severe congestion spreading, degrading throughput and tail latency significantly. Existing methods try to improve isolation by increasing the number of VCs but require per-VC buffer reservation, causing buffer requirements to scale linearly with the number of VCs and fundamentally limiting VC scalability. We present InfiniFlow, a credit-based hop-by-hop flow control method that supports massive VCs with a limited buffer budget via per-port buffer sharing. InfiniFlow introduces a paradigm shift in buffer management: Upstream Allocates Buffer for Downstream (UABD), where, for each link, the upstream scheduler maintains a per-port shared credit pool and dynamically allocates credits to VCs. Building on UABD, InfiniFlow further incorporates a Buffer Usage Control Protocol that enforces per-VC dynamic credit thresholds using real-time backlog feedback to bound credit consumption and prevent buffer monopolization. With InfiniFlow, the required buffer size per port becomes independent of the number of VCs and is instead bounded by a small budget proportional to per-hop Bandwidth-Delay Product (BDP) (approximately 3× BDP). We implement InfiniFlow on a Xilinx Alveo U280 FPGA and demonstrate support for over 16k VCs using only 401 KB of on-chip memory per port while sustaining 100 Gbps line-rate transmission, achieving 512× and 1024× higher VC scalability than CBFC and PFC, respectively. Extensive NS-3 simulations show that InfiniFlow achieves near-optimal flow completion times under realistic workloads without relying on slow end-to-end rate adaptation, outperforming prior hop-by-hop flow control methods and state-of-the-art congestion control schemes.
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 8707-8718
TransXion: A High-Fidelity Graph Benchmark for Realistic Anti-Money Laundering
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 8707-8718
Open AccessTransXion: A High-Fidelity Graph Benchmark for Realistic Anti-Money Laundering
- 30 April 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 325
CATS : An enhanced framework in LLM-based tabular data synthesis by correlation augmentation
- 30 April 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 325
CATS : An enhanced framework in LLM-based tabular data synthesis by correlation augmentation
- 20 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 4510-4525
AIRP: Accelerating Multi-Tenant Distributed Learning With In-Network Resource Pooling
The increasing popularity of large models and datasets has highlighted the significance of distributed training networks. As gradient synchronization generates substantial traffic, in-network aggregation (INA) has emerged as a solution to offload aggregation onto the switch, alleviating network congestion and accelerating distributed training. However, the limited memory capacity of the INA switch becomes a potential bottleneck as computation shifts into the network, especially in multi-tenant scenarios. To address this bottleneck and enhance network throughput, we propose the Aggregation with Innetwork Resource Pooling (AIRP) framework. Unlike existing approaches that optimize individual switches in a localized manner, AIRP takes a holistic view and efficiently pools switch memory resources across the entire network, allocating them to multiple tenants. Evaluation using the ns-3 simulator and P4 testbed demonstrates that AIRP can accelerate the training of various models, including computer vision and language models. The experimental results show that AIRP outperforms existing INA approaches by up to 7 times in terms of network throughput in multi-tenant scenarios, while also achieving great flexibility and efficiency in deployment.
- 20 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 4510-4525
AIRP: Accelerating Multi-Tenant Distributed Learning With In-Network Resource Pooling
The increasing popularity of large models and datasets has highlighted the significance of distributed training networks. As gradient synchronization generates substantial traffic, in-network aggregation (INA) has emerged as a solution to offload aggregation onto the switch, alleviating network congestion and accelerating distributed training. However, the limited memory capacity of the INA switch becomes a potential bottleneck as computation shifts into the network, especially in multi-tenant scenarios. To address this bottleneck and enhance network throughput, we propose the Aggregation with Innetwork Resource Pooling (AIRP) framework. Unlike existing approaches that optimize individual switches in a localized manner, AIRP takes a holistic view and efficiently pools switch memory resources across the entire network, allocating them to multiple tenants. Evaluation using the ns-3 simulator and P4 testbed demonstrates that AIRP can accelerate the training of various models, including computer vision and language models. The experimental results show that AIRP outperforms existing INA approaches by up to 7 times in terms of network throughput in multi-tenant scenarios, while also achieving great flexibility and efficiency in deployment.
- 1 March 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 317
Dynamic graph learning for integrating temporal relationships in stock prediction
- 1 March 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 317
Dynamic graph learning for integrating temporal relationships in stock prediction
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 8059-8074
Toward Multipath Flow-Aware and Resource Efficient Rate Limiter Placement in Programmable DCNs
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 8059-8074
Toward Multipath Flow-Aware and Resource Efficient Rate Limiter Placement in Programmable DCNs
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 7804-7819
Adaptive Flowlet Load Balancing via Deployment-Friendly Fading Timeout Mechanism
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 7804-7819
Adaptive Flowlet Load Balancing via Deployment-Friendly Fading Timeout Mechanism
- 25 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (6) , 11591-11606
Hierarchical Optimization-Based Multi-UAV Cooperative Trajectory Planning and Integration of Sensing and Communication
With the rapid development of unmanned aerial vehicle (UAV) technology, UAV-aided integrated sensing and communication (ISAC) systems have become one of the core technologies for next-generation wireless networks. However, in multi-UAV collaborative scenarios, the problem of jointly optimizing trajectory planning and resource allocation for energy management, makespan minimization, and load balancing is inherently a complex mixed- integer nonlinear programming problem. Existing methods fail to strike an effective balance between solution quality, computational efficiency, and scalability. To tackle this challenge, we propose a hierarchical optimization-based multi-UAV collaborative ISAC framework (HO-ISAC), which facilitates efficient multi-UAV collaboration via a two-stage mechanism: offline global trajectory planning and online flight control integrated with resource allocation. In the offline trajectory planning phase, multi-UAV trajectory coordination optimization is achieved through the integration of k-means clustering, simulated annealing, 2-OPT local optimization, and adaptive large neighborhood search techniques. In the online phase, dynamic adjustment of sensing and communication resources is realized through discretized parameter space search. Experimental results demonstrate that HO-ISAC significantly outperforms baseline algorithms in key metrics such as makespan, total energy consumption, and service fairness, while exhibiting excellent scalability and high solving efficiency.
- 25 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (6) , 11591-11606
Hierarchical Optimization-Based Multi-UAV Cooperative Trajectory Planning and Integration of Sensing and Communication
With the rapid development of unmanned aerial vehicle (UAV) technology, UAV-aided integrated sensing and communication (ISAC) systems have become one of the core technologies for next-generation wireless networks. However, in multi-UAV collaborative scenarios, the problem of jointly optimizing trajectory planning and resource allocation for energy management, makespan minimization, and load balancing is inherently a complex mixed- integer nonlinear programming problem. Existing methods fail to strike an effective balance between solution quality, computational efficiency, and scalability. To tackle this challenge, we propose a hierarchical optimization-based multi-UAV collaborative ISAC framework (HO-ISAC), which facilitates efficient multi-UAV collaboration via a two-stage mechanism: offline global trajectory planning and online flight control integrated with resource allocation. In the offline trajectory planning phase, multi-UAV trajectory coordination optimization is achieved through the integration of k-means clustering, simulated annealing, 2-OPT local optimization, and adaptive large neighborhood search techniques. In the online phase, dynamic adjustment of sensing and communication resources is realized through discretized parameter space search. Experimental results demonstrate that HO-ISAC significantly outperforms baseline algorithms in key metrics such as makespan, total energy consumption, and service fairness, while exhibiting excellent scalability and high solving efficiency.
- 11 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (3) , 2087-2098
Graph Self-Supervised Learning via Learnable View Augmentation for Recommender System
In the field of recommender systems, graph neural networks (GNNs) have been extensively applied to collaborative filtering to generate personalized recommendations for users. To solve the problem of lack of observed data and contrasting interactions during representation learning, graph contrastive learning as an effective self-supervised learning (SSL) technique is presented to obtain augmented user and item representations. Nevertheless, most self-supervised approaches to generate recommendation either disrupt the graph structure or node embeddings through random augmentations or introduce augmented SSL information from biased data through heuristic methods. To overcome these challenges, we propose a learnable view augmentation model for collaborative filtering (LACF). Specifically, our framework embeds parameterized learnable view generators layer by layer into the automatic augmentation strategy, thus dynamically optimizing the adaptive augmented views of users and items through the backpropagation of weight gradients. In addition, LACF introduces a multiscale learning strategy that guides the view generator with layer-wise aware optimization and graph-level adaptive augmentation, enabling joint learning of representations with topological heterogeneity and semantic similarity from integrated viewpoint, achieving superior view augmentation. Extensive experiments on realworld datasets demonstrate that our LACF outperforms state-of-the-art baselines. In-depth analysis confirms the advantages of LACF in resistance against noise disturbances, alleviating data sparsity, and improving training efficiency.
- 11 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (3) , 2087-2098
Graph Self-Supervised Learning via Learnable View Augmentation for Recommender System
In the field of recommender systems, graph neural networks (GNNs) have been extensively applied to collaborative filtering to generate personalized recommendations for users. To solve the problem of lack of observed data and contrasting interactions during representation learning, graph contrastive learning as an effective self-supervised learning (SSL) technique is presented to obtain augmented user and item representations. Nevertheless, most self-supervised approaches to generate recommendation either disrupt the graph structure or node embeddings through random augmentations or introduce augmented SSL information from biased data through heuristic methods. To overcome these challenges, we propose a learnable view augmentation model for collaborative filtering (LACF). Specifically, our framework embeds parameterized learnable view generators layer by layer into the automatic augmentation strategy, thus dynamically optimizing the adaptive augmented views of users and items through the backpropagation of weight gradients. In addition, LACF introduces a multiscale learning strategy that guides the view generator with layer-wise aware optimization and graph-level adaptive augmentation, enabling joint learning of representations with topological heterogeneity and semantic similarity from integrated viewpoint, achieving superior view augmentation. Extensive experiments on realworld datasets demonstrate that our LACF outperforms state-of-the-art baselines. In-depth analysis confirms the advantages of LACF in resistance against noise disturbances, alleviating data sparsity, and improving training efficiency.
- Open Access
Limited Reference, Reliable Generation: A Two-Component Framework for Tabular Data Generation in Low-Data Regimes
Synthetic tabular data generation is increasingly essential in data management, supporting downstream applications when real-world and high-quality tabular data is insufficient. Existing tabular generation approaches, such as generative adversarial networks (GANs), diffusion models, and fine-tuned Large Language Models (LLMs), typically require sufficient reference data, limiting their effectiveness in domain-specific databases with scarce records. While prompt-based LLMs offer flexibility without parameter tuning, they often fail to capture dataset-specific feature-label dependencies and generate redundant data, leading to degradation in downstream task performance. To overcome these issues, we propose ReFine, a framework that (i) derives symbolic "if-then" rules from interpretable models and embeds them into prompts to explicitly guide generation toward domain-specific feature distribution, and (ii) applies a dual-granularity filtering strategy that suppresses over-sampling patterns and selectively refines rare but informative samples to reduce distributional imbalance. Extensive experiments on various regression and classification benchmarks demonstrate that ReFine consistently outperforms state-of-the-art methods, achieving up to 0.44 absolute improvement in R-squared for regression and 10.0 percent relative improvement in F1 score for classification tasks.
Open AccessLimited Reference, Reliable Generation: A Two-Component Framework for Tabular Data Generation in Low-Data Regimes
Synthetic tabular data generation is increasingly essential in data management, supporting downstream applications when real-world and high-quality tabular data is insufficient. Existing tabular generation approaches, such as generative adversarial networks (GANs), diffusion models, and fine-tuned Large Language Models (LLMs), typically require sufficient reference data, limiting their effectiveness in domain-specific databases with scarce records. While prompt-based LLMs offer flexibility without parameter tuning, they often fail to capture dataset-specific feature-label dependencies and generate redundant data, leading to degradation in downstream task performance. To overcome these issues, we propose ReFine, a framework that (i) derives symbolic "if-then" rules from interpretable models and embeds them into prompts to explicitly guide generation toward domain-specific feature distribution, and (ii) applies a dual-granularity filtering strategy that suppresses over-sampling patterns and selectively refines rare but informative samples to reduce distributional imbalance. Extensive experiments on various regression and classification benchmarks demonstrate that ReFine consistently outperforms state-of-the-art methods, achieving up to 0.44 absolute improvement in R-squared for regression and 10.0 percent relative improvement in F1 score for classification tasks.