多域网络中基于域间时延博弈的端到端动态协同切片方法  

End-to-end dynamic collaborative slicing method based on inter-domaindelay game in multi-domain network

作　　者：赵季红 董莎[1] 胡晓燕 崔文静 Zhao Jihong;Dong Sha;Hu Xiaoyan;Cui Wenjing(School of Communication&Information Engineering,Xi’an University of Post&Telecommunications,Xi’an 710121,China;School of Electronic&Information Engineering,Xi’an Jiaotong University,Xi’an 710049,China)

机构地区：[1]西安邮电大学通信与信息工程学院,西安710121 [2]西安交通大学电子信息工程学院,西安710049

出　　处：《计算机应用研究》2024年第6期1820-1824,共5页Application Research of Computers

基　　金：国家重点研发计划重点专项资助项目(2018YFB1800305)。

摘　　要：针对多域网络中的切片存在域间时延不均的问题,提出了一种基于域间时延博弈的端到端动态协同切片方法(interdomain dynamic game algorithm,IDGA)。采用博弈论方法将端到端时延约束分配到不同的网络域,通过在域内部署切片来获得相应的博弈收益,采用DDPG算法不断更新博弈策略,最终得到最佳的时延分配比例和切片部署方案。实验表明,该算法与传统的静态分配算法对比有明显优势,与经验迭代的DSDP方法以及DQN-SNAF算法相比,IDGA算法在100个切片请求下,切片部署成功率分别提高了8%和3%左右,同时节点资源利用率提高了5.75%和1.96%左右,在降低部署成本方面也有显著优势。Aiming at the problem of uneven inter-domain delay in slicing in multi-domain networks,this paper proposed an end-to-end dynamic cooperative slicing method based on inter-domain delay game.This method used game theory methods to allocate end-toend delay constraints to different network domains,and deployed slices within the domain to obtain correspon-ding game benefits.It used the DDPG algorithm to continuously update the game strategy,and finally obtained the optimal delay allocation ratio and slice deployment solution.Experiments show that compared with the traditional static allocation algorithm,the proposed algorithm has obvious advantages.Compared with the empirically iterative DSDP method and the DQN-SNAF algorithm,the IDGA algorithm increased the slice deployment success rate by about 8%and 3%respectively under 100 slice requests.At the same time,the node resource utilization rate increased by about 5.75%and 1.96%.There are also significant advantages in reducing deployment costs.

关 键 词：多域网络 网络切片 切片协同 纳什博弈 强化学习 

分 类 号：TN929.5[电子电信—通信与信息系统]