面向节能的服务承载网技术研究

发布时间：2018-05-18 21:31

本文选题：可重构服务承载网 + 节能　；参考：《解放军信息工程大学》2014年硕士论文

【摘要】：可重构信息通信基础网络体系通过在共享的底层物理资源基础上构建可重构服务承载网(RSCN),支持多种异构网络的并存与管理,进而可以向网络用户提供多样化的网络业务服务。然而当前在构建RSCN的过程中,底层承载网节能的需求没有得到满足。一方面用户需求到达时没有快速可靠的节能方案来构建RSCN,另一方面用户需求结束时底层承载网并不处于较好的节能状态。如何构建及调整RSCN使其最优化地满足当前网络的节能需求是亟待解决的重要研究课题。论文依托国家973项目“可重构信息通信基础网络体系研究”和“业务自适应认知承载机理”子课题,针对RSCN节能问题在需求到达时和需求结束时两种情况下存在的难点展开了较为深入的研究。具体工作如下:1.针对一般需求的RSCN节能构建问题,提出了基于节点聚合使用的两阶段映射方法。该方法考虑了底层节点的资源能力和网络拓扑位置两方面因素,并基于紧密中心度提出了节点节能重要度的概念,节点排序后根据贪婪策略优先映射服务节点,并检验保证底层链路距离较短。仿真结果表明本方法在一般需求的RSCN情况下使构建成功率达到70%、长期收益开销比达到75%的同时,提高收益能耗比10%左右。2.针对大规模及高带宽需求的RSCN节能构建问题,提出了一种拓扑聚合使用的寻核映射方法。该方法在节点节能重要度的基础上,找到核心服务节点优先映射,通过检验确保所选底层承载核心节点满足核心服务节点的要求,节点和链路映射同步进行,根据贪婪策略进行邻居搜索保证所选底层节点距离和较小。同时提出一种RSCN的需求判定方法进而使用混合算法进行RSCN构建。仿真结果表明该算法在处理大规模及高带宽需求的RSCN节能构建问题时能够提升接近20%的构建成功率,提高长期收益开销比和收益能耗比10%以上;该混合算法能够有效地处理普通环境下RSCN节能构建问题,提高构建性能。3.针对RSCN结束时底层承载网节能重构问题,提出了基于逼近理想排序法的均衡节能重构方法。该方法首先基于逼近理想排序法选择底层承载节点的相关信息作为方案属性,根据节能或均衡的重构需求排序以找到最佳重构节点,然后优先进行节能重构,再对工作状态的网络拓扑进行均衡重构。仿真结果表明该方法改善了底层承载网的负载均衡情况和能耗水平,提升了构建成功率和收益能耗比。
[Abstract]:The reconfigurable information and communication basic network system can support the coexistence and management of many heterogeneous networks by constructing a reconfigurable service bearer network on the basis of shared underlying physical resources, and then can provide a variety of network services to network users. However, in the process of constructing RSCN, the energy saving requirement of the underlying bearer network has not been satisfied. On the one hand, there is no fast and reliable energy saving scheme to build RSCN when user requirements arrive; on the other hand, the underlying carrier network is not in a better energy saving state when user demand ends. How to construct and adjust the RSCN to meet the energy saving requirements of the current network is an important research topic to be solved urgently. The thesis relies on the national 973 project "Research on Reconfigurable Information and Communication basic Network system" and "Service Adaptive Cognitive bearing Mechanism". In this paper, the problem of energy saving in RSCN is studied deeply in the two situations of demand arrival and demand end. The work is as follows: 1. A two-stage mapping method based on node aggregation is proposed to solve the problem of energy saving construction of RSCN with general requirements. This method takes into account the resource capacity of the underlying node and the network topology location, and proposes the concept of the node energy saving importance based on the closeness centrality. The nodes are sorted to map the service nodes first according to greedy strategy. And check to ensure that the lower link distance is short. The simulation results show that this method can make the construction success rate reach 70%, the long-term ratio of income to cost reach 75%, and increase the ratio of income to energy consumption about 10%. In order to solve the problem of large scale and high bandwidth RSCN energy saving construction, a kernel mapping method for topology aggregation is proposed. Based on the importance of energy saving of nodes, this method finds the priority mapping of core service nodes, ensures that the core nodes selected to carry the core nodes meet the requirements of the core service nodes, and synchronizes the mapping between nodes and links. According to greedy strategy, neighbor search ensures the distance and the size of the selected nodes are small. At the same time, a requirement determination method of RSCN is proposed, and then RSCN is constructed by hybrid algorithm. The simulation results show that the proposed algorithm can improve the success rate of RSCN construction by nearly 20% and increase the ratio of long-term income to cost and energy consumption by more than 10% when dealing with the problem of large scale and high bandwidth RSCN energy saving construction. The hybrid algorithm can effectively deal with the problem of energy saving construction of RSCN in common environment, and improve the performance of building. 3. 3. In order to solve the problem of energy saving reconfiguration of bottom bearing network at the end of RSCN, a balanced energy saving reconfiguration method based on approximate ideal sorting method is proposed. Firstly, based on the approximate ideal sorting method, the information of the underlying bearer node is selected as the scheme attribute, and the optimal reconfiguration node is sorted according to the energy saving or balanced reconfiguration requirements, and then the energy saving reconfiguration is given priority. Then the network topology of the working state is reconfigured. The simulation results show that the proposed method can improve the load balance and energy consumption level of the underlying load-carrying network, and improve the success rate of construction and the ratio of income to energy consumption.
【学位授予单位】：解放军信息工程大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TP393.09

【参考文献】