Xuwei Yang

Xuwei Yang

Auto-generated profile, based on publicly available information

Xuwei Yang

Huawei Cloud, Huawei Technology Co., Ltd., Shenzhen, Guangdong, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 July 2021 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
XFXingpeng Fan
Xingpeng Fan
HXHongli Xu
Hongli Xu
HHe Huang
He Huang
XYXuwei Yang
Xuwei Yang
To meet the ever-increasing demands for high-quality network services, a software defined network (SDN) can support various virtual network functions (VNFs) using virtualization technology. Due to network dynamics, an SDN needs to be updated frequently to optimize various performance objectives, such as load balancing. Most previous solutions first determine a new network configuration ( e.g. , target VNF placement and flow routing) based on the current workload, and then update the VNF placement and routing paths of the existing flows. However, due to massive VNF’s state migration and slow update of the flow table, unacceptable update delay may occur, especially in large or frequently changed networks. In this paper, we address the real-time network update, which jointly considers the optimization of the service function chain (SFC) update and the routing update. We propose the delay-satisfied NFV-enabled network update (DSNU) problem, and prove its NP-Hardness. We design an algorithm with bounded approximation factor to solve this problem. To further reduce the delay, we also design an efficient algorithm for the update scheduling. The experimental results show that our method can reduce the network update delay by about 86% compared with the previous network update methods while preserving a similar network performance, i.e. , the VNF instance load ratio increases by less than 5%.

12 March 2018 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
XYXuwei Yang
Xuwei Yang
HXHongli Xu
Hongli Xu
LHLiusheng Huang
Liusheng Huang
GZGongming Zhao
Gongming Zhao
PXPeng Xi
Peng Xi
CQChunming Qiao
Chunming Qiao
To better serve a diversity of flows, load balancing is crucial to ensure operational efficiency. However, previous works for load balancing have several disadvantages: (1) limited applicability with sub-flow scheduling (e.g., LetFlow); (2) hash collision (e.g., ECMP); or (3) transient network congestion due to reactive scheduling for traffic dynamics (e.g., Hedera and DevoFlow). An important reason for the above disadvantages is that it is difficult to provide fully fine-grained flow control for load balancing in an SDN as the flow table size of each SDN switch is usually limited. Inspired by the fact that a virtual switch (vswitch) has more powerful processing capacity and more flow entries compared with a physical switch, the previous work (e.g., Presto) deploys one vswitch for each ingress switch, and achieves the load balancing through efficient flow routing. However, this mechanism may lead to high cost and not well deal with topology asymmetry. Thus, this paper proposes to achieve the load balancing by incrementally deploying a certain number of vswitches in an SDN. We formulate the joint optimization of vswitch deployment and routing (JVR) problem as an integer linear program, and prove its NP-hardness. A rounding-based algorithm with bounded approximation factors is proposed to solve the JVR problem. We implement the proposed algorithm on an SDN testbed for experimental studies and use simulations for large-scale investigation. The experimental results and simulation results show high efficiency of our algorithm. For example, our proposed algorithm can reduce the link load ratio by about 41.5% compared with ECMP by deploying a small number of virtual switches.

22 October 2020 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
JLJianchun Liu
Jianchun Liu
HXHongli Xu
Hongli Xu
GZGongming Zhao
Gongming Zhao
CQChen Qian
Chen Qian
XFXingpeng Fan
Xingpeng Fan
HHe Huang
He Huang
Network Function Virtualization (NFV) is a new paradigm to enable service innovation through virtualizing traditional network functions. To construct a new NFV-enabled network, there are two critical requirements: minimizing server deployment cost and satisfying switch resource constraints. However, prior work mostly focuses on the server deployment cost, while ignoring the switch resource constraints (e.g., switch's flow-table size). It thus results in a large number of rules on switches and leads to massive control overhead. To address this challenge, we propose an incremental server deployment (INSD) problem for construction of scalable NFV-enabled networks. We prove that the INSD problem is NP-Hard, and there is no polynomial-time algorithm with approximation ratio of (1-ε) · łn m, where ε is an arbitrarily small value and m is the number of requests in the network. We then present an efficient algorithm with an approximation ratio of 2· H(q· p), where q is the number of VNF's categories and p is the maximum number of requests through a switch. We evaluate the performance of our algorithm with experiments on physical platform (Pica8), Open vSwitches, and large-scale simulations. Both experimental results and simulation results show high scalability of the proposed algorithm. For example, our solution can reduce the control and rule overhead by about 88% with about 5% additional server deployment, compared with the existing solutions.

14 May 2021 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
XYXuwei Yang
Xuwei Yang
HXHongli Xu
Hongli Xu
SCShigang Chen
Shigang Chen
HHe Huang
He Huang
Large software defined networks use a cluster of distributed controllers to process flow requests from a massive number of switches. To cope with traffic dynamics, this paper studies a new problem of how to improve the residual capacity available at the controllers to handle request bursts experienced at the switches. While the total residual capacity is a constant under a given total capacity of all controllers and a given total workload from all switches, this paper considers the residual capacity available to each individual switch, which depends on how the switches are mapped to the controllers for management. We focus on how to maximize the minimum residual capacity available to any switch. The prior work either provides poor residual capacity or incurs heavy synchronization overhead by simulation results. This paper proposes a new method called indirect multi-mapping that achieves both high residual capacity and low synchronization cost. We formally define a non-linear integer optimization problem for max-min residual capacity under indirect multi-mapping. We then approximate the problem as two sub-problems: switch-controller mapping selection and weight assignment for each switch-controller mapping. We solve these sub-problems and formally analyze their approximate factor. We implement the proposed solution on an SDN testbed for experimental studies and use simulations for large-scale investigation. Our evaluation shows that indirect multi-mapping improves the minimum residual capacity by 49.8% on average and reduces the synchronization cost by 41.9-60.3% on average when compared with the alternatives.

1 October 2021 in Computer Networks
Verified
Journal Article
Closed access
XYXuwei Yang
Xuwei Yang
HXHongli Xu
Hongli Xu
JLJianchun Liu
Jianchun Liu
CQChen Qian
Chen Qian
XFXingpeng Fan
Xingpeng Fan
HWHaibo Wang
Haibo Wang

7 May 2021 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
XYXuwei Yang
Xuwei Yang
HXHongli Xu
Hongli Xu
XYXiwen Yu
Xiwen Yu
CQChen Qian
Chen Qian
GZGongming Zhao
Gongming Zhao
HHe Huang
He Huang
In a software defined network, the controller needs to obtain/collect traffic measurement information ( i.e. , flow statistics) from switches for different applications, such as traffic engineering. Existing solutions seldom consider the per-switch cost, which may lead to heavy statistics collection cost ( e.g. , high CPU overhead) on some switches. Due to limited computing power on most commodity switches, heavy statistics collection cost on those switches may seriously interfere with the basic rule operations, especially when some switches need to deal with many new-arrival flows or update routes of existing flows. To address this challenge, we design and implement efficient flow statistics collection (FSC) with limited interference on the basic rule operations. We formally propose a cooperative flow statistics collection with per-switch cost constraint (CP-FSC) problem. We prove that the CP-FSC problem is NP-hard and present an efficient algorithm with approximation ratio 1/2, based on dynamic programming. To reduce the time complexity, a greedy-based algorithm with approximation ratio 1/3 is also presented. We implement the proposed FSC algorithms on our SDN platform. The experimental results and the extensive simulation results show 36%-59% performance improvement compared with the existing solutions.