Junxiao Wang

Junxiao Wang

Auto-generated profile, based on publicly available information

Junxiao Wang

School of Computer Science and Technology, Dalian University of Technology, Dalian, 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
31 January 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
JWJunxiao Wang
Junxiao Wang
HQHeng Qi
Heng Qi
KLKeqiu Li
Keqiu Li
XZXiaobo Zhou
Xiaobo Zhou
Nowadays, service function chaining (SFC) becomes more and more widespread and profound to implement flexible and economical virtual network infrastructures for the Internet of Things (IoT). With the benefits of SFC, the IoT service providers can steer massive traffic through a sequence of heterogeneous virtual network function instances based on their business logic. SFC is viewed as an attractive solution for building virtualized IoT-dedicated network. However, the SFC orchestration in IoT is still a challenge problem. Existing work usually focuses on the performance guarantee while ignoring the issue of resource idleness. To meet the sharp increase in IoT traffic amounts and the diversification of IoT traffic requirements, it is necessary to implement the performance and resource aware SFC orchestration system. Motivated by this, we propose a novel linear programming model and an effective approximation optimization algorithm for SFC orchestration, in order to achieve performance guarantee while avoiding resource idleness. Based on the proposed model and algorithm, a new prototype system named performance and resource aware orchestration system of SFC for IoT (PRSFC-IoT) is built upon OpenStack for online SFC orchestration. A large number of simulation experiments show that the PRSFC-IoT outperforms existing solutions for SFC orchestration in IoT.

3 November 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
HQHeng Qi
Heng Qi
JWJunxiao Wang
Junxiao Wang
WLWenxin Li
Wenxin Li
YWYuxin Wang
Yuxin Wang
Tie QiuTie Qiu
Tie Qiu
Nowadays, more and more sensors, devices and applications are connected in Industrial Internet of Things (IIoT), producing massive real-time flows which need to be scheduled for Quality-of-Service provision. To realize application-aware and adaptive flow scheduling, the problem of traffic classification must be addressed at first. When edge computing paradigm is introduced into IIoT, the traffic classification service can be deployed on edge node in the near-end. Recently, deep-learning-based IIoT traffic classification methods show better performance, but the computational cost of deep learning model is too high to be deployed on edge node. Moreover, increasingly unknown flows generated by new devices and emerging industrial APPs lead to frequent training of traffic classifiers. It is difficult to migrate the complex process of classifier training from cloud server to edge nodes with limited resources. To address these issues, we take the benefits of hash mechanism and consensus mechanism in blockchain to design a lightweight IIoT traffic classification service, which is more applicable for edge computing paradigm. First, inspired by the hash mechanism in blockchain and the learning to hash for big data, we propose a new learning-to-hash method named extension hashing. By this method, we can build the set of binary coding tress (BCT set), then generating hash table for more efficient k-nearest neighbor-based classification without complex classifier training. Then, we design a new voting-based consensus algorithm to synchronize the BCT sets and the hash tables across edge nodes, thereby providing the traffic classification service. Finally, we conduct data-driven simulations to evaluate the proposed service. By comparing traffic classification results on public data set, we can see that the proposed service achieves the highest classification accuracy with the minimal time cost and memory usage.

30 December 2020 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
JWJunxiao Wang
Junxiao Wang
HQHeng Qi
Heng Qi
WLWenxin Li
Wenxin Li
KLKeqiu Li
Keqiu Li
SUSteve Uhlig
Steve Uhlig
YWYuxin Wang
Yuxin Wang
Owing to powerful programmability, software defined networking (SDN) is well aligned with the requirements of NFV datacenters. Although the mainstream SDN frameworks can effectively respond to the requests of control plane, the load distribution among controllers is not balanced due to the request dynamics and request diversity. The existing solutions balance the load of control plane by migrating switches between controllers. However, these solutions are based on the binding between switches and controllers, so they are difficult to adapt to the dynamic and diverse requests. In this paper, we propose a new framework to decouple the binding. The new framework performs modular management for request queues. A complete request queue is provided for each type of request between each switch controller pair, so that the assignment between requests is independent of each other. Based on the proposed framework, we transform the request assignment problem into a variant of the scheduling problem in a Stochastic Processing Network (SPN), and propose a Maximum Pressure Policy (MPP) which can provide runtime guarantees on request throughput and response latency. To fit with the constraints inherent to large-scale deployment, we propose a distributed version of MPP, named DMPP. DMPP runs in local state on each switch and performs scheduling logic for batch requests. We implement a protosystem of our solution and evaluate it on the settings representing real-world scenarios. The results show that our solution can provide guarantees on request throughput and response latency, and significantly outperforms state-of-the-art solutions through a more efficient resource usage