混合线路速率光网络节能路由算法研究

发布时间：2018-01-22 20:47

本文关键词： 混合线路速率光网络节能路由传输损伤共享保护业务持续时间　出处：《大连海事大学》2017年硕士论文　论文类型：学位论文

【摘要】：混合线路速率(Mixed Line Rate,MLR)光网络因其传输速率高、成本低、更适合异构性明显的业务请求等优点,成为近年来光网络研究的热点。近年来,低碳、节能和绿色已成为社会发展的趋势。因此,在保障网络性能的同时,如何设计高效的节能路由算法,是MLR光网络中亟待解决的一个关键问题。本文针对MLR光网络的节能路由问题进行研究,综合考虑MLR光网络传输损伤、能耗和业务疏导等因素,提出三种节能算法,并通过仿真对算法性能进行评测。本文首先分析了 MLR光网络的发展概况以及国内外的研究现状,着重对生存性技术、节能技术进行了讨论,归纳和总结了 MLR光网络中基于传输损伤、考虑生存性、节能和支持业务疏导的路由算法。在此基础上,基于波长分层图模型提出一种传输损伤感知的节能共享通路保护算法(Physical Impairment aware and Energy-saving Shared Path Protection,PIE-SPP)及其改进算法 PIE-SPP1。两种算法在为业务请求建立连接时,综合考虑链路和节点状态、传输损伤等多种因素,尽可能使工作路径和保护路径聚合在不同光纤链路上,同时鼓励使用已激活设备建立工作路径,而尽可能选择处于休眠状态的资源建立保护路径,可让更多设备休眠,在保证较低阻塞率情况下,有利于减少网络能耗。与PIE-SPP算法首选传输损伤最低的光路为业务请求建立工作路径不同,PIE-SPP1算法在保证满足传输损伤条件下,总是鼓励选择能耗更低光路建立工作路径,因此,其节能性能更优于PIE-SPP算法。其次,针对支持业务疏导的MLR光网络,综合考虑业务持续时间、业务疏导和节能等因素,提出一种业务持续时间感知的节能疏导算法(Holding-Time aware and Energy-saving Grooming,HTEG)。该算法考虑链路空闲波长数目、业务持续时间等,选择需额外消耗能源最少的路径建立业务连接,有利于降低网络能耗。最后通过VC++6.0搭建MLR光网络仿真平台,对所提出算法进行仿真分析,并与文献中已有算法进行对比,验证了所提算法的有效性。
[Abstract]:Mixed Line rate (MLR) optical network is more suitable for heterogeneous traffic request because of its high transmission rate, low cost and so on. In recent years, low-carbon, energy-saving and green have become the trend of social development. Therefore, how to design efficient energy-saving routing algorithm while ensuring network performance. It is a key problem to be solved urgently in MLR optical network. In this paper, the energy saving routing problem of MLR optical network is studied, and the transmission damage, energy consumption and traffic grooming of MLR optical network are considered comprehensively. Three energy-saving algorithms are proposed, and the performance of the algorithm is evaluated by simulation. Firstly, this paper analyzes the development of MLR optical network and the current research situation at home and abroad, focusing on survivability technology. The energy saving technology is discussed, and the routing algorithms based on transmission damage, survivability, energy saving and traffic grooming in MLR optical network are summarized. An energy saving shared path protection algorithm based on wavelength layered graph model for transmission damage sensing is proposed. Physical Impairment aware and Energy-saving Shared Path Protection. PIE-SPP) and its improved algorithm PIE-SPP1.When the two algorithms establish connections for traffic requests, they take into account a variety of factors, such as link and node states, transmission damage and so on. As far as possible, the work path and the protection path are aggregated on different fiber links, while the use of the activated device is encouraged to establish the working path, while the resources in the dormant state are chosen as far as possible to establish the protection path. It can make more devices sleep and reduce the network energy consumption under the condition of low blocking rate. It is different from the optical path which has the least transmission damage in PIE-SPP algorithm to set up the working path for traffic request. The PIE-SPP1 algorithm is always encouraged to choose a lower energy consumption optical path to set up the working path under the condition of satisfying the transmission damage, so its energy-saving performance is better than that of the PIE-SPP algorithm. Secondly. For the MLR optical network which supports traffic grooming, the factors such as service duration, service grooming and energy saving are considered synthetically. An energy saving grooming algorithm named Holding-Time aware and Energy-saving Grooming is proposed. The algorithm takes into account the number of idle wavelengths, the service duration and so on, and selects the path that requires the least additional energy to establish the service connection. Finally, the MLR optical network simulation platform is built by VC 6.0, and the proposed algorithm is simulated and analyzed, and compared with the existing algorithms in the literature. The validity of the proposed algorithm is verified.
【学位授予单位】：大连海事大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TN929.1

【相似文献】