虚拟无线资源在异构网络中的应用研究
发布时间：2018-08-12 07:53
【摘要】：近年互联网规模在不断地发生着扩张,随之而来的是互联网在架构方面的移动性、可扩展性以及安全性等方面的问题。网络虚拟化技术作为缓解甚至解决互联网架构僵硬化的关键手段,引起了未来网络研究者的广泛重视。怎样实现多个虚拟网络映射到底层异构物理网络,是网络虚拟化过程中亟待解决的重要技术。目前来说,无线虚拟网络还是一个比较新的领域,因此,对于虚拟无线异构网络中资源分配算法的研究具有重要的理论和实践意义。论文介绍了虚拟网络映射过程中资源分配的约束条件、资源的优化目标以及现有的虚拟网络映射算法。在此基础上研究了一种基于启发式排序的异构无线虚拟网络的映射算法HWVN-HS。算法要为每一个虚拟节点确定一组待映射的候选物理节点。在完成待映射候选物理节点的确定后,随即对候选物理节点的数量执行排序算法,然后根据各个虚拟节点所对应的候选物理节点的数量由少到多依次进行映射。算法有两个排序过程,一个是对虚拟节点对应的候选物理节点数量进行排序从而决定哪一个虚拟节点优先映射;另一个是对物理节点的潜力进行排序,决定出哪一个物理节点优先进行映射。在节点映射完成后,接下来进行路径选择。在选择路径时通过迪杰斯特拉最短路径算法计算路径成本,然后根据公式计算得到物理节点的映射潜力,物理节点的映射潜力越小,映射的优先级越高。仿真结果表明HWVN-HS使得物理资源的利用更加均衡。论文研究了一种基于资源补偿的自适应异构无线虚拟网络的资源分配策略AHWVN-RC。假设虚拟基站有K个需求用户,对用户在选择网络时的参数及分配得到的数据速率做出了一组约束,并且通过约束松弛方法对约束条件组进行简化,得到一组线性规划的约束。AHWVN-RC中的自适应分配指的是根据资源的供需状况进行的资源再分配。AHWVN-RC中补偿机制的调用主要分为两个过程:首先是在同一个基站中补偿可用的资源;若同一个基站中的无线资源不足,则调用基站就近位置的其他基站给予补偿。该算法策略提高了虚拟网络运营商的满意度水平,在容量受限的条件下使得有效利用率达到最大化。
[Abstract]:In recent years, the scale of the Internet has been continuously expanding, followed by the mobility, scalability and security of the Internet in the aspect of architecture. Network virtualization technology, as a key means to alleviate or even solve the rigidity of Internet architecture, has attracted extensive attention of network researchers in the future. How to map multiple virtual networks to underlying heterogeneous physical networks is an important technology to be solved in the process of network virtualization. At present, wireless virtual network is still a new field, so the research of resource allocation algorithm in virtual wireless heterogeneous network has important theoretical and practical significance. This paper introduces the resource allocation constraints, resource optimization objectives and existing virtual network mapping algorithms in the process of virtual network mapping. On this basis, a mapping algorithm HWVN-HSs based on heuristic sorting for heterogeneous wireless virtual networks is studied. The algorithm determines a set of candidate physical nodes to be mapped for each virtual node. After the determination of candidate physical nodes to be mapped, the sorting algorithm is performed on the number of candidate physical nodes, and then the number of candidate physical nodes is mapped according to the number of candidate physical nodes corresponding to each virtual node. The algorithm has two sorting processes, one is to sort the number of candidate physical nodes corresponding to the virtual node to determine which virtual node should be mapped first, and the other is to sort the potential of the physical node. Determines which physical nodes are mapped first. After the node mapping is complete, the path is selected. The path cost is calculated by Dijstra shortest path algorithm, and then the mapping potential of physical node is calculated according to the formula. The smaller the mapping potential of physical node is, the higher the priority of mapping is. Simulation results show that HWVN-HS makes the utilization of physical resources more balanced. An adaptive heterogeneous wireless virtual network resource allocation strategy AHWVN-RCbased on resource compensation is studied in this paper. Assuming that the virtual base station has K demand users, this paper makes a set of constraints on the parameters and the assigned data rate of the user when selecting the network, and simplifies the constraint group by the method of constraint relaxation. To obtain a set of linear programming constraints. AHWVN-RC adaptive allocation refers to the resource redistribution according to the supply and demand of resources .AHWVN-RC compensation mechanism is mainly divided into two processes: first in the same base station to compensate the available resources; If the wireless resources in the same base station are insufficient, the other base stations in the nearest location are called to compensate. The algorithm strategy improves the satisfaction level of the virtual network operators and maximizes the effective utilization under the condition of limited capacity.
【学位授予单位】：南京邮电大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TN92
本文编号：2178415
[Abstract]:In recent years, the scale of the Internet has been continuously expanding, followed by the mobility, scalability and security of the Internet in the aspect of architecture. Network virtualization technology, as a key means to alleviate or even solve the rigidity of Internet architecture, has attracted extensive attention of network researchers in the future. How to map multiple virtual networks to underlying heterogeneous physical networks is an important technology to be solved in the process of network virtualization. At present, wireless virtual network is still a new field, so the research of resource allocation algorithm in virtual wireless heterogeneous network has important theoretical and practical significance. This paper introduces the resource allocation constraints, resource optimization objectives and existing virtual network mapping algorithms in the process of virtual network mapping. On this basis, a mapping algorithm HWVN-HSs based on heuristic sorting for heterogeneous wireless virtual networks is studied. The algorithm determines a set of candidate physical nodes to be mapped for each virtual node. After the determination of candidate physical nodes to be mapped, the sorting algorithm is performed on the number of candidate physical nodes, and then the number of candidate physical nodes is mapped according to the number of candidate physical nodes corresponding to each virtual node. The algorithm has two sorting processes, one is to sort the number of candidate physical nodes corresponding to the virtual node to determine which virtual node should be mapped first, and the other is to sort the potential of the physical node. Determines which physical nodes are mapped first. After the node mapping is complete, the path is selected. The path cost is calculated by Dijstra shortest path algorithm, and then the mapping potential of physical node is calculated according to the formula. The smaller the mapping potential of physical node is, the higher the priority of mapping is. Simulation results show that HWVN-HS makes the utilization of physical resources more balanced. An adaptive heterogeneous wireless virtual network resource allocation strategy AHWVN-RCbased on resource compensation is studied in this paper. Assuming that the virtual base station has K demand users, this paper makes a set of constraints on the parameters and the assigned data rate of the user when selecting the network, and simplifies the constraint group by the method of constraint relaxation. To obtain a set of linear programming constraints. AHWVN-RC adaptive allocation refers to the resource redistribution according to the supply and demand of resources .AHWVN-RC compensation mechanism is mainly divided into two processes: first in the same base station to compensate the available resources; If the wireless resources in the same base station are insufficient, the other base stations in the nearest location are called to compensate. The algorithm strategy improves the satisfaction level of the virtual network operators and maximizes the effective utilization under the condition of limited capacity.
【学位授予单位】：南京邮电大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TN92
【参考文献】
相关期刊论文 前5条
1 曹傧;郎文强;李云;;基于最大收益的无线虚拟网络重映射算法[J];重庆邮电大学学报(自然科学版);2016年05期
2 曹傧;郎文强;陈卓;李云;;无线网络虚拟化中资源共享的功率分配算法[J];通信学报;2016年02期
3 王化;;基于虚拟网络的故障探测及诊断算法的研究[J];电脑开发与应用;2012年12期
4 罗娟;刘川川;李仁发;;基于链路可靠性的无线虚拟网络分配方法[J];通信学报;2012年S1期
5 蔡志平;刘强;吕品;肖侬;王志英;;虚拟网络映射模型及其优化算法[J];软件学报;2012年04期
相关博士学位论文 前2条
1 戴庆龙;接入网虚拟化融合组网技术研究[D];北京邮电大学;2015年
2 刘文志;网络虚拟化环境下资源管理关键技术研究[D];北京邮电大学;2012年
相关硕士学位论文 前4条
1 马超;基于负载压力的虚拟网络映射算法研究[D];重庆大学;2015年
2 周宇清;异构网络中网络选择与资源管理技术的研究[D];南京邮电大学;2015年
3 任剑;无线基站虚拟化研究及实现[D];中国科学院大学(工程管理与信息技术学院);2013年
4 刘川川;无线网络虚拟化中资源分配算法研究[D];湖南大学;2013年
，本文编号：2178415
本文链接：https://www.wllwen.com/kejilunwen/xinxigongchenglunwen/2178415.html
