基于多物理层损伤限制的光网络RWA算法研究

在透明光网络中,如何在选路过程中自适应地规避物理层损伤进而实现高质量的传输服务是亟待解决的问题.提出了一种面向多物理损伤约束的RWA算法,改进原有损伤感知RWA算法考虑物理损伤单一不够全面的问题,尝试将多个物理损伤作为路径选择的多个约束条件,从而可以选择损伤最小的光路来完成光连接的请求,从而满足未来高传输质量的需求.     

WDM光网络中基于传输损伤的公平RWA算法

在WDM光网络中,物理层上存在使信号传输质量恶化的因素,当信号质量劣化到一定程度会导致连接失败,因此有必要在选路和波长分配RWA（Routing and Wavelength Assignment）算法中考虑物理层的传输损伤。连接公平性问题是指网络中长路径连接请求的阻塞率表现比短路径差,文中分析传输损伤约束的引入对连接公平性的影响,提出基于传输损伤的动态RWA算法：固定波长配额FWQ（Fixed Wavelength Quota）算法和非固定波长配额UFWQ（UnFixed Wavelength Quota）算法。     

WDM网络分布式物理损伤感知RWA算法

随着传输速率的不断升级,在透明传送过程中,各种损伤的积累会对光信号的质量造成严重影响,因而不能保证高QoS(服务质量)地传输信号.文章提出一种物理损伤感知的分布式RWA(波长路由分配)算法,将物理层传输质量评估分布在中继段路由和波长信道中,分别由损伤感知路由、波长通道传输质量排序和按优先级分配3部分构成.仿真实例证明了...     

光网络中支持区分业务的损伤感知QoS机制

光网络中物理层损伤会造成明显的信号质量下降。为了保证QoS(服务质量),必须在RWA(路由和波长分配)算法中考虑这些损伤及其引起的变化。文章提出了一种损伤感知的差异化路由与波长算法,并针对规则Mesh网络与Cernet网络进行了数值仿真,结果表明,在满足QoS要求的情况下优先保证网络中高等级业务的波长分配,能降低高等级业务的阻塞率,并能提高网络总体的资源利用率。     

光网络中一种考虑信号损伤限制和服务质量区分的动态RWA算法

在光网络中,光信号沿着路由与波长分配(RWA)算法选定的光通路传输的过程中会受到各种信号损伤的影响而导致信号质量的不断下降,严重影响着业务的服务质量(QoS).而光网络中多样化的客户层业务往往有着不同的QoS的需求,因此有必要根据不同的业务QoS需求对光信号损伤的影响进行不同程度的控制.针对这一问题,提出了一种能同时考虑信号损伤限制和服务质量区分的动态RWA算法,并通过计算机仿真的方法对其性能进行了分析和验证.结果表明:该算法既能克服光网络中信号损伤的影响又能为不同级别的业务提供不同的QoS保证,更贴近实际需求.     

基于分层图的动态RWA算法的仿真与实现

RWA问题是光网络中的一个核心问题。随着RWA优化算法求解方式的简化,算法的运算效率得到了提高,但却牺牲了解的优化性能。如何使优化效率和时间效率协调统一是当前光网络中RWA优化算法设计的难点。对光网络中动态RWA问题进行了阐述,对基于分层图的动态RWA算法进行了仿真与分析,仿真证明,该算法可以大幅降低网络的阻塞性能,且算法稳定性更好、资源利用率较高。     

多域光网络中的动态RWA算法研究

随着光网络规模的不断增大,下一代智能光网络将被划分为多个路由域进行分布式管理.由于在这种具有分布式特点的多域光网络中,每个路由域只了解本地子网内的拓扑和资源信息,因此以往光网络中已有的基于全网信息的动态RWA算法将不在有效.文章首先分析了多域光网络中的动态RWA问题,然后针对多域网的特点对已有的RWA算法进行了修改,并在给定的多域光网络模型中对该算法进行了仿真研究.结果表明:在多域网络环境下,以往的动态RWA算法急需改进.     

一种基于网络风险的路由波长分配算法

大多数RWA(路由波长分配)问题研究都是基于阻塞率、负载均衡、信号损伤和物理攻击的,很少涉及到业务与链路工作状态的依赖关系,然而链路的失效必然造成全网业务安全性能的下降。文章从业务风险的角度描述链路失效对全网业务的影响,提出了一种基于网络风险的RWA算法——R-RWA。在路由分配阶段,该算法把具有较小网络风险的路由方案分配给光路请求,以降低链路失效对全网业务的影响。仿真结果表明,与经典SP(最短路径)算法相比,该算法可以有效地降低网络的安全风险,提高网络的抗风险能力。     

下一代光网络中光路的快速建立

文章针对下一代光网络中光路快速建立的问题,介绍了IP-over-optical的网络体系结构,并在此基础上介绍了动态RWA问题和综合解决RWA问题的动态和半动态寻路算法,讨论了这两种算法的容错性能。     

智能光网络中RWA问题的研究

在ASON中．路由和波长分配（RWA）算法是其中一个关键问题。由于当前网络中业务增长迅速．而网络中可用资源有限．因此要使用合理的RWA算法来优化网络资源。本文分别阐述了静态RWA、动态RWA以及RWA算法中的其他问题．并主要对路由和波长问题进行了分析和研究。     

基于物理损伤联合影响的光信号脉宽模型研究

针对物理损伤的精确评估问题,分析了自相位调制(SPM)对群速度色散(GVD)的抑制或加强作用.基于它们共同对信号产生的影响,提出了考虑物理损伤联合影响的光信号脉宽模型,并将此模型应用到基于物理损伤感知的路由波长分配(IA-RWA)算法仿真中.仿真结果表明,综合考虑物理损伤的联合影响有利于准确规避损伤严重的路径,降低阻塞率.     

基于超图模型的多域ASON损伤感知组播路由算法

如何在缺乏全局信息的条件下构建安全可靠的组 播树,是智能光网络分域管理后引入的一个新问 题。针对此问题,通过建立新型的多域智能光网络超图模型,在考虑物理或攻击损伤的约束 条件下,利用 基于超路径的域间超树构建方法,结合K最短路径策略,提出了 一种基于超图模型的多域ASON损伤感知 组播路由算法,并进行了实例分析。本文算法在完成多域组播路由建立与波长分配的同时, 具有较低的时间复杂度。通过测量K值、组播规 模、波长数量及分配策略、域数量对网络平均连接阻塞率的影响,实验结果表明,本文算法 是有效的且取得了较好的阻塞性能,同时建议多域ASON组播规模大小应与域的数量保持一 定的比例均衡。     

Challenges and requirements for introducing impairment-awareness into the management and control planes of ASON/GMPLS WDM networks

The absence of electrical regenerators in transparent WDM networks significantly contributes to reduce the overall network cost. In transparent WDM networks, a proper resource allocation requires that the presence of physical impairments in routing and wavelength assignment (RWA) and lightpath provisioning be taken into account. In this article a centralized, a hybrid centralized-distributed and two distributed approaches that integrate information about most relevant physical impairments in RWA and lightpath provisioning are presented and assessed. Both centralized and hybrid approaches perform a centralized path computation at the management-plane level, utilizing physical impairment information, while the lightpath provisioning is done by the management plane or the control plane, respectively. The distributed approaches fall entirely within the scope of the ASON/GMPLS control plane. For these two approaches, we provide functional requirements, architectural functional blocks, and protocol extensions for implementing either an impairment-aware real-time RWA, or a lightpath provisioning based on impairment-aware signaling     

Offline Impairment-Aware Routing and Wavelength Assignment Algorithms in Translucent WDM Optical Networks

Physical impairments in optical fiber transmission necessitate the use of regeneration at certain intermediate nodes, at least for certain lengthy lightpaths. We design and implement impairment-aware algorithms for routing and wavelength assignment (IA-RWA) in translucent optical networks. We focus on the offline version of the problem, where we are given a network topology, the number of available wavelengths and a traffic matrix. The proposed algorithm selects the 3R regeneration sites and the number of regenerators that need to be deployed on these sites, solving the regenerator placement problem for the given set of requested connections. The problem can be also posed in a slightly different setting, where a (sparse) placement of regenerators in the network is given as input and the algorithm selects which of the available regenerators to use, solving the regenerator assignment problem. We formulate the problem of regenerator placement and regenerator assignment, as a virtual topology design problem, and address it using various algorithms, ranging from a series of integer linear programming (ILP) formulations to simple greedy heuristic algorithms. Once the sequence of regenerators to be used by the non-transparent connections has been determined, we transform the initial traffic matrix by replacing non-transparent connections with a sequence of transparent connections that terminate and begin at the specified 3R intermediate nodes. Using the transformed matrix we then apply an IA-RWA algorithm designed for transparent (as opposed to translucent) networks to route the traffic. Blocked connections are re-routed using any remaining regenerator(s) in the last phase of the algorithm.      

多光纤波分复用网动态路由和波长分配算法

本文研究了多光纤波分复用光互连网的动态路由和波长分配问题,提出了基于分层图模型的两种动态路由算法,LG-1和LG-2.这两种算法将路由和波长分配问题转换为如何在分层图中支持尽可能多的光路.这使得设计者可以同时考虑路由和波长分配子问题,从而取得了更好的效果.计算机仿真表明基于分层图的算法大大优于传统的固定路由和动态路由算法.     

WDM网络中基于分层图模型的ICBR路由算法

考虑到物理损伤导致光信号质量下降的严重性,提出了一种新的损伤感知路由和波长分配算法。该算法同时考虑多种线性和非线性损伤,从光信噪比(OSNR,Optical Signal Noise Ratio)和Q因子两方面来评估光信号的整体质量,严格保证了业务的服务质量。最后将损伤感知路由算法(ICBR,Impairment Constraint Based Routing algorithm)和分层图模型相结合,与传统ICBR算法相比,避免了不必要的连接阻塞,显著改善了网络性能。     

Routing and wavelength assignment of scheduled lightpath demands

We present algorithms that compute the routing and wavelength assignment (RWA) for scheduled lightpath demands in a wavelength-switching mesh network without wavelength conversion functionality. Scheduled lightpath demands are connection demands for which the setup and teardown times are known in advance. We formulate separately the routing problem and the wavelength assignment problem as spatio-temporal combinatorial optimization problems. For the former, we propose a branch and bound algorithm for exact resolution and an alternative tabu search algorithm for approximate resolution. A generalized graph coloring approach is used to solve the wavelength assignment problem. We compared the proposed algorithms to an RWA algorithm that sequentially computes the route and wavelength assignment for the scheduled lightpath demands.     

Adaptive wavelength routing in all-optical networks

We consider routing and wavelength assignment in wavelength-routed all-optical networks (WAN) with circuit switching. The conventional approaches to address this issue consider the two aspects of the problem disjointly by first finding a route from a predetermined set of candidate paths and then searching for an appropriate wavelength assignment. We adopt a more general approach in which we consider all paths between a source-destination (s-d) pair and incorporate network state information into the routing decision. This approach performs routing and wavelength assignment jointly and adaptively, and outperforms fixed routing techniques. We present adaptive routing and wavelength assignment algorithms and evaluate their blocking performance. We obtain an analytical technique to compute approximate blocking probabilities for networks employing fixed and alternate routing. The analysis can also accommodate networks with multiple fibers per link. The blocking performance of the proposed adaptive routing algorithms are compared along with their computational complexity     

Multicast routing and wavelength assignment with delay constraint in WDM networks with sparse wavelength conversions

With the developments in multimedia and other real-time group applications, the question of how to establish multicast trees satisfying Quality-of-Service (QoS) requirements is becoming a very important problem. In this paper, multicast routing and wavelength assignment with delay constraint (MCRWA-DC) in wavelength division multiplexing (WDM) networks with sparse wavelength conversions is studied. We propose a colored multigraph model for the temporarily available wavelengths. Based on this colored multigraph model, two heuristic algorithms are proposed to solve the MCRWA-DC problem. The proposed algorithms have the following advantages:(1) finish multicast routing and wavelength assignment in one step; (2) the total cost of the multicast tree is low; (3) the delay from the source node to any multicast destination node is bounded; and (4) locally minimize the number of wavelength conversions and the number of different wavelengths used to satisfy a multicast request. Simulation results show that the proposed algorithms work well and achieve satisfactory blocking probability.     

QoS-Aware Wavelength Assignment With BER and Latency Constraints for All-Optical Networks

Physical impairments originating from optical fiber components and intermediate switching nodes can be the dominant reason calls are blocked in wide-area all-optical wavelength division multiplexing (WDM) networks. When a centralized network controller is used, estimating the impact of the physical impairments on the quality of a lightpath before provisioning it can cause a significant delay. In this paper, quality of service aware wavelength assignment algorithms are proposed that consider both bit-error rate (BER) and latency constraints. A novel wavelength assignment technique called wavelength ordering is shown via simulation to reduce the call blocking probability resulting from both physical impairments and excessive processing delay caused by channel BER estimation.