Joint Virtual Network Topology Design and Embedding for Cybertwin-Enabled 6G Core Networks

被引:20
作者
Li, Junling [1 ,2 ]
Shi, Weisen [2 ]
Ye, Qiang [3 ]
Zhang, Shan [4 ]
Zhuang, Weihua [2 ]
Shen, Xuemin [2 ]
机构
[1] Univ Waterloo, Shenzhen Inst Artificial Intelligence & Robot Soc, Waterloo, ON N2L 3G1, Canada
[2] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada
[3] Minnesota State Univ, Dept Elect & Comp Engn & Technol, Mankato, MN 56001 USA
[4] Beihang Univ, Sch Comp Sci & Engn, Beijing 100191, Peoples R China
基金
中国国家自然科学基金; 加拿大自然科学与工程研究理事会;
关键词
Delays; Resource management; Quality of service; Topology; Substrates; Internet of Things; Network servers; 6G; cybertwin; end-to-end (E2E) packet delay; network virtualization (NV); resource allocation; topology; virtual network embedding (VNE);
D O I
10.1109/JIOT.2021.3097053
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
To efficiently allocate heterogeneous resources for customized services, in this article, we propose a network virtualization (NV)-based network architecture in cybertwin-enabled 6G core networks. In particular, we investigate how to optimize the virtual network (VN) topology (which consists of several virtual nodes and a set of intermediate virtual links) and determine the resultant VN embedding in a joint way over a cybertwin-enabled substrate network. To this end, we formulate an optimization problem whose objective is to minimize the embedding cost, while ensuring that the end-to-end (E2E) packet delay requirements are satisfied. The queueing network theory is utilized to evaluate each service's E2E packet delay, which is a function of the resources assigned to the virtual nodes and virtual links for the embedded VN. We reveal that the problem under consideration is formally a mixed-integer nonlinear program (MINLP) and propose an improved brute-force search algorithm to find its optimal solutions. To enhance the algorithm's scalability and reduce the computational complexity, we further propose an adaptively weighted heuristic algorithm to obtain near-optimal solutions to the problem for large-scale networks. Simulations are conducted to show that the proposed algorithms can effectively improve network performance compared to other benchmark algorithms.
引用
收藏
页码:16313 / 16325
页数:13
相关论文
共 35 条
  • [1] A Virtual Network Customization Framework for Multicast Services in NFV-Enabled Core Networks
    Alhussein, Omar
    Phu Thinh Do
    Ye, Qiang
    Li, Junling
    Shi, Weisen
    Zhuang, Weihua
    Shen, Xuemin
    Li, Xu
    Rao, Jaya
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2020, 38 (06) : 1025 - 1039
  • [2] Bertsekas D., 1987, Data Networks
  • [3] BURER A. N., 2012, SURV OPER RES MANAG, V17, P97, DOI [DOI 10.1016/J.SORMS.2012.08.001, 10.1016/j.sorms.2012.08.001]
  • [4] Cai ZP, 2010, GLOB TELECOMM CONF
  • [5] Virtual Network Embedding Through Topology-Aware Node Ranking
    Cheng, Xiang
    Su, Sen
    Zhang, Zhongbao
    Wang, Hanchi
    Yang, Fangchun
    Luo, Yan
    Wang, Jie
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2011, 41 (02) : 39 - 47
  • [6] Chochlidakis G., 2016, PROC IEEE INT C COMM, P1
  • [7] ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping
    Chowdhury, Mosharaf
    Rahman, Muntasir Raihan
    Boutaba, Raouf
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2012, 20 (01) : 206 - 219
  • [8] Multi-Layer Virtual Network Embedding
    Chowdhury, Shihabur Rahman
    Ayoubi, Sara
    Ahmed, Reaz
    Shahriar, Nashid
    Boutaba, Raouf
    Mitra, Jeebak
    Liu, Liu
    [J]. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2018, 15 (03): : 1132 - 1145
  • [9] Stringer: Balancing Latency and Resource Usage in Service Function Chain Provisioning
    Chua, Freddy C.
    Ward, Julie
    Zhang, Ying
    Sharma, Puneet
    Huberman, Bernardo A.
    [J]. IEEE INTERNET COMPUTING, 2016, 20 (06) : 22 - 31
  • [10] Finding the k shortest paths
    Eppstein, D
    [J]. SIAM JOURNAL ON COMPUTING, 1998, 28 (02) : 652 - 673