Sen Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sen Wang has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Jianfeng Ma
Xidian University
2 shared publications - Xinghua Li
Xidian University
2 shared publications - Zhongyuan Jiang
School of Cyber Engineering and the State Key Laboratory of Integrated Services Networks, Xidian University, Xian, Shaanxi, China
2 shared publications
Latest Publications
- 16 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 32 (4) , 3347-3360
K-Backup: Load- and TCAM-Aware Multi-Backup Fast Failure Recovery in SDNs
The Proactive Recovery (PR) mechanism in Software-Defined Networking (SDN) provides good failure recovery resilience for the Beyond Fifth-Generation/Sixth-Generation (B5G/6G) delay-sensitive applications. However, PR’s fixed single backup path policy for any flow and fine-grained backup forwarding rule configuration poses severe challenges for post-recovery congestion management and limited Ternary Content Addressable Memory (TCAM) space in SDN switches. To this end, we propose K-backup, a load-and TCAM-aware multi-backup fast failure recovery scheme for SDNs. Firstly, K-backup formulates and solves the congestion-aware multi-backup path planning problem for various failure scenarios, exploiting the inherent load diversity of multi-backup paths to minimize the post-recovery maximum link utilization. Secondly, K-backup aggregates flows sharing the same backup-path-weight pair on a link into a cascading table of Fast-Failover and SELECT groups. Meanwhile, each outputted backup path is labeled, and a corresponding label-matching flow table is configured for each intermediate switch to aggregate all flows on that path. Thirdly, K-backup dynamically adjusts the backup path update period based on the network load stabilization to reduce unnecessary controller overhead. Compared with state-of-the-art, K-backup achieves the lowest controller overhead, the best load balancing performance, the near-fewest TCAM space usage, and the near-shortest recovery time.
- 16 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 32 (4) , 3347-3360
K-Backup: Load- and TCAM-Aware Multi-Backup Fast Failure Recovery in SDNs
The Proactive Recovery (PR) mechanism in Software-Defined Networking (SDN) provides good failure recovery resilience for the Beyond Fifth-Generation/Sixth-Generation (B5G/6G) delay-sensitive applications. However, PR’s fixed single backup path policy for any flow and fine-grained backup forwarding rule configuration poses severe challenges for post-recovery congestion management and limited Ternary Content Addressable Memory (TCAM) space in SDN switches. To this end, we propose K-backup, a load-and TCAM-aware multi-backup fast failure recovery scheme for SDNs. Firstly, K-backup formulates and solves the congestion-aware multi-backup path planning problem for various failure scenarios, exploiting the inherent load diversity of multi-backup paths to minimize the post-recovery maximum link utilization. Secondly, K-backup aggregates flows sharing the same backup-path-weight pair on a link into a cascading table of Fast-Failover and SELECT groups. Meanwhile, each outputted backup path is labeled, and a corresponding label-matching flow table is configured for each intermediate switch to aggregate all flows on that path. Thirdly, K-backup dynamically adjusts the backup path update period based on the network load stabilization to reduce unnecessary controller overhead. Compared with state-of-the-art, K-backup achieves the lowest controller overhead, the best load balancing performance, the near-fewest TCAM space usage, and the near-shortest recovery time.
- 16 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (10) , 18663-18675
MLDR: An O(|V|/4) and Near-Optimal Routing Scheme for LEO Mega-Constellations
Low Earth Orbit (LEO) mega-constellations enable the Internet of Things (IoT) industry to realize the vision of integrated space-air-ground-sea communication networks under B5G and 6G. However, due to the high complexity of O(|V|log|V|+|E|) of Dijkstra’s algorithm, existing LEO mega-constellations suffer from excessive routing reconvergence time under frequent topology changes caused by satellite-ground station link handovers and network failures. To this end, we propose MLDR, a Manhattan-like topology-and Low ISL Delay-based Routing scheme with an ultra-low routing complexity of O(|V|4) while maintaining near-optimal routing. Firstly, for any source satellite, MLDR divides the Manhattan-like topology of LEO mega-constellations into four non-interfering Minimum Hop (MH) areas. Secondly, MLDR concurrently and non-repeatedly computes MH paths for all destinations within each MH area and installs routing tables. Thirdly, MLDR incrementally computes and updates the MH paths by more optimal MH detour paths, which select other neighboring satellites as relaying nodes. Finally, by conducting extensive simulations on real-world LEO mega-constellations, our MLDR outperforms all state-of-the-art schemes by remarkably reducing reconvergence time and achieving the highest routing optimality.
- 16 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (10) , 18663-18675
MLDR: An O(|V|/4) and Near-Optimal Routing Scheme for LEO Mega-Constellations
Low Earth Orbit (LEO) mega-constellations enable the Internet of Things (IoT) industry to realize the vision of integrated space-air-ground-sea communication networks under B5G and 6G. However, due to the high complexity of O(|V|log|V|+|E|) of Dijkstra’s algorithm, existing LEO mega-constellations suffer from excessive routing reconvergence time under frequent topology changes caused by satellite-ground station link handovers and network failures. To this end, we propose MLDR, a Manhattan-like topology-and Low ISL Delay-based Routing scheme with an ultra-low routing complexity of O(|V|4) while maintaining near-optimal routing. Firstly, for any source satellite, MLDR divides the Manhattan-like topology of LEO mega-constellations into four non-interfering Minimum Hop (MH) areas. Secondly, MLDR concurrently and non-repeatedly computes MH paths for all destinations within each MH area and installs routing tables. Thirdly, MLDR incrementally computes and updates the MH paths by more optimal MH detour paths, which select other neighboring satellites as relaying nodes. Finally, by conducting extensive simulations on real-world LEO mega-constellations, our MLDR outperforms all state-of-the-art schemes by remarkably reducing reconvergence time and achieving the highest routing optimality.