摘要
为满足未来移动通信网络中多样化的业务需求,为用户提供定制化服务的同时提升网络经济效益,该文提出一种基于在线拍卖的网络切片资源分配算法。根据业务类型将用户的服务请求转化为相应投标信息,以最大化拍卖参与者的社会福利为目标,将切片资源分配问题建模为基于多业务的在线赢家确定问题。结合资源分配与价格更新策略,实现基于在线拍卖的资源优化配置。仿真结果表明,该算法能够在满足用户业务需求的同时,提升网络经济效益。
In order to meet the diversified service requirements in future mobile communication networks and provide users with customized services while improving network economic efficiency,a resource allocation algorithm of network slicing based on online auction is proposed.The algorithm transforms the service requests of users into the corresponding bidding information according to the service types.For maximizing the social welfare of the auction participants,the slicing resource allocation problem is modeled as a multi-service based online winner determination problem.Combined with the resource allocation and price updating strategy,the optimal resources allocation based on online auction is achieved.The simulation results show that the proposed algorithm can improve the network economic efficiency and satisfy the service requirements of users.
作者
梁靓
武彦飞
冯钢
LIANG Liang;WU Yanfei;FENG Gang(National Key Laboratory of Science and Technology on Communications,Universityof Electronic Science and Technology of China,Chengdu 611731,China;School of Microelectronics and Communication Engineering,Chongqing University,Chongqing 400044,China)
出处
《电子与信息学报》
EI
CSCD
北大核心
2019年第5期1187-1193,共7页
Journal of Electronics & Information Technology
基金
国家自然科学基金青年科学基金(61601067)
中国博士后科学基金(2016M602671)~~
关键词
网络切片
资源分配
多业务
在线拍卖
Network slicing
Resource allocation
Multi-service
Online auction
