Agile protection based on network coding against key link failures

In order to provide cost-efficient and rapid protection against the key link failures dynamically, an intelligent p-cycle protection strategy based on network coding is proposed. Data units are combined from different links using network coding method at the on-cycle nodes, and then they are transmitted downstream for recovering data units lost due to failures. Under static traffic, an integer linear program (ILP) is formulated to provision the optimal p-cycles. Furthermore, according to the dynamic variation of the link importance degree, a heuristic cycle construction algorithm for generating, extending and contracting p-cycle is introduced to achieve intelligent and self-adaptive protection. The key of the proposed protection strategy is how to set the key link as a straddling link of the p-cycle as possible. The experiments demonstrate that the proposed strategy can guarantee instantaneous recovery of data units upon the failure of a key link with a low blocking rate and resource cost.     

Survivable routing and spectrum allocation algorithm based on p-cycle protection in elastic optical networks

With the number of large capacity applications in core network increasing, the bandwidth requirement of optical connections in conventional Wavelength Division Multiplexing (WDM) networks keeps enhancing, so that the Orthogonal Frequency Division Multiplexing (OFDM) technology is adopted to provide higher spectrum efficiency and flexibility in the future elastic optical networks. Meanwhile, survivability in the conventional WDM optical networks has been widely studied as an important issue to ensure the service continuity. However, survivability in OFDM-based elastic optical networks is more challenging than that in conventional WDM optical networks because each fiber usually carries even more connections. Therefore, it is necessary to study the new lightpath protection algorithm in elastic optical networks. Since p-cycle protection scheme has short restoration time and simple protection switching procedure, in this paper, we study the static Survivable p-Cycle Routing and Spectrum Allocation (SC-RSA) problem with providing an Integer Linear Programming (ILP) formulation. Since RSA is a NP-hard problem, we propose a new heuristic algorithm called Elastic p-Cycle Protection (ECP) to tolerate the single-fiber link failure. For each demand, ECP scheme can compute highly-efficient p-cycles to provide protection for all of the on-cycle links and the straddling links. We also consider the load balancing and choose the proper working path for each demand. Simulation results show that the proposed ECP scheme achieves better performances than traditional single-line-rate survivable schemes.     

A Heuristic Algorithm for P-Cycles Configuration in WDM Optical Networks

Aiming at minimizing spare capacity for optical WDM networks, we propose a new heuristic algorithm for preconfigured protection cycle (p-cycle) design. Numerical results show that the spare capacity obtained by our new algorithm is very close to the optimal solution.     

Survivable WDM-PON with self-protection and in-service fault localization capabilities

In this paper, we analyze the survivability of wavelength division multiplexed (WDM) passive optical network (PON). We propose and experimentally demonstrate a novel survivable WDM-PON architecture with self-protection and in-service fault localization capabilities. Two WDM-PONs are combined together and multiple sub-ring architecture is formed. Protection switching is achieved automatically at optical network units (ONUs) when failure occurs. Fiber loss, fiber fault localization and automatic protection switching in each ONU are real-time monitored in central office (CO) without interrupting customer service. No signaling for failure notice or protection switching is required for either CO or ONUs. Extra fibers required for protection are minimized compared with previous protection schemes. The self-protection and in-service fault localization capabilities of the proposed WDM-PON architecture are experimentally verified.     

飞控系统的光传网络的可靠性及实时性

调研了传统光传(FBL)网络的几种拓扑结构, 就可靠性和实时性两方面对它们进行了分析和比较。选择采用一个包含256个节点的mesh光交换网络, 它具有冗余拓扑结构能承受3处链路故障, 保证了网络的可靠性。以网络中发生链路故障的数目, 及多个故障同时发生时故障的邻近程度来衡量网络故障的严重性。对所有链路故障情形进行仿真, 测试端到端的通信延迟。仿真结果表明, 采用这种网络拓扑结构的光传网络, 即使在发生较为严重的故障的情况下, 端到端通信路由的跳数增加不大, 仍能满足实时通信的要求。     

A new multi-granularity traffic grooming routing algorithm in IP over WDM networks

In IP over WDM networks, since there is a large bandwidth gap between a wavelength capacity and the actual bandwidth required by each user, it is necessary to multiplex low-rate traffic streams (LRSs) into lightpaths by traffic grooming. However, with the number of wavelengths increases, a large number of all optical (OOO) transmitting ports are consumed. Meanwhile, the multi-hop grooming with incorporating full-wavelength conversion capacity in each node requires too many optical-electrical-optical (OEO) ports inevitably. To solve theses problems, waveband switching and intra-band wavelength conversion are proposed. By integrating traffic grooming and waveband switching, this paper devises a new multi-granularity traffic grooming mechanism with the function of intra-band wavelength conversion. Based on the proposed mechanism and integrated grooming policy (IGP), a new heuristic routing algorithm called multi-granularity traffic grooming based on integrated auxiliary graph (MGIAG) is also proposed since the traffic grooming problem is NP-hard. Simulation results show that, compared to traditional integrated grooming algorithm (IGA), MGIAG can save more ports and obtain lower blocking probability. Compared to traditional single-hop traffic grooming algorithm (SHA), lower blocking probability and more savings in transmitting ports can be achieved by multi-hop grooming in MGIAG and IGA although they consume more OEO ports.     

The cost benefits of multi-layer architecture with multi-granularity switching in optical networks

The benefits of using multi-granularity switching to reduce the number of ports, including both electronic and optical ports, have been investigated. A novel multi-layer ring architecture with multiple switches is proposed and two general equations to count the number of ports are derived. Comparisons are made between the multi-layer multi-granularity switching (MM-XC) architecture and the reported architectures: multi-switching (M-XC) and single switching (S-XC) architectures. The results show that the M-XC or S-XC architectures can be deduced from the MM-XC architecture and the latter architecture can achieve more considerable savings of the port count compared to the former.     

适用于多粒度光网络的共享保护算法及其分析

结合多粒度光网络自身特点提出了两种适用于多粒度光网络中的共享保护算法,它们分别基于波带粒度和基于波长粒度对光层连接提供保护.仿真结果显示,提出的算法性能优于以往的专用保护算法,通过对仿真结果的分析,得出了网络参量变化对各个算法的影响.     

Transparent Two-Fiber Optical Channel Shared Protection Ring

A two-fiber optical channel shared protection ring including node architecture, signaling protocol, control hardware, and software is designed and implemented experimentally. For a ring with four nodes and two wavelengths, a total protection switching time of 6.8 ms is demonstrated along with a revert-to-working switching time of 1.6 ms. Experimental results show that the switching time scales linearly with number of nodes and number of wavelengths. The system can protect a ring with 16 nodes, 1200 km circumference, and 40 wavelengths in less than 50 ms.     

Transparent Two-Fiber Optical Channel Shared Protection Ring

A two-fiber optical channel shared protection ring including node architecture, signaling protocol, control hardware, and software is designed and implemented experimentally. For a ring with four nodes and two wavelengths, a total protection switching time of 6.8 ms is demonstrated along with a revert-to-working switching time of 1.6 ms. Experimental results show that the switching time scales linearly with number of nodes and number of wavelengths. The system can protect a ring with 16 nodes, 1200 km circumference, and 40 wavelengths in less than 50 ms.