Xiaoning Zhang

Xiaoning Zhang

Auto-generated profile, based on publicly available information

Xiaoning Zhang

School of Information and Communication Engineering, University of Electronic Science and Technology of China, Chengdu, China

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
30 May 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
RLRongping Lin
Rongping Lin
TXTianze Xie
Tianze Xie
SLShan Luo
Shan Luo
XZXiaoning Zhang
Xiaoning Zhang
YXYong Xiao
Yong Xiao
Moshe ZukermanMoshe Zukerman
Moshe Zukerman
Edge computing is an indispensable technology that overcomes delay limitations of cloud computing. In edge computing, computational resources are deployed at the network edge, and computational tasks and data of end terminals can be efficiently processed by edge nodes. Considering the computational resource limitations of edge nodes, collaborative edge computing integrates computational resources of edge nodes and provides more efficient computing services for end terminals. This article considers a computation offloading problem in collaborative edge computing networks, where computation offloading and resource allocation are optimized by means of a collaborative load shedding approach: a terminal can offload a computing task to an edge node, which either can process the task with its computing resource or further offload the task to other edge nodes. Long-term objectives and long-term constraints are considered, and Lyapunov optimization is applied to convert the original nonconvex computation offloading problem into a second problem that approximate the original problem and it is still nonconvex but has a special structure, which gives rise to a new distributed algorithm that optimally solves the second problem. Finally, the performance and provable bound of the distributed algorithm is theoretically analyzed. Numerical results demonstrate that the distributed algorithm can achieve a guaranteed long-term performance, and also demonstrate the improvement in performance achieved over the case of computation offloading without collaborating edge nodes.

5 October 2017 in Journal of Optical Communications and Networking
Verified
Journal Article
Closed access
PDF file
ZCZijing Cheng
Zijing Cheng
XZXiaoning Zhang
Xiaoning Zhang
YLYichao Li
Yichao Li
SYShui Yu
Shui Yu
RLRongping Lin
Rongping Lin
LHLei He
Lei He
Although a restoration approach derives a reroute path when failure occurs and greatly reduces forwarding rules in switches compared with a protection approach, software-defined networks (SDNs) induce a long failure recovery process because of frequent flow operations between the SDN controller and switches. Accordingly, it is indispensable to design a new resilience approach to balance failure recovery time and forwarding rule occupation. To this end, we leverage flexible flow aggregation in fast reroute to solve this problem. In the proposed approach, each disrupted traffic flow is reassigned to a local reroute path for the purpose of congestion avoidance. Thus, all traffic flows assigned to the same local reroute path are aggregated into a new “big” flow, and the number of reconfigured forwarding rules in the restoration process is greatly reduced. We first formulate this problem as an integer linear programming model, then design an efficient heuristic named the “congestion-aware local fast reroute” (CALFR). Extensive emulation results show that CALFR enables fast recovery while avoiding link congestion in the post-recovery network.

1 January 2022 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
ZZZhihao Zeng
Zhihao Zeng
XZXiaoning Zhang
Xiaoning Zhang
ZXZixiang Xia
Zixiang Xia
The development of fifth‐generation (5G) mobile communication technology has become a major driver to the growth of Internet of Things (IoT) applications. As a promising networking paradigm, software‐defined networking (SDN) makes IoT more flexible and agile by decoupling control plane from data plane. With a large number of heterogeneous devices accessing to the network, we need to divide the network into several domains and each domain is managed by an SDN controller. Controllers share topologies with each other to form global view of the entire network, which is used for crossing‐domain path routing. However, crossing‐domain routing requires global trust between multiple controllers. The reason is that if the malicious controller shares misleading topologies, the rest of controllers may calculate mistaken crossing‐domain paths. As a result, packets are forwarded to the domain that is managed by the malicious controller and dropped deliberately, which is known as the black‐hole attack. To this end, we present a blockchain‐based architecture to ensure secure routing among multiple domains in SDN‐enabled IoT networks. All SDN controllers are equipped with blockchains, and they upload abstract topologies to the blockchain via the smart contract. Thus, the genuine view of the entire network can be gained from the blockchain due to its consensus and immutability. In addition, we use the concept of reputation that consists of the local reputation and the global reputation to further protect routing reliability, and the global reputation is reserved in the blockchain. Compared with benchmark architectures, the emulation results show that our proposed method can effectively build trust between multiple controllers and ensure secure routing among multiple domains.

