Xudong Niu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Xudong Niu has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
Chen Xin
Nanjing Power Supply Company of State Grid Jiangsu Electric Power Co., Ltd., Nanjing, 210019, China
1 shared publicationFeng Qi
State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications, Beijing, 100876, China
1 shared publicationJun Zhou
Nanjing Power Supply Company of State Grid Jiangsu Electric Power Co., Ltd., Nanjing, 210019, China
1 shared publicationShaoyong Guo
State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications, Beijing, 100876, China
1 shared publication- Sujie Shao
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China
1 shared publication Xingyu Chen
State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications, Beijing, 100876, China
1 shared publication
Latest Publications
- Open Access
- 31 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 83771-83784
Workload Allocation Mechanism for Minimum Service Delay in Edge Computing-Based Power Internet of Things
As a novel computing technology closer to business ends, edge computing has become an effective solution for delay sensitive business of power Internet of Things (IoT), and promotes the application and development of Internet of Things technology in smart grids. However, the inherent characteristics of a single edge node with limited resources may fail to meet the delay requirements for access ubiquitous IoT businesses of massive access. Multiple edge nodes are needed to cooperate with each other to optimize workload allocation to provide lower delay services. To this end, this paper proposes a workload allocation mechanism, orienting edge computing-based power IoT, which minimizes service delay. The workload optimization allocation model is established, and the optimal workload allocation oriented on delay among multiple edge nodes is further realized on the basis of computing resource optimization within single edge node. The BRT (Balanced initialization, Resource allocation, and Task allocation) algorithm is proposed. Based on balanced initialization of workload within edge nodes, the particle swarm algorithm modified by pheromone strategy is used to solve the problem of the computing resources allocation inside edge nodes. Finally, the task allocation among multiple edge servers is converted into a semi-definite programming problem. The simulation results show that the proposed BRT algorithm reduces the service delay by 9.1%, 16.9%, and 26.4%, and the service delay growth rate by 24.6%, 34.5%, and 38.7%, respectively, compared with SAA (Simulated Annealing Algorithm), LAB (LoAd Balancing) and LEAD (Latency-awarE workloAd offloaDing) algorithms.
- 31 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 83771-83784
Open AccessWorkload Allocation Mechanism for Minimum Service Delay in Edge Computing-Based Power Internet of Things
As a novel computing technology closer to business ends, edge computing has become an effective solution for delay sensitive business of power Internet of Things (IoT), and promotes the application and development of Internet of Things technology in smart grids. However, the inherent characteristics of a single edge node with limited resources may fail to meet the delay requirements for access ubiquitous IoT businesses of massive access. Multiple edge nodes are needed to cooperate with each other to optimize workload allocation to provide lower delay services. To this end, this paper proposes a workload allocation mechanism, orienting edge computing-based power IoT, which minimizes service delay. The workload optimization allocation model is established, and the optimal workload allocation oriented on delay among multiple edge nodes is further realized on the basis of computing resource optimization within single edge node. The BRT (Balanced initialization, Resource allocation, and Task allocation) algorithm is proposed. Based on balanced initialization of workload within edge nodes, the particle swarm algorithm modified by pheromone strategy is used to solve the problem of the computing resources allocation inside edge nodes. Finally, the task allocation among multiple edge servers is converted into a semi-definite programming problem. The simulation results show that the proposed BRT algorithm reduces the service delay by 9.1%, 16.9%, and 26.4%, and the service delay growth rate by 24.6%, 34.5%, and 38.7%, respectively, compared with SAA (Simulated Annealing Algorithm), LAB (LoAd Balancing) and LEAD (Latency-awarE workloAd offloaDing) algorithms.