Xiaodong Dong
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
Xiaodong Dong has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Keqiu Li
Tianjin University
5 shared publications - Laiping Zhao
Tianjin University
4 shared publications - Xiaobo Zhou
Tianjin University
4 shared publications - Lihai Nie
College of Cyber Science and the College of Computer Science, Key Laboratory of Data and Intelligent System Security, Ministry of Education, Nankai University, Tianjin, China
3 shared publications - Sheng Chen
Tianjin University
3 shared publications - Tie Qiu
Northeastern University, Shenyang, China
3 shared publications
Latest Publications
- 24 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 560-577
Stinger: A Light-Weight Website Fingerprinting Defense Through Poisoning Packet Sequences
Website Fingerprinting (WF) attack can be mitigated through random camouflage or pair camouflage. Random camouflage inserts random dummy packets into the traces according to pre-defined rules. It can be compromised easily by machine learning-based WF attacks. Pair camouflage obfuscates the distinguishing features of paired websites by inserting elaborated perturbations into raw traces, thereby misleading the attacker. It is costly in maintaining a perturbation generator for each pair of websites. Based on these insights, we propose Stinger, a novel data poisoning based WF defense, which enables effective defense against WF attacks with low bandwidth overhead and only maintains one generator for all websites. Stinger exploits the idea of poisoning by contaminating the model directly in such a way that the WF attacks only classify based on the inserted poison sequences, thus being low overhead and website independent. We experimentally evaluate Stinger using the DF and AWF datasets. The results show that Stinger improves the successful defending rate by an average of 20.37% and 22.83% while reducing overhead by 85.88% and 81.35%, respectively.
- 24 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 560-577
Stinger: A Light-Weight Website Fingerprinting Defense Through Poisoning Packet Sequences
Website Fingerprinting (WF) attack can be mitigated through random camouflage or pair camouflage. Random camouflage inserts random dummy packets into the traces according to pre-defined rules. It can be compromised easily by machine learning-based WF attacks. Pair camouflage obfuscates the distinguishing features of paired websites by inserting elaborated perturbations into raw traces, thereby misleading the attacker. It is costly in maintaining a perturbation generator for each pair of websites. Based on these insights, we propose Stinger, a novel data poisoning based WF defense, which enables effective defense against WF attacks with low bandwidth overhead and only maintains one generator for all websites. Stinger exploits the idea of poisoning by contaminating the model directly in such a way that the WF attacks only classify based on the inserted poison sequences, thus being low overhead and website independent. We experimentally evaluate Stinger using the DF and AWF datasets. The results show that Stinger improves the successful defending rate by an average of 20.37% and 22.83% while reducing overhead by 85.88% and 81.35%, respectively.
- 10 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (3) , 802-816
Viper: Priority-Based High-Visibility Per-Flow Packet Sampling for SDNs
Packet sampling is crucial for managing datacenter networks, serving fault diagnosis, traffic measurement, and intrusion detection functions. However, traditional sampling techniques, such as those based on sketches or ports, either lack packet-level granularity or provide insufficient visibility, leading to functional performance degradation. Recent research has employed the software-defined networking (SDN) model to enable flow-based packet sampling. However, these approaches often introduce substantial control and computation overhead, limiting their scalability. This paper presents Viper, a novel priority-based, high-visibility per-flow packet sampling mechanism tailored to address these challenges. Specifically, Viper leverages existing priority-based traffic scheduling mechanisms to prioritize shorter flows over longer ones. Then, a logical centralized controller orchestrates sampling policies for packets of different priorities. In-depth analysis indicates that the orchestration performed by the controller significantly impacts Viper’s performance. Consequently, we model this process as a nonlinear optimization problem, seeking to maximize the utility of sampling. Then, we propose an online primal-dual interior-point algorithm to address this optimization problem and prove the algorithm’s convergence, optimality, and efficiency. Experimental results show that Viper increases visibility by 3.83% to 8.3%, with negligible control overhead and a substantial reduction in sampling load by at least 20.51%.
- 10 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (3) , 802-816
Viper: Priority-Based High-Visibility Per-Flow Packet Sampling for SDNs
Packet sampling is crucial for managing datacenter networks, serving fault diagnosis, traffic measurement, and intrusion detection functions. However, traditional sampling techniques, such as those based on sketches or ports, either lack packet-level granularity or provide insufficient visibility, leading to functional performance degradation. Recent research has employed the software-defined networking (SDN) model to enable flow-based packet sampling. However, these approaches often introduce substantial control and computation overhead, limiting their scalability. This paper presents Viper, a novel priority-based, high-visibility per-flow packet sampling mechanism tailored to address these challenges. Specifically, Viper leverages existing priority-based traffic scheduling mechanisms to prioritize shorter flows over longer ones. Then, a logical centralized controller orchestrates sampling policies for packets of different priorities. In-depth analysis indicates that the orchestration performed by the controller significantly impacts Viper’s performance. Consequently, we model this process as a nonlinear optimization problem, seeking to maximize the utility of sampling. Then, we propose an online primal-dual interior-point algorithm to address this optimization problem and prove the algorithm’s convergence, optimality, and efficiency. Experimental results show that Viper increases visibility by 3.83% to 8.3%, with negligible control overhead and a substantial reduction in sampling load by at least 20.51%.
- 28 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 36 (2) , 197-211
Slark: A Performance Robust Decentralized Inter-Datacenter Deadline-Aware Coflows Scheduling Framework With Local Information
Inter-datacenter network applications generate massive coflows for purposes, e.g., backup, synchronization, and analytics, with deadline requirements. Decentralized coflow scheduling frameworks are desirable for their scalability in cross-domain deployment but grappling with the challenge of information agnosticism for lack of cross-domain privileges. Current information-agnostic coflow scheduling methods are incompatible with decentralized frameworks for relying on centralized controllers to continuously monitor and learn from coflow global transmission states to infer global coflow information. Alternative methods propose mechanisms for decentralized global coflow information gathering and synchronization. However, they require dedicated physical hardware or control logic, which could be impractical for incremental deployment. This paper proposes Slark, a decentralized deadline-aware coflow scheduling framework, which meets coflows' soft and hard deadline requirements using only local traffic information. It eschews requiring global coflow transmission states and dedicated hardware or control logic by leveraging multiple software-implemented scheduling agents working independently on each node and integrating such information agnosticism into node-specific bandwidth allocation by modeling it as a robust optimization problem with flow information on the other nodes represented as uncertain parameters. Subsequently, we validate the performance robustness of Slark by investigating how perturbations in the optimal objective function value and the associated optimal solution are affected by uncertain parameters. Finally, we propose a firebug-swarm-optimization-based heuristic algorithm to tackle the non-convexity in our problem. Experimental results demonstrate that Slark can significantly enhance transmission revenue and increase soft and hard deadline guarantee ratios by 10.52% and 7.99% on average.
- 28 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 36 (2) , 197-211
Slark: A Performance Robust Decentralized Inter-Datacenter Deadline-Aware Coflows Scheduling Framework With Local Information
Inter-datacenter network applications generate massive coflows for purposes, e.g., backup, synchronization, and analytics, with deadline requirements. Decentralized coflow scheduling frameworks are desirable for their scalability in cross-domain deployment but grappling with the challenge of information agnosticism for lack of cross-domain privileges. Current information-agnostic coflow scheduling methods are incompatible with decentralized frameworks for relying on centralized controllers to continuously monitor and learn from coflow global transmission states to infer global coflow information. Alternative methods propose mechanisms for decentralized global coflow information gathering and synchronization. However, they require dedicated physical hardware or control logic, which could be impractical for incremental deployment. This paper proposes Slark, a decentralized deadline-aware coflow scheduling framework, which meets coflows' soft and hard deadline requirements using only local traffic information. It eschews requiring global coflow transmission states and dedicated hardware or control logic by leveraging multiple software-implemented scheduling agents working independently on each node and integrating such information agnosticism into node-specific bandwidth allocation by modeling it as a robust optimization problem with flow information on the other nodes represented as uncertain parameters. Subsequently, we validate the performance robustness of Slark by investigating how perturbations in the optimal objective function value and the associated optimal solution are affected by uncertain parameters. Finally, we propose a firebug-swarm-optimization-based heuristic algorithm to tackle the non-convexity in our problem. Experimental results demonstrate that Slark can significantly enhance transmission revenue and increase soft and hard deadline guarantee ratios by 10.52% and 7.99% on average.
- 19 August 2023
- Published by Elsevier in Computer Networks
- Vol. 235
Balanar: Balancing deadline guarantee and Jain’s fairness for inter-datacenter transfers
- 19 August 2023
- Published by Elsevier in Computer Networks
- Vol. 235
Balanar: Balancing deadline guarantee and Jain’s fairness for inter-datacenter transfers
- 17 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 19 (9) , 9855-9866
Sublessor: A Cost-Saving Internet Transit Mechanism for Cooperative MEC Providers in Industrial Internet of Things
Mobile edge computing (MEC) is becoming increasingly popular due to its remarkable computing capacities in close proximity to end users or devices. With the widespread use of Industrial Internet of Things, more and more cloud service providers move their services to the edge of the network for a better quality of service and become MEC providers. These MEC providers require to rent wide area network (WAN) connections to transfer industrial data, which is a considerable expense. In this article, we propose a framework called Sublessor to reduce the WAN transmission cost for a group of cooperative MEC providers. The key idea of Sublessor is allowing some specific MEC providers to act as Internet transit brokers, transmitting not only their own network traffic but also the traffic of their partners under a reasonable reselling price. This article formulates the problem as a mixed-integer programming and finds the most suitable broker number and corresponding reselling price without damaging the profit of both brokers and partners by a deep-reinforcement-learning-based algorithm. Experimental results show that our algorithm can significantly reduce the traffic transmission cost by up to 35%.
- 17 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 19 (9) , 9855-9866
Sublessor: A Cost-Saving Internet Transit Mechanism for Cooperative MEC Providers in Industrial Internet of Things
Mobile edge computing (MEC) is becoming increasingly popular due to its remarkable computing capacities in close proximity to end users or devices. With the widespread use of Industrial Internet of Things, more and more cloud service providers move their services to the edge of the network for a better quality of service and become MEC providers. These MEC providers require to rent wide area network (WAN) connections to transfer industrial data, which is a considerable expense. In this article, we propose a framework called Sublessor to reduce the WAN transmission cost for a group of cooperative MEC providers. The key idea of Sublessor is allowing some specific MEC providers to act as Internet transit brokers, transmitting not only their own network traffic but also the traffic of their partners under a reasonable reselling price. This article formulates the problem as a mixed-integer programming and finds the most suitable broker number and corresponding reselling price without damaging the profit of both brokers and partners by a deep-reinforcement-learning-based algorithm. Experimental results show that our algorithm can significantly reduce the traffic transmission cost by up to 35%.
- 15 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 9 (2) , 507-520
LINA: A Fair Link-Grained Inter-Datacenter Traffic Scheduling Method With Deadline Guarantee
Inter-datacenter networks take the role of connecting edge clusters and datacenters distributed globally. Nowadays, inter-datacenter network topologies are becoming more and more complicated with multiple links on each path, multiple paths between two datacenters, and overlaps between different paths. Hence, a link-grained scheduling method is necessary for making routing decisions and bandwidth allocation strategies when scheduling inter-datacenter transfers. For inter-datacenter transfers, deadline guarantee and fairness are essential and conflict requirements. Unfair preemptive scheduling methods ensure deadlines but cause starvation and service interference problems, while fairly sharing bandwidth among transfers ensures fairness but causes deadlines missed. However, a link-grained scheduling method simultaneously ensuring these two conflicting objectives is still missing. In this paper, a centralized controller, called LINA, is proposed to find fair link-grained bandwidth allocation strategies, which ensure transfers can compete fairly with each other for bandwidth on links and guarantee their deadlines in the meanwhile. First, we formulate the competition among transfers as a bottleneck routing game and prove the existence and non-uniqueness of its Nash Equilibrium, which is also the optimal bandwidth allocation strategy. Then, we propose a deep reinforcement learning based algorithm to derive it. Finally, experimental results show that LINA achieves superior performance than state-of-the-art methods in terms of fairness by 50%.
- 15 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 9 (2) , 507-520
LINA: A Fair Link-Grained Inter-Datacenter Traffic Scheduling Method With Deadline Guarantee
Inter-datacenter networks take the role of connecting edge clusters and datacenters distributed globally. Nowadays, inter-datacenter network topologies are becoming more and more complicated with multiple links on each path, multiple paths between two datacenters, and overlaps between different paths. Hence, a link-grained scheduling method is necessary for making routing decisions and bandwidth allocation strategies when scheduling inter-datacenter transfers. For inter-datacenter transfers, deadline guarantee and fairness are essential and conflict requirements. Unfair preemptive scheduling methods ensure deadlines but cause starvation and service interference problems, while fairly sharing bandwidth among transfers ensures fairness but causes deadlines missed. However, a link-grained scheduling method simultaneously ensuring these two conflicting objectives is still missing. In this paper, a centralized controller, called LINA, is proposed to find fair link-grained bandwidth allocation strategies, which ensure transfers can compete fairly with each other for bandwidth on links and guarantee their deadlines in the meanwhile. First, we formulate the competition among transfers as a bottleneck routing game and prove the existence and non-uniqueness of its Nash Equilibrium, which is also the optimal bandwidth allocation strategy. Then, we propose a deep reinforcement learning based algorithm to derive it. Finally, experimental results show that LINA achieves superior performance than state-of-the-art methods in terms of fairness by 50%.
- 21 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (7) , 6271-6285
AutoInfer: Self-Driving Management for Resource-Efficient, SLO-Aware Machine=Learning Inference in GPU Clusters
As Internet of Things (IoT) keeps growing, IoT-side intelligence services, such as intelligent personal assistant, healthcare surveillance, and smart home service, offload more and more complex machine-learning (ML) inference workloads to cloud clusters. GPUs have been widely adopted to accelerate the execution of these ML inference workloads. However, current cluster management systems guarantee low tail latency for ML inferences using resource over-provisioning and small batch sizes, resulting in a serious waste of GPU resources and increasing the service costs greatly. To mitigate poor GPU utilization, we present AutoInfer, a self-driving cluster management system for ML inference serving in GPU clusters, where users express only the latency and accuracy requirements for their workloads without needing to specify the model variant, GPU provisioning strategy, and batching mechanism. AutoInfer extends the matrix factorization model to automatically recommend model variants for each new incoming ML inference workload with respect to latency and accuracy requirements, by identifying similarities to previously scheduled workloads. During runtime, AutoInfer leverages online telemetry data and deep reinforcement learning to adaptively adjust the GPU allocation and batch size to account for load variations while minimizing the effects on tail latency service level objectives (SLOs). Testbed experiments show that AutoInfer is able to improve the average GPU utilization by up to 77% and keep the tail latency SLO violations under 5.5%.
- 21 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (7) , 6271-6285
AutoInfer: Self-Driving Management for Resource-Efficient, SLO-Aware Machine=Learning Inference in GPU Clusters
As Internet of Things (IoT) keeps growing, IoT-side intelligence services, such as intelligent personal assistant, healthcare surveillance, and smart home service, offload more and more complex machine-learning (ML) inference workloads to cloud clusters. GPUs have been widely adopted to accelerate the execution of these ML inference workloads. However, current cluster management systems guarantee low tail latency for ML inferences using resource over-provisioning and small batch sizes, resulting in a serious waste of GPU resources and increasing the service costs greatly. To mitigate poor GPU utilization, we present AutoInfer, a self-driving cluster management system for ML inference serving in GPU clusters, where users express only the latency and accuracy requirements for their workloads without needing to specify the model variant, GPU provisioning strategy, and batching mechanism. AutoInfer extends the matrix factorization model to automatically recommend model variants for each new incoming ML inference workload with respect to latency and accuracy requirements, by identifying similarities to previously scheduled workloads. During runtime, AutoInfer leverages online telemetry data and deep reinforcement learning to adaptively adjust the GPU allocation and batch size to account for load variations while minimizing the effects on tail latency service level objectives (SLOs). Testbed experiments show that AutoInfer is able to improve the average GPU utilization by up to 77% and keep the tail latency SLO violations under 5.5%.
- 19 July 2022
- Published by Elsevier in Computer Networks
- Vol. 214
Slardar: Scheduling information incomplete inter-datacenter deadline-aware coflows with a decentralized framework
- 19 July 2022
- Published by Elsevier in Computer Networks
- Vol. 214
Slardar: Scheduling information incomplete inter-datacenter deadline-aware coflows with a decentralized framework
- 1 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 10 (3) , 1913-1924
Learning-Driven Cloud Resource Provision Policy for Content Providers With Competitor
The cloud resource provision policy of a content provider in the presence of competitors on globally distributed cloud platforms plays a significant role in maximizing its profit. However, developing an optimal resource provision policy is quite challenging, due to the difficult to capture the competition relationship between two competitive CPs and to obtain the budget of the competitors which is usually kept private. To solve this problem, in this paper, we propose a learning-driven cloud resource provision policy for a CP with competitors. We formulate the competition between the CPs as a lottery Colonel Blotto game in which the payoff of each region is positively related to the resource advantage achieved by the CP, formulate the budget allocation problem as a Markov decision process, and obtain the sub-optimal resource provision policy by reinforcement learning and deep reinforcement learning-based algorithms. We also prove the convergence of the sub-optimal solution. Finally, we validate our proposed method using real-world CPs statistics. The results show that the budget information is critical for a CP to make policy decisions, and it is better for CPs with smaller budget to focus their budget resources in regions with higher values.
- 1 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 10 (3) , 1913-1924
Learning-Driven Cloud Resource Provision Policy for Content Providers With Competitor
The cloud resource provision policy of a content provider in the presence of competitors on globally distributed cloud platforms plays a significant role in maximizing its profit. However, developing an optimal resource provision policy is quite challenging, due to the difficult to capture the competition relationship between two competitive CPs and to obtain the budget of the competitors which is usually kept private. To solve this problem, in this paper, we propose a learning-driven cloud resource provision policy for a CP with competitors. We formulate the competition between the CPs as a lottery Colonel Blotto game in which the payoff of each region is positively related to the resource advantage achieved by the CP, formulate the budget allocation problem as a Markov decision process, and obtain the sub-optimal resource provision policy by reinforcement learning and deep reinforcement learning-based algorithms. We also prove the convergence of the sub-optimal solution. Finally, we validate our proposed method using real-world CPs statistics. The results show that the budget information is critical for a CP to make policy decisions, and it is better for CPs with smaller budget to focus their budget resources in regions with higher values.
- 16 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 10 (1) , 202-215
An Online Cost-Efficient Transmission Scheme for Information-Agnostic Traffic in Inter-Datacenter Networks
In the era of cloud computing, network services are deployed on geographically distributed cloud platforms, which results in a large amount of inter-datacenter traffic. Multi-tier pricing schemes are widely adopted by cloud service providers (CSPs) to charge cloud users for inter-datacenter transmission services. To avoid a severe penalty associated with missing a deadline, cloud users are prone to selecting a sufficiently high service level. However, they are usually unaware of the total traffic volume before accessing the network; hence, a high transmission cost is introduced. In this paper, we propose an online cost-efficient transmission scheme for cloud users with information-agnostic traffic. The basic idea is to split a long-term transmission request into a series of short-term ones. In this scheme, we take into account the CSP's countermeasures, and model the interactions between the cloud users and the CSP as a Stackelberg game. We show that the optimal number of short-term requests and the associated transmission service levels can be determined with an online algorithm based on Lyapunov optimization. The experimental results reveal that the CSP and the cloud users can achieve a win-win outcome, whereby the transmission cost of cloud users can be reduced by 59%.
- 16 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 10 (1) , 202-215
An Online Cost-Efficient Transmission Scheme for Information-Agnostic Traffic in Inter-Datacenter Networks
In the era of cloud computing, network services are deployed on geographically distributed cloud platforms, which results in a large amount of inter-datacenter traffic. Multi-tier pricing schemes are widely adopted by cloud service providers (CSPs) to charge cloud users for inter-datacenter transmission services. To avoid a severe penalty associated with missing a deadline, cloud users are prone to selecting a sufficiently high service level. However, they are usually unaware of the total traffic volume before accessing the network; hence, a high transmission cost is introduced. In this paper, we propose an online cost-efficient transmission scheme for cloud users with information-agnostic traffic. The basic idea is to split a long-term transmission request into a series of short-term ones. In this scheme, we take into account the CSP's countermeasures, and model the interactions between the cloud users and the CSP as a Stackelberg game. We show that the optimal number of short-term requests and the associated transmission service levels can be determined with an online algorithm based on Lyapunov optimization. The experimental results reveal that the CSP and the cloud users can achieve a win-win outcome, whereby the transmission cost of cloud users can be reduced by 59%.