|国家科技期刊平台
首页|期刊导航|计算机应用研究|多域网络中基于域间时延博弈的端到端动态协同切片方法

多域网络中基于域间时延博弈的端到端动态协同切片方法OA北大核心CSTPCD

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

中文摘要英文摘要

针对多域网络中的切片存在域间时延不均的问题,提出了一种基于域间时延博弈的端到端动态协同切片方法(inter-domain 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-to-end 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 de-lay allocation ratio and slice deployment solution.Experiments show that compared with the traditional static allocation algo-rithm,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 sig-nificant advantages in reducing deployment costs.

赵季红;董莎;胡晓燕;崔文静

西安邮电大学通信与信息工程学院,西安 710121||西安交通大学电子信息工程学院,西安 710049西安邮电大学通信与信息工程学院,西安 710121

电子信息工程

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

multi-domain networknetwork slicingslice collaborationNash gamereinforcement learning

《计算机应用研究》 2024 (006)

1820-1824 / 5

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

10.19734/j.issn.1001-3695.2023.09.0434

评论