首页 | 本学科首页   官方微博 | 高级检索  
     

基于拍卖的网络切片虚拟资源分配算法研究
引用本文:施颖洁,陈前斌,杨希希,唐伦. 基于拍卖的网络切片虚拟资源分配算法研究[J]. 重庆邮电大学学报(自然科学版), 2018, 30(2): 159-166
作者姓名:施颖洁  陈前斌  杨希希  唐伦
作者单位:重庆邮电大学 移动通信技术重点实验室,重庆 400065,重庆邮电大学 移动通信技术重点实验室,重庆 400065,重庆邮电大学 移动通信技术重点实验室,重庆 400065,重庆邮电大学 移动通信技术重点实验室,重庆 400065
基金项目:国家高科技研究发展计划(“863”计划)(2014AA01A701);国家自然科学基金(6157073)
摘    要:网络切片可以针对不同应用场景的网络速率、时延、可靠性等需求,根据业务对网络功能、安全性等需求构建虚拟的逻辑网络,该技术是5G的关键技术之一。针对网络切片多样化的QoS需求,提出了一种以最大化收益为目标的虚拟资源分配优化算法。该算法针对各个切片业务需求的差异性以及当前用户状态定义切片优先级,并以价格代替信誉因子,确定网络切片需求资源的拍卖报价,并根据可回收的资源量动态地更新和确定价格基准,再将资源优化分配问题转换成为拍卖问题,结合价格更新算法以及资源分配算法并进行求解,为各个业务切片分配资源。仿真结果表明,所提出的资源分配算法可以在满足切片多样化的QoS需求的同时有效提升用户业务体验满意度。

关 键 词:网络切片  虚拟资源分配  拍卖机制  优先级
收稿时间:2017-08-23
修稿时间:2017-10-25

Virtual resource allocation algorithm of network slice based on auction
SHI Yingjie,CHEN Qianbin,YANG Xixi and TANG Lun. Virtual resource allocation algorithm of network slice based on auction[J]. Journal of Chongqing University of Posts and Telecommunications, 2018, 30(2): 159-166
Authors:SHI Yingjie  CHEN Qianbin  YANG Xixi  TANG Lun
Affiliation:Key Lab of Mobile Communication Technology, Chongqing University of Posts and Telecommunications,Chongqing 400065, P.R. China,Key Lab of Mobile Communication Technology, Chongqing University of Posts and Telecommunications,Chongqing 400065, P.R. China,Key Lab of Mobile Communication Technology, Chongqing University of Posts and Telecommunications,Chongqing 400065, P.R. China and Key Lab of Mobile Communication Technology, Chongqing University of Posts and Telecommunications,Chongqing 400065, P.R. China
Abstract:Network slices can be used for different application scenarios such as network speed, delay, reliability and other needs. Building a virtual logical network according to the business of network functions, security and other needs is one of the key technologies of 5G. This paper proposes a novel Resource Allocation Optimization Algorithm with the aim of maximized profit. The algorithm first defines the slice priority according to the slice services and the user status. Secondly, it replaces the credibility of the price factor, determines the resource bids and the final price according to the amount of resources. Finally, the resource allocation problem is changed into auction issues. The simulation results show that the proposed algorithm can effectively improve the satisfaction of user service, fulfilling the diversified QoS requirements of slices at the same time.
Keywords:network slicing   virtual resource allocation   auction mechanism   priority
点击此处可从《重庆邮电大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《重庆邮电大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号