ZTE Communications ›› 2021, Vol. 19 ›› Issue (1): 11-19.doi: 10.12142/ZTECOM.202101003

• Special Topic • Previous Articles     Next Articles

Efficient Network Slicing with Dynamic Resource Allocation

JI Hong1(), ZHANG Tianxiang2, ZHANG Kai1, WANG Wanyuan1, WU Weiwei1   

  1. 1.School of Computer Science and Engineering, Southeast University, Nanjing 211189, China
    2.ZTE corporation, Shenzhen 518057, China
  • Received:2020-12-09 Online:2021-03-25 Published:2021-04-09
  • About author:JI Hong (hong_ji@seu.edu.cn) received the B.S. degree from School of Economics and Management from Xidian University, China in 2018. He is currently a master student at School of Cyber Science and Engineering, Southeast University, China. His research interests lie in network optimization and intelligent decision making.|ZHANG Tianxiang received the B.S. degree from Nanjing University of Aeronautics and Astronautics, China. He is currently an engineer with ZTE Corporation. His research interests include traffic scheduling and graph neural networks.|ZHANG Kai is currently a master student at School of Cyber Science and Engineering, Southeast University, China. His research interests include graph neural networks and resource allocation and reinforcement learning.|WANG Wanyuan is an assistant professor with the School of Computer Science and Engineering, Southeast University, China. He received his Ph. D. degree in computer science from Southeast University in 2016. He has published several articles in refereed journals and conference proceedings, such as the IEEE Transactions on Mobile Computing, IEEE Journal on Selected Areas in Communications, IEEE Transactions on Cybernetics, AAAI, and AAMAS. He won the best student paper award from ICTAI14. His main research interests include artificial intelligence, multiagent systems, and game theory.|WU Weiwei is a professor in the School of Computer Science and Engineering, Southeast University, China. He received his B.Sc. degree fron South China University of Technology,China and the Ph.D. degree from City University of Hong Kong (CityU),China and University of Science and Technology of China (USTC) in 2011, and went to Nanyang Technological University, Singapore for post-doctorial research in 2012. He has published over 50 peer-reviewed papers in international conferences/journals, and serves as TPCs and reviewers for several top international journals and conferences. His research interests include optimizations and algorithm analysis, wireless communications, crowdsourcing, cloud computing, reinforcement learning, game theory and network economics.

Abstract:

With the rapid development of wireless network technologies and the growing demand for a high quality of service (QoS), the effective management of network resources has attracted a lot of attention. For example, in a practical scenario, when a network shock occurs, a batch of affected flows needs to be rerouted to respond to the network shock to bring the entire network deployment back to the optimal state, and in the process of rerouting a batch of flows, the entire response time needs to be as short as possible. Specifically, we reduce the time consumed for routing by slicing, but the routing success rate after slicing is reduced compared with the unsliced case. In this context, we propose a two-stage dynamic network resource allocation framework that first makes decisions on the slices to which flows are assigned, and coordinates resources among slices to ensure a comparable routing success rate as in the unsliced case, while taking advantage of the time efficiency gains from slicing.

Key words: network slicing, dynamic resource allocation, reinforcement learning