接入网虚拟化以及虚拟资源管理算法的研究
发布时间：2018-11-01 12:29
【摘要】：随着互联网的发展,网络用户数量迅速增长,用户的需求日益丰富,各种新的无线接入技术相继出现,并旨在为用户带来越来越丰富的业务体验。网络虚拟化,实现了底层网络的数据转发功能和控制功能的解耦与分离,并能够根据用户创建虚拟请求,动态创建虚拟网络,其本质是:减少基站的数量,共享底层物理资源。通过虚拟化技术将底层物理资源抽象成虚拟资源,然后对虚拟资源进行横向切片,再将切片资源按照指定的资源调度算法调度,用于承载虚拟请求。所以,如何高效管理并调度虚拟资源用于承载用户请求是虚拟资源管理的研究重点。首先,介绍了已有的虚拟资源管理架构的工作流程以及工作原理,并总结归纳了各架构模型的特点。已有的虚拟资源管理架构主要有:分布式管理架构、集中式管理架构、集中式管理并且分布式控制的架构模型。然后,以光和无线融合组网为研究对象,研究了基于小世界模型的虚拟资源管理算法。该算法通过对底层物理网络构建小世界模型,采用虚拟化技术将底层资源抽象成虚拟资源,用于承载虚拟请求。论文针对节点间的路径长度、数据传输时延和节点吞吐量进行了数值仿真。仿真结果表明,基于小世界模型的虚拟资源管理算法降低了节点间路径长度降低和数据传输时延,提高了节点吞吐量。最后,本文提出了基于小世界模型和用户优先级的多路径(SWPMP)映射算法。该算法定义:用于承载虚拟请求的路径不再是一条路径,而是多条路径共同承载虚拟请求,每条路径上按照指定的算法分配需要传输的数据量,因此,完成数据传输所用的时间是每条路径上的时延的最大值。传输时延的降低,使得节点处的吞吐量增加。同时,结合用户优先级对资源管理的影响,优先级高的用户请求优先被响应,而优先级低的滞后响应,保证了不同业务类型的虚拟请求有次序的被响应。论文针对映射过程中的数据传输时延和节点吞吐量进行了数值仿真,仿真中考虑了用户请求优先级对算法性能的影响。由仿真结果可以得出,基于小世界模型和用户优先级的多路径(SWPMP)映射算法与基于小世界模型的虚拟资源管理算法相比,进一步降低了数据传输时延,有效均衡了网络负载,并提高了节点吞吐量。
[Abstract]:With the development of the Internet, the number of network users is growing rapidly, and the demand of users is becoming more and more abundant. A variety of new wireless access technologies have emerged one after another, and the purpose is to bring more and more business experience to users. Network virtualization realizes the decoupling and separation of data forwarding function and control function of the underlying network and can create virtual network dynamically according to the user's virtual request. The essence of virtual network is to reduce the number of base stations and share the underlying physical resources. The underlying physical resources are abstracted into virtual resources by virtualization technology, then the virtual resources are sliced horizontally, and then the sliced resources are scheduled according to the specified resource scheduling algorithm to carry the virtual requests. Therefore, how to efficiently manage and schedule virtual resources to host user requests is the focus of virtual resource management. Firstly, the workflow and working principle of the existing virtual resource management architecture are introduced, and the characteristics of each architecture model are summarized. The existing virtual resource management architecture includes: distributed management architecture, centralized management and distributed control architecture. Then, the virtual resource management algorithm based on small world model is studied. The algorithm constructs a small world model for the underlying physical network and abstracts the underlying resources into virtual resources using virtualization technology to carry virtual requests. In this paper, the path length, data transmission delay and node throughput between nodes are numerically simulated. The simulation results show that the virtual resource management algorithm based on small world model reduces the path length and data transmission delay between nodes and improves the throughput of nodes. Finally, a multipath (SWPMP) mapping algorithm based on small world model and user priority is proposed. The algorithm defines that the path used to host the virtual request is no longer one path, but that multiple paths together carry the virtual request, and each path allocates the amount of data to be transferred according to the specified algorithm, so, The time taken to complete the data transfer is the maximum delay on each path. The reduction of transmission delay increases the throughput at the node. At the same time, considering the influence of user priority on resource management, the high priority user request is responded first, while the low priority delay response ensures that the virtual request of different service types is responded in order. In this paper, the data transmission delay and node throughput in the mapping process are numerically simulated, and the effect of user request priority on the performance of the algorithm is considered in the simulation. The simulation results show that the multi-path (SWPMP) mapping algorithm based on small-world model and user priority can further reduce the delay of data transmission and balance the network load effectively compared with the virtual resource management algorithm based on small-world model. The node throughput is improved.
【学位授予单位】：南京邮电大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TN915.6
本文编号：2303928
[Abstract]:With the development of the Internet, the number of network users is growing rapidly, and the demand of users is becoming more and more abundant. A variety of new wireless access technologies have emerged one after another, and the purpose is to bring more and more business experience to users. Network virtualization realizes the decoupling and separation of data forwarding function and control function of the underlying network and can create virtual network dynamically according to the user's virtual request. The essence of virtual network is to reduce the number of base stations and share the underlying physical resources. The underlying physical resources are abstracted into virtual resources by virtualization technology, then the virtual resources are sliced horizontally, and then the sliced resources are scheduled according to the specified resource scheduling algorithm to carry the virtual requests. Therefore, how to efficiently manage and schedule virtual resources to host user requests is the focus of virtual resource management. Firstly, the workflow and working principle of the existing virtual resource management architecture are introduced, and the characteristics of each architecture model are summarized. The existing virtual resource management architecture includes: distributed management architecture, centralized management and distributed control architecture. Then, the virtual resource management algorithm based on small world model is studied. The algorithm constructs a small world model for the underlying physical network and abstracts the underlying resources into virtual resources using virtualization technology to carry virtual requests. In this paper, the path length, data transmission delay and node throughput between nodes are numerically simulated. The simulation results show that the virtual resource management algorithm based on small world model reduces the path length and data transmission delay between nodes and improves the throughput of nodes. Finally, a multipath (SWPMP) mapping algorithm based on small world model and user priority is proposed. The algorithm defines that the path used to host the virtual request is no longer one path, but that multiple paths together carry the virtual request, and each path allocates the amount of data to be transferred according to the specified algorithm, so, The time taken to complete the data transfer is the maximum delay on each path. The reduction of transmission delay increases the throughput at the node. At the same time, considering the influence of user priority on resource management, the high priority user request is responded first, while the low priority delay response ensures that the virtual request of different service types is responded in order. In this paper, the data transmission delay and node throughput in the mapping process are numerically simulated, and the effect of user request priority on the performance of the algorithm is considered in the simulation. The simulation results show that the multi-path (SWPMP) mapping algorithm based on small-world model and user priority can further reduce the delay of data transmission and balance the network load effectively compared with the virtual resource management algorithm based on small-world model. The node throughput is improved.
【学位授予单位】：南京邮电大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TN915.6
【参考文献】
相关期刊论文 前1条
1 赵慧玲;冯明;史凡;;SDN——未来网络演进的重要趋势[J];电信科学;2012年11期
，本文编号：2303928
本文链接：https://www.wllwen.com/kejilunwen/xinxigongchenglunwen/2303928.html