9 December 2016 in IEEE Communications Letters
Verified
Journal Article
Closed access
XZXiaoning Zhang
Xiaoning Zhang
ZCZijing Cheng
Zijing Cheng
RLRongPing Lin
RongPing Lin
LHLei He
Lei He
SYShui Yu
Shui Yu
HLHongbin Luo
Hongbin Luo
In this letter, we propose a local fast reroute (LFR) algorithm with flow aggregation in software defined networks (SDN). In LFR, if a link failure is detected, all traffic flows affected by the failure are aggregated to be a new “big” flow. Then, a local reroute path is dynamically deployed by the SDN controller for the aggregated flow. LFR reduces the number of flow operations between the SDN controller and switches. Numerical results show that the LFR enables fast recovery while minimizing the total number of flow entries in SDN.

15 October 2019 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
XZXiaoning Zhang
Xiaoning Zhang
ZXZhichao Xu
Zhichao Xu
LFLang Fan
Lang Fan
SYShui Yu
Shui Yu
YQYouyang Qu
Youyang Qu
To accommodate heterogeneous and sophisticated network services, Network Function Virtualization (NFV) is invented as a hopeful networking technology. The most distinct feature of NFV is that it separates network functions from physical hardware. In the NFV architecture, various types of Virtual Network Functions (VNFs) are placed on specific software-based middleboxes by telecom providers. Traffic traverses through a sequence of Virtual Network Functions (VNFs) in pre-defined order, which is named as Service Function Chain (SFC). However, how to effectively place VNFs at different locations and steer SFC requests while minimizing energy consumption is still an open problem. Accordingly, we investigate on the joint optimization of VNF placement and traffic steering for energy efficiency in telecom networks. We first present the power consumption model in NFV-enabled telecom networks, and then formulate the studied problem as an Integer Linear Programming (ILP) model. Since the problem is proved as NP-hard, we design a polynomial algorithm that can achieve near-optimal performances based on the Markov approximation technique. In addition, our algorithm can be extended to an online version to serve dynamic arriving SFC requests. The online algorithm achieves a near-optimal longterm averaged performance.

31 May 2021 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
RLRongping Lin
Rongping Lin
SYSong Yu
Song Yu
SLShan Luo
Shan Luo
XZXiaoning Zhang
Xiaoning Zhang
JWJingyu Wang
Jingyu Wang
Moshe ZukermanMoshe Zukerman
Moshe Zukerman
Network function virtualization achieves cost-effective network service provisioning through exploitation of virtualization and automation by decoupling network functions (software) from dedicated hardware. The software of the devices can then be hosted by low-cost computation devices rather than by more expensive dedicated devices. To obtain a specific network service, the traffic flow is steered to go through a specific order of network functions that are hosted by cloud computing, and this network function sequence is known as a service function chaining (SFC). To allocate computation resources for network functions and bandwidth resources between network functions in a physical network is the SFC embedding problem. In this paper, we consider the SFC embedding problem in multi-domain networks, where no domain information, like domain topology and network resource, is disclosed among domains. We propose a new optimization algorithm based on column generation method to solve this problem, which is distributedly computed in domains. To further improve the scalability, we provide two heuristic algorithms. We selected two networks one large (158 nodes) and one small (18 nodes) to numerically validate the proposed algorithms and demonstrate that the acceptance ratio obtained by the heuristic algorithms is close (within 5.6%) to that of the optimal algorithm.