Dongsheng Qian
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Dongsheng Qian has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Jia Chen
Beijing Jiaotong University
6 shared publications - Shang Liu
Beijing Jiaotong University
6 shared publications - Xu Huang
Beijing Jiaotong University
6 shared publications - Chenxi Liao
Beijing Jiaotong University
5 shared publications - Deyun Gao
National Engineering Research Center of Advanced Network Technologies, School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, China
3 shared publications - Chengxiao Yu
Peng Cheng Laboratory, Shenzhen, China
2 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (22) , 53509-53526
FG-MDTS: Flow Group-Aware Mixed Deterministic Transmission and Scheduling for Diverse Holographic Streaming
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (22) , 53509-53526
FG-MDTS: Flow Group-Aware Mixed Deterministic Transmission and Scheduling for Diverse Holographic Streaming
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 14 (1) , 259-275
GCNCO: Graph Attention-Driven Offloading and Orchestration via Computing and Networking Coordination for Holographic Services
As an important support of next-generation network technologies, edge computing provides crucial support for holographic communication services (HCSs) by offering low latency and high computing power. However, in resource-constrained environments, the deployment of HCSs is significantly affected by the coordinated scheduling of computational and transmission resources, as well as the selection of multi-task processing ratios, which in turn curtails service latency and user experience. For this purpose, this paper proposes an efficient edge network offloading and orchestration framework that jointly optimizes adaptive video processing, multi-task offloading, and resource allocation strategies. Specifically, we model computation offloading and video processing as a stochastic optimization problem to maximize system utility, which is defined as a weighted difference between network satisfaction and user utility. Based on Lyapunov optimization theory, the original long-term optimization problem is decomposed into single time slot subproblem, and further reformulated as a Markov Decision Process (MDP). To effectively solve this problem, we design a Graph attention-driven Computing and Networking Coordination based policy optimization Orchestration algorithm (GCNCO). The multi-dimensional policy joint optimization is achieved by fully sensing the contextual relationship of services and network state distribution. Finally, we compare the proposed algorithm with several benchmark algorithms and validate it using a prototype system. Experimental results demonstrate that GCNCO outperforms existing approaches in terms of convergence speed and performance stability, significantly enhancing system utility and improving the success performance of HCS orchestration.
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 14 (1) , 259-275
GCNCO: Graph Attention-Driven Offloading and Orchestration via Computing and Networking Coordination for Holographic Services
As an important support of next-generation network technologies, edge computing provides crucial support for holographic communication services (HCSs) by offering low latency and high computing power. However, in resource-constrained environments, the deployment of HCSs is significantly affected by the coordinated scheduling of computational and transmission resources, as well as the selection of multi-task processing ratios, which in turn curtails service latency and user experience. For this purpose, this paper proposes an efficient edge network offloading and orchestration framework that jointly optimizes adaptive video processing, multi-task offloading, and resource allocation strategies. Specifically, we model computation offloading and video processing as a stochastic optimization problem to maximize system utility, which is defined as a weighted difference between network satisfaction and user utility. Based on Lyapunov optimization theory, the original long-term optimization problem is decomposed into single time slot subproblem, and further reformulated as a Markov Decision Process (MDP). To effectively solve this problem, we design a Graph attention-driven Computing and Networking Coordination based policy optimization Orchestration algorithm (GCNCO). The multi-dimensional policy joint optimization is achieved by fully sensing the contextual relationship of services and network state distribution. Finally, we compare the proposed algorithm with several benchmark algorithms and validate it using a prototype system. Experimental results demonstrate that GCNCO outperforms existing approaches in terms of convergence speed and performance stability, significantly enhancing system utility and improving the success performance of HCS orchestration.
- 23 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 12 (6) , 4611-4626
DT-CNST: Deterministic Transmission Based on Computing-Network-Storage Resources Tradeoff for Real-Time Holographic-Type Communication
With the rise of the Metaverse, Real-time Holographic-type Communication (HTC) has emerged as a promising approach to creating immersive experiences. In HTC, Motion-to-Photon (MTP) latency, which is composed of computing, network and storage latency, must be ultra-low and bounded to avoid vertigo syndrome. Time Sensitive Networks (TSN) and Deterministic Networks (DetNet) are generally adopted to ensure deterministic transmission with ultra-low bounded latency. However, the transmission of HTC streaming faces computing latency fluctuation and requires high bandwidth, which exceeds the capabilities of TSN and DetNet. Therefore, to address these limitations, this paper proposes Deterministic Transmission based on Computing-Network-Storage Resources Tradeoff (DT-CNST). In DT-CNST, a Computing-based Traffic Shaper is proposed to eliminate computing latency fluctuation. A Cyclic Buffering, Queuing and Forwarding mechanism is also designed to ensure deterministic transmission of large frames. Moreover, a Computing-Network-Storage (CNS) model is established, incorporating constraints and a resource tradeoff optimization. Based on the CNS model, the Hybrid PPO-Greedy Resource Tradeoff (HPG-RT) algorithm is developed to maximize the number of scheduled streams. Simulation results show that HPG-RT achieves a schedulability rate of 90.7%, outperforming benchmarks with a maximum improvement of 35.5%. Prototype results confirm that DT-CNST provides an immersive experience with at least 25 frames per second.
- 23 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 12 (6) , 4611-4626
DT-CNST: Deterministic Transmission Based on Computing-Network-Storage Resources Tradeoff for Real-Time Holographic-Type Communication
With the rise of the Metaverse, Real-time Holographic-type Communication (HTC) has emerged as a promising approach to creating immersive experiences. In HTC, Motion-to-Photon (MTP) latency, which is composed of computing, network and storage latency, must be ultra-low and bounded to avoid vertigo syndrome. Time Sensitive Networks (TSN) and Deterministic Networks (DetNet) are generally adopted to ensure deterministic transmission with ultra-low bounded latency. However, the transmission of HTC streaming faces computing latency fluctuation and requires high bandwidth, which exceeds the capabilities of TSN and DetNet. Therefore, to address these limitations, this paper proposes Deterministic Transmission based on Computing-Network-Storage Resources Tradeoff (DT-CNST). In DT-CNST, a Computing-based Traffic Shaper is proposed to eliminate computing latency fluctuation. A Cyclic Buffering, Queuing and Forwarding mechanism is also designed to ensure deterministic transmission of large frames. Moreover, a Computing-Network-Storage (CNS) model is established, incorporating constraints and a resource tradeoff optimization. Based on the CNS model, the Hybrid PPO-Greedy Resource Tradeoff (HPG-RT) algorithm is developed to maximize the number of scheduled streams. Simulation results show that HPG-RT achieves a schedulability rate of 90.7%, outperforming benchmarks with a maximum improvement of 35.5%. Prototype results confirm that DT-CNST provides an immersive experience with at least 25 frames per second.
- 11 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 12, 497-511
JRLAO: Joint Resource and Latency-Aware SFC Optimized Orchestration in NFV-Enabled Networks
Emerging applications such as holographic communications and smart medical care are driving the rapid evolution of future networks. In the network architecture enabled by software defined networking and network function virtualization, service function chaining (SFC), which orderly schedules various virtual network functions (VNFs), is one of the primary methods to provide flexible, agile, and diversified network services. However, these emerging applications face dual challenges of resource allocation and low latency requirements. To address this issue, in this paper, we propose a joint resource and latency-aware based SFC optimization orchestration approach for emerging applications that are delay-sensitive and computation-intensive, establishing a resource-aware scheduling model based on discrete time. The problem is described as an integer linear programming problem with QoS as the optimization objective. Furthermore, we present a deep reinforcement learning based optimal orchestration algorithm for simultaneous VNF embedding and flow routing, the core idea of “joint resource and latency awareness” is applied to realize the scheduling of delay-sensitive services. Finally, the proposed approach is compared with four benchmark algorithms. Experimental results indicate that the proposed approach can enhance QoS, achieve a greater acceptance rate, and complete the scheduling of more delay-sensitive services.
- 11 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 12, 497-511
JRLAO: Joint Resource and Latency-Aware SFC Optimized Orchestration in NFV-Enabled Networks
Emerging applications such as holographic communications and smart medical care are driving the rapid evolution of future networks. In the network architecture enabled by software defined networking and network function virtualization, service function chaining (SFC), which orderly schedules various virtual network functions (VNFs), is one of the primary methods to provide flexible, agile, and diversified network services. However, these emerging applications face dual challenges of resource allocation and low latency requirements. To address this issue, in this paper, we propose a joint resource and latency-aware based SFC optimization orchestration approach for emerging applications that are delay-sensitive and computation-intensive, establishing a resource-aware scheduling model based on discrete time. The problem is described as an integer linear programming problem with QoS as the optimization objective. Furthermore, we present a deep reinforcement learning based optimal orchestration algorithm for simultaneous VNF embedding and flow routing, the core idea of “joint resource and latency awareness” is applied to realize the scheduling of delay-sensitive services. Finally, the proposed approach is compared with four benchmark algorithms. Experimental results indicate that the proposed approach can enhance QoS, achieve a greater acceptance rate, and complete the scheduling of more delay-sensitive services.
- Open Access
- 4 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 41-47
CollaSFC: An Intelligent Collaborative Approach for In-network SFC Failure Detection in Data Center for AI Computing
The successful application cases of Large Language Models (LLMs) and Machine Learning (ML) are driving traditional data centers to transform into intelligent computing data centers characterized by low latency, high bandwidth, high reliability, and zero packet loss. The demand for immense computing and ultra-low latency suggests that in-network computing (INC) may be a viable solution, such as In-network aggregation (INA). INA involves a hierarchical structure of switches and servers to form different Service Function Chains (SFCs) including switches, servers, physical links, and virtual links for accomplishing model training. However, the aggregation of heavy traffic in CTCs tends to a sudden and drastic increase in a specific node, greatly increasing the likelihood of node failure. To detect SFC failure in real time, we propose an in-network SFC failure detection approach based on INC. We introduce digital twins (DT) and propose a collaborative AI framework based on the data plane and control plane to avoid model overfitting. In addition, to reduce the computing consumption, we propose the concept of "multiple SFC chains multiple models" to customize each SFC failure detection model and validate the mechanism on a BMv2-based prototype, which implements a high-accuracy failure detection with minor performance degradation.
- 4 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 41-47
Open AccessCollaSFC: An Intelligent Collaborative Approach for In-network SFC Failure Detection in Data Center for AI Computing
The successful application cases of Large Language Models (LLMs) and Machine Learning (ML) are driving traditional data centers to transform into intelligent computing data centers characterized by low latency, high bandwidth, high reliability, and zero packet loss. The demand for immense computing and ultra-low latency suggests that in-network computing (INC) may be a viable solution, such as In-network aggregation (INA). INA involves a hierarchical structure of switches and servers to form different Service Function Chains (SFCs) including switches, servers, physical links, and virtual links for accomplishing model training. However, the aggregation of heavy traffic in CTCs tends to a sudden and drastic increase in a specific node, greatly increasing the likelihood of node failure. To detect SFC failure in real time, we propose an in-network SFC failure detection approach based on INC. We introduce digital twins (DT) and propose a collaborative AI framework based on the data plane and control plane to avoid model overfitting. In addition, to reduce the computing consumption, we propose the concept of "multiple SFC chains multiple models" to customize each SFC failure detection model and validate the mechanism on a BMv2-based prototype, which implements a high-accuracy failure detection with minor performance degradation.
- 1 January 2022
- Published by Springer Nature
- p. 408-419
Security Association Model: Interdisciplinary Application of 5G Positioning Technology and Social Network
- 1 January 2022
- Published by Springer Nature
- p. 408-419
Security Association Model: Interdisciplinary Application of 5G Positioning Technology and Social Network