波长分配

• Routing and wavelength assignment ( rwa ) algorithm is the key problem of mplms control layer . a dynamic routing and wavelength assignment ( rwa ) algorithm with the design pr otection is proposed , with load balance and capacity constraint of physical links taken into account
  路由和波长分配( rwa )是mplms控制层面的一个重要问题，本文基于考虑链路负载均衡和容量限制提出了一种具有保护设计的动态路由和波长分配算法。
• At last we study the network surviving problem in wdm network with partial wavelength conversion . based on the layered graph , a routing and wavelength assignment algorithm based on qos in survivable wdm network is proposed . this results show that this algorithm can not only meet the different qos requirements of the client layer ’ s service , but also utilize the finite networking resources efficiently with the reduced blocking probability
  首先研究了部分波长可变wdm网状网中的网络生存性,而后结合分层图模型提出了一种在动态业务情况下的支持不同qos要求的路由波长分配算法,仿真结果表明该算法具有很好的性能,提高了全网的资源利用率,满足了客户层业务在建立光通路时不同的qos要求对网络阻塞率的要求。
• In this thesis , firstly , the basic conceptions and existing algorithms for rwa problem are introduced ; secondly , a research is made on a dynamic routing and wavelength assignment algorithm in wron considering wavelength relation in order to reduce the resources in networks , the blocking probability and the cost of wavelength assignment
  本论文首先介绍了rwa问题的相关概念及常见算法;接着对动态业务条件下具有波长变换能力节点的波长分配算法进行深入研究。基于节约网络资源和降低网络的阻塞率和波长分配代价的思想,在wron网络的动态路由波长分配算法中考虑波长相关性。
• Given the multicast request , the optimal object of the problem is to minimize total number of conversions required . in wavelength assignment , we should consider the requirements that the number of needed converters along the path from multicast source node to any member cannot be larger than specified value because of the signal distortion introduced by wavelength converters . at last , we present several dynamic programming to get the exact optimal wavelength assignment scheme under session blocking policy and destination blocking policy
  考虑到波长转换器引入的信号失真和噪声，引进了失真约束，即要求从组播源结点到每个组播成员的路径上使用的波长转换器数目均在指定的范围之内;对于给定的组播需求，优化目标是在满足失真约束的基础上使整个组播树上使用波长转换器的数目最少;并使用动态规划给出了sbp和dbp两种连接建立策略下精确的最优波长分配算法。
• First , the growing history and the basic principle of the wdm optical networks are introduced , then the construct of the wdm all - optical networks is discussed , physical topology and logical topology and so on . then , the routing technology in wdm system is presented in this paper , as well as key optical components in optical networks . the routing and wavelength assignment issue in the optimal design of rwa algorithm is particularly explored
  论文介绍了波分复用系统的原理、发展历程，讨论了wdm全光网体系结构、网络物理拓扑和逻辑拓扑，光交换/光路由等技术和关键器件，着重研究波长路由型全光网优化设计中的路由和波长分配问题。
• In this thesis , firstly , the existing heuristic algorithms for steiner tree problem are summarized ; secondly , a research and analysis is made on the multicast trees that satisfy qos requirement and a fast routing algorithm for delay - constrained low - cost multicast is presented . through simulation , we find that the proposed algorithm is simple and can get the low - cost tee in polynomial time . at last , the multicast routing and wavelength assignment in wdm optical networks is studied ; a routing and wavelength assignment in wdm all - optical networks is presented
  本论文首先综述了多播路由问题的理论基础，接着对满足qos约束的多播路由问题进行了研究，提出了一种快速的时延受限最小代价多播路由算法，该算法简单、快捷，能在多项式时间内找到满足时延约束的代价较小的多播树，具有良好的性能；最后，研究了wdm光传送网中的多播路由和波长分配问题，并提出了wdm全光网络中的多播路由与波长分配算法，该算法将路由和波长分配统一进行，构造了时延受限低代价多播树，克服了将寻径和波长分配分步进行的弊端，避免了同类算法的较高复杂性。
• The performance of xgm wavelength converters is studied in chapter 2 . three rwa algorithms for xgm wavelength converters are proposed , by simulation in different kinds of networks , the performance of three algorithms are compared , the results show that the performance of the xgm ( ff / sw ) algorithm is the best and its complexity is not high
  中文摘要一第二章主要研究了xgm有限范围波长变换器在wdm网络中的性能，设计了3种适合与xgm波长变换器的路由与波长分配算法，通过在不同网络中的仿真来比较3种算法的性能差异，研究得出， xgmof沼w ）算法的阻塞率性能和公平性性能最佳，而且算法的复杂度也不高。
• For each randomly arrived request , the correlation of different wavelengths on different , links in all its possible routes is described by wavelength weight in lcwa algorithm . based on wavelength weight , we try to assign wavelengths on each candidate route using shortest - path algorithm and choose the best as its route and wavelength assignment scheme
  算法引入了波长相关性的概念，用波长关联权值定量描述了各路由的前后链路上不同波长之间的相互依赖关系；在建立连接时首先使用那些依赖性强，对其他路由影响小的波长，从全局的角度出发选择最优的路由和波长分配方案。
• In this paper we firstly illustrate the feasibility and advantages of eliminating intermediate layers , e . g . sdh / sonet and atm , to map the ip packets directly into wavelength channels . under this framework , we then f ocus our interest on the resource allocation of ip over wdm networks
  第二章研究了ipoverwdm网中支持qos的资源分配算法，分两种方法予以研究：一为基于光层的方法，采用固定选路后，资源分配问题就能简化为波长分配问题，从而可大大简化网络的控制和管理。