灵活光网络路由与频谱分配算法的研究

发布时间：2018-05-05 06:47

本文选题：灵活光网络 + 路由频谱分配　；参考：《南京邮电大学》2015年硕士论文

【摘要】：随着光纤通信在电信网中获得大规模的应用,网络对人们的生活影响越来越大,人们也将越来越依赖通信网络。但是传统的WDM光网络在频谱资源上的管理模式不灵活,导致整个网络的带宽资源浪费严重,已不能满足未来大容量、高速率的网络需求。针对WDM光网络缺乏带宽灵活性的问题,国际上提出了具有频谱效率高、可扩展性强的频谱切片灵活光网络。本文基于以上背景着重研究了灵活光网络的路由频谱分配问题和频谱碎片重构问题。首先,针对灵活光网络的网络资源模型,提出了最大邻接度的描述方法。基于这种描述方法,分别对弹性光网络的两大核心问题进行了研究。其次,针对路由频谱分配问题,在路由分配方面,采用了KSP算法；在频谱分配方面,提出了新的频谱分配算法：基于最大频谱邻接度的分配算法。并且利用网络仿真工具搭建了弹性光网络仿真模型,对上述算法进行功能实现。最后,针对频谱碎片重构问题,描述了重构的一般过程和主要研究点,并提出基于备选路径的全网重构算法,并对重构算法进行仿真验证,与最短路径重构算法进行对比。通过实验证明,基于最大频谱邻接度的分配算法能够明显改善网络阻塞率性能,提高了频谱利用率。基于备选路径的全网重构算法能够有效减少网络中的碎片,从而改善了网络性能。
[Abstract]:With the large-scale application of optical fiber communication in telecommunication network, network has more and more influence on people's life, and people will rely on communication network more and more. However, the traditional WDM optical network is inflexible in the management mode of spectrum resources, which leads to a serious waste of bandwidth resources in the whole network, which can no longer meet the needs of large capacity and high speed network in the future. Aiming at the lack of bandwidth flexibility in WDM optical networks, a spectrum slicing flexible optical network with high spectral efficiency and high scalability is proposed. Based on the above background, the routing spectrum allocation problem and spectrum fragment reconstruction problem of flexible optical networks are studied in this paper. Firstly, for the network resource model of flexible optical network, a description method of maximum adjacency is proposed. Based on this description method, two core problems of elastic optical network are studied. Secondly, for the problem of routing spectrum allocation, KSP algorithm is adopted in routing assignment, and a new spectrum allocation algorithm based on maximum spectrum adjacency is proposed in spectrum allocation. The simulation model of elastic optical network is built by using network simulation tools, and the above algorithm is implemented. Finally, the general process and main research points of spectrum fragment reconstruction are described, and an alternative path based whole network reconstruction algorithm is proposed. The simulation results show that the algorithm is compared with the shortest path reconstruction algorithm. The experiments show that the algorithm based on the maximum spectrum adjacency can obviously improve the blocking performance of the network and improve the spectrum efficiency. The whole network reconstruction algorithm based on alternative paths can effectively reduce the fragmentation in the network and improve the network performance.
【学位授予单位】：南京邮电大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：TN929.1

【相似文献】