• 更多栏目

    邓娜

    • 副教授       硕士生导师
    • 性别:女
    • 毕业院校:中国科学技术大学
    • 学位:博士
    • 所在单位:信息与通信工程学院
    • 电子邮箱:dengna@dlut.edu.cn

    访问量:

    开通时间:..

    最后更新时间:..

    Multi-Service Resource Allocation in Future Network With Wireless Virtualization

    点击次数:

    论文类型:期刊论文

    第一作者:Li, Letian

    通讯作者:Zhou, WY (reprint author), Univ Sci & Technol China, Dept Elect Engn & Informat Sci, Hefei 230026, Anhui, Peoples R China.

    合写作者:Deng, Na,Ren, Weilong,Kou, Baohua,Zhou, Wuyang,Yu, Shui

    发表时间:2018-01-01

    发表刊物:IEEE ACCESS

    收录刊物:SCIE

    卷号:6

    页面范围:53854-53868

    ISSN号:2169-3536

    关键字:Multi-service; resource allocation; user scheduling; wireless virtualization

    摘要:Future network is envisioned to be a multi-service network which can support various types of terminal devices with diverse quality of service requirements. As one of the key technologies, wireless virtualization establishes different virtual networks dependent on different application scenarios and user requirements through flexibly slicing and sharing wireless resources in future networks. In this paper, we first propose a service-centric wireless virtualization model to slice network according to service types. In this model, how to share and slice wireless resource is one of the fundamental issues to be addressed. Therefore, we formulate and solve a multi-service resource allocation problem to realize spectrum virtualization. Different from the existing strategies, we decouple the multi-service resource allocation problem in the proposed virtualization model to make it easier to solve. Specifically, it is solved in two stages: inter-slice resource allocation and intra-slice resource scheduling. In the first stage, we formulate the inter-slice resource allocation as a discrete optimization problem and propose a heuristic algorithm to get sub-optimal solution of this NP-hard problem. In the second stage, we modify several existing scheduling algorithms suitable for scheduling users of several specific services. Numerical results show the superiority of the proposed scheduling algorithms over the existing ones when applied to schedule specific services. Moreover, proposed resource allocation scheme is verified to meet the properties of virtualization and solves the multi-service resource allocation problem well.