Xianming Gao
Research Subjects
Xianming Gao has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Tao Feng
Institute of System Engineering AMS PLA
3 shared publications Baosheng Wang
National University of Defense Technology
2 shared publications- Guang Cheng
School of Cyber Science and Engineering, Southeast University, Nanjing 211189, China
1 shared publication - Jiaqi Lin
Beijing University of Posts and Telecommunications
1 shared publication - Kexian Liu
Beijing University of Posts and Telecommunications
1 shared publication - Lin Yang
Systems Engineering Research Institute, Academy of Military Sciences, Beijing, China
1 shared publication
Latest Publications
- Open Access
- 21 February 2025
- Published by Association for Computing Machinery (ACM)
- p. 108-114
GraphSynth: Synthesis of Network Configuration Templates Using Large Language Models
- 21 February 2025
- Published by Association for Computing Machinery (ACM)
- p. 108-114
Open AccessGraphSynth: Synthesis of Network Configuration Templates Using Large Language Models
- Open Access
- 10 July 2023
- Published by MDPI AG in Electronics
- Vol. 12 (14) , 3023
Packet Reordering in the Era of 6G: Techniques, Challenges, and Applications
The advent of sixth-generation (6G) networks brings unmatched speed, reliability, and capacity for massive connections, making it a cornerstone for revolutionary applications. One such application is in vehicular networks, which have their unique demands and complexities. Specifically, they face the complex issue of packet reordering due to the high-speed movement of vehicles and frequent switching of network connections. This paper examines the impact and causes of packet reordering, its threats to network efficiency, and potential countermeasures, particularly in the context of 6G-enabled vehicular networks. We introduce end-to-end methods and metrics to address packet reordering in 6G, discussing the development trends and application prospects. Our findings highlight the emergence of sophisticated strategies, such as prediction and avoidance, to manage packet reordering. They also reveal potential applications to boost network reliability, emulate traffic distributions, and enhance data security. Furthermore, we anticipate a growing integration of machine learning and data-driven optimization in tackling packet reordering. The insights provided aim to influence the future design and optimization of 6G networks, particularly concerning packet management and performance. This paper aims to assist researchers and practitioners in effectively leveraging packet reordering to promote efficient and secure operations of future 6G networks.
- 10 July 2023
- Published by MDPI AG in Electronics
- Vol. 12 (14) , 3023
Open AccessPacket Reordering in the Era of 6G: Techniques, Challenges, and Applications
The advent of sixth-generation (6G) networks brings unmatched speed, reliability, and capacity for massive connections, making it a cornerstone for revolutionary applications. One such application is in vehicular networks, which have their unique demands and complexities. Specifically, they face the complex issue of packet reordering due to the high-speed movement of vehicles and frequent switching of network connections. This paper examines the impact and causes of packet reordering, its threats to network efficiency, and potential countermeasures, particularly in the context of 6G-enabled vehicular networks. We introduce end-to-end methods and metrics to address packet reordering in 6G, discussing the development trends and application prospects. Our findings highlight the emergence of sophisticated strategies, such as prediction and avoidance, to manage packet reordering. They also reveal potential applications to boost network reliability, emulate traffic distributions, and enhance data security. Furthermore, we anticipate a growing integration of machine learning and data-driven optimization in tackling packet reordering. The insights provided aim to influence the future design and optimization of 6G networks, particularly concerning packet management and performance. This paper aims to assist researchers and practitioners in effectively leveraging packet reordering to promote efficient and secure operations of future 6G networks.
- Open Access
- 12 April 2022
- Published by Wiley in Security and Communication Networks
- Vol. 2022, 1-16
BSD-Guard: A Collaborative Blockchain-Based Approach for Detection and Mitigation of SDN-Targeted DDoS Attacks
Software-Defined Networking (SDN) enhances the flexibility and programmability of networks by separating control plane and data plane. The logically centralized control mechanism makes the control plane vulnerable in both single and multiple controller scenarios. Malicious third parties can exploit vulnerabilities of reactive forwarding mode to launch distributed denial-of-service (DDoS) attacks against SDN controllers. Unfortunately, existing DoS/DDoS solutions under single controller can not afford effective performance under multiple controllers due to the absence of cooperative detection and mitigation. To solve the above problem, we propose a blockchain-based SDN-targeted DDoS defense framework (BSD-Guard) that can provide cooperative detection and mitigation mechanism to protect SDN controllers. BSD-Guard introduces a blockchain-based secure middle plane between control plane and data plane. The secure middle plane calculates the suspect rate of new flows based on the collected packets’ information and reports suspect lists to blockchain for immutably storing and sharing. Besides, the smart contract deployed on blockchain in advance constitutes collaborative defense strategies based on the suspect lists reported from multiple SDN domains. When receiving defense strategies, the secure middle plane converts them to specific flow table actions and installs actions into relevant switches. The experimental results indicate that BSD-Guard can efficiently detect DoS/DDoS attacks in multiple controllers scenario and issue precise defensive strategies near the source of attack by identifying the attack path.
- 12 April 2022
- Published by Wiley in Security and Communication Networks
- Vol. 2022, 1-16
Open AccessBSD-Guard: A Collaborative Blockchain-Based Approach for Detection and Mitigation of SDN-Targeted DDoS Attacks
Software-Defined Networking (SDN) enhances the flexibility and programmability of networks by separating control plane and data plane. The logically centralized control mechanism makes the control plane vulnerable in both single and multiple controller scenarios. Malicious third parties can exploit vulnerabilities of reactive forwarding mode to launch distributed denial-of-service (DDoS) attacks against SDN controllers. Unfortunately, existing DoS/DDoS solutions under single controller can not afford effective performance under multiple controllers due to the absence of cooperative detection and mitigation. To solve the above problem, we propose a blockchain-based SDN-targeted DDoS defense framework (BSD-Guard) that can provide cooperative detection and mitigation mechanism to protect SDN controllers. BSD-Guard introduces a blockchain-based secure middle plane between control plane and data plane. The secure middle plane calculates the suspect rate of new flows based on the collected packets’ information and reports suspect lists to blockchain for immutably storing and sharing. Besides, the smart contract deployed on blockchain in advance constitutes collaborative defense strategies based on the suspect lists reported from multiple SDN domains. When receiving defense strategies, the secure middle plane converts them to specific flow table actions and installs actions into relevant switches. The experimental results indicate that BSD-Guard can efficiently detect DoS/DDoS attacks in multiple controllers scenario and issue precise defensive strategies near the source of attack by identifying the attack path.
- Open Access
- 26 July 2016
- Published by Wiley in Scientific Programming
- Vol. 2016, 1-14
VR-Cluster: Dynamic Migration for Resource Fragmentation Problem in Virtual Router Platform
Network virtualization technology is regarded as one of gradual schemes to network architecture evolution. With the development of network functions virtualization, operators make lots of effort to achieve router virtualization by using general servers. In order to ensure high performance, virtual router platform usually adopts a cluster of general servers, which can be also regarded as a special cloud computing environment. However, due to frequent creation and deletion of router instances, it may generate lots of resource fragmentation to prevent platform from establishing new router instances. In order to solve “resource fragmentation problem,” we firstly propose VR-Cluster, which introduces two extra function planes including switching plane and resource management plane. Switching plane is mainly used to support seamless migration of router instances without packet loss; resource management plane can dynamically move router instances from one server to another server by using VR-mapping algorithms. Besides, three VR-mapping algorithms including first-fit mapping algorithm, best-fit mapping algorithm, and worst-fit mapping algorithm are proposed based on VR-Cluster. At last, we establish VR-Cluster protosystem by using general X86 servers, evaluate its migration time, and further analyze advantages and disadvantages of our proposed VR-mapping algorithms to solve resource fragmentation problem.
- 26 July 2016
- Published by Wiley in Scientific Programming
- Vol. 2016, 1-14
Open AccessVR-Cluster: Dynamic Migration for Resource Fragmentation Problem in Virtual Router Platform
Network virtualization technology is regarded as one of gradual schemes to network architecture evolution. With the development of network functions virtualization, operators make lots of effort to achieve router virtualization by using general servers. In order to ensure high performance, virtual router platform usually adopts a cluster of general servers, which can be also regarded as a special cloud computing environment. However, due to frequent creation and deletion of router instances, it may generate lots of resource fragmentation to prevent platform from establishing new router instances. In order to solve “resource fragmentation problem,” we firstly propose VR-Cluster, which introduces two extra function planes including switching plane and resource management plane. Switching plane is mainly used to support seamless migration of router instances without packet loss; resource management plane can dynamically move router instances from one server to another server by using VR-mapping algorithms. Besides, three VR-mapping algorithms including first-fit mapping algorithm, best-fit mapping algorithm, and worst-fit mapping algorithm are proposed based on VR-Cluster. At last, we establish VR-Cluster protosystem by using general X86 servers, evaluate its migration time, and further analyze advantages and disadvantages of our proposed VR-mapping algorithms to solve resource fragmentation problem.