Shared p-cycles design for dual link failure restorability in optical WDM networks

Pre-configured cycles (p-cycles) can attain high capacity efficiency and fast protection switching times in wavelength division multiplexing (WDM) networks.This article proposes the weighted straddling link algorithm (WSLA) for generating a subset of all cycles that can guarantee 100% restorability in case of dual link failure, and give an integer linear programming (ILP) formulation that solves the shared p-cycles design problem minimizing the total spare capacities.Numerical result shows that our method can achieve 100% dual link failure restorability with acceptable spare capacity.The larger standard deviation of demand set and the larger node degree network, the better the shared p-cycles scheme performs.     

Virtual topology transition sequence problem in WDM networks with FIPP p-cycles protection

In this article, for the given wavelength division multiplexing (WDM) network, the demand traffic matrix, the old and new survivable virtual topologies which are protected by the failure-independent path-protecting p-cycles (FIPP p-cycles) protection scheme, the virtual topology transition sequence (VTTS) problem is studied. The goal of this problem is to find an optimal sequence to transfer the old virtual topology into new one, and during the transiting process, the services are not disrupted. Moreover, each lightpath in the virtual topology is protected by the FIPP p-cycle and can survive against a single-link failure. In this article, a heuristic algorithm and a genetic algorithm are proposed to solve this problem. Simulations are also performed to evaluate the performance of proposed algorithms.     

A study of the backup reprovisioning problem for FIPP p-cycles on WDM networks

As networks grow in size and complexity, both the probability and the impact of failures increase. The pre-allocated backup bandwidth cannot provide 100% protection guarantee when multiple failures occur in a network. In this article, we focus on how to recover the protecting capabilities of FIPP (Failure-independent path-protecting) p-cycles against the subsequent links failure on WDM networks, after recovering the working paths affected by the failure of link. Two recovering policies are designed to recover the protecting capabilities of the FIPP p-cycles if possible, unless there is no sufficient network resource. They are Cycle Recovery Policy and Path Recovery Policy. In addition, a Cycle Adjust algorithm is proposed and used to recover the affected cycles. The simulation results of the proposed methods are also given.     

The backup reprovisioning problem of FIPP p-cycles for node failure on survivable WDM networks

Protection techniques for optical networks mainly rely on pre-allocated backup bandwidth, which may not be able to provide full protection guarantee when multiple failures occur in a network. After recovering from the previous failure, if failure occurs again, unprotected or vulnerable lightpaths cannot be recovered. In this paper, the minimal backup reprovisioning (MBR) problem is studied, in which the failure-independent path protecting p-cycles (FIPP p-cycles) scheme is considered for single-node failure on WDM networks. After recovering the affected lightpaths from a node failure, the goal of the MBR is to re-arrange the protecting and available resources such that working paths can be protected against next node failure if possible. An algorithm is designed to recover the protecting capabilities of the FIPP p-cycles, unless there is no sufficient network resource. The simulation results of the proposed method are also given.     

Genetic algorithm based dynamic combination of polyhedron structures against multiple link failures

Polyhedron protection realizes link protection by constructing a pre-assigned structure and allocates backup resources on a fixed polyhedron structure based on the maximum number of working resources. Taking into account both protection success rate and resource redundancy, this paper dynamically combines different polyhedron structures to allocate backup resources according to the link load, and proposes a genetic algorithm based dynamic combination of polyhedron structures (GA-DCPS) to reduce the resource consumption in the network while ensuring the protection success rate. GA-DCPS aims to minimize the consumption of wavelength resources, and uses the genetic strategy to find the polyhedron combination with the least redundancy to allocate backup resources while ensuring the success rate of service protection. Compared to using the fixed polyhedron structure with 1:m backup resource allocation, GA-DCPS can reduce resource redundancy by about 15% while ensuring complete protection against double-link failures.     

非割边链路故障对网络流量的影响分析

在骨干网络中,几乎每天都会发生链路故障,链路故障会导致流量损失或转移.应用概率论方法给出了流量损失时间及转移时间与相应的协议配置及非割边链路故障特性的量化关系.研究结果可用来指导协议配置以减少故障对流量的影响.     

Network restoration under dual failures using path-protecting preconfigured cycles

This paper presents a design algorithm for networks with a restoration mechanism that provides end-to-end path protection to a set of demands with specified working routes, where demands must survive one or two failures in optical networks and these failures may occur almost instantaneously. Each of the demands protected from two failures is assigned two restoration routes and restoration wavelengths on a cycle. A demand protected from a single failure is assigned one restoration route and restoration wavelengths on a cycle. These assignments are preconfigured so that switching and wavelength conversions are not needed at intermediate nodes of restoration routes. Splitting of demand across multiple restoration routes upon a failure occurrence is not allowed. The algorithm generates a large number of candidate Path-Protecting Preconfigured Cycles (PP-PCs). A candidate cycle may provide protection to a mix of demands requiring different protection levels, where demands may share under certain conditions restoration wavelengths even if they are exposed to common failure scenarios and have overlapping restoration routes. A near-optimal set of preconfigured cycles is selected from among all candidates, attempting to minimize the total cost of restoration wavelengths while ensuring that each demand is assigned to a single preconfigured cycle. This is achieved by solving a set covering problem followed by deleting duplicate demand assignments and by resolving wavelength assignment conflicts.     

Robust dual watermarking algorithm for AVS video

In this paper, we propose a robust dual watermarking algorithm for video based on the audio video coding standard (AVS). One watermark is embedded in luminance components, whose embedding positions are optimized using the particle swarm optimization (PSO) technique, resisting common signal processing operations such as median filtering, adding noises, cropping and so on. To combat geometric and re-encoding attacks, the other watermark is embedded in chrominance components by adjusting the energy relationship between Cb and Cr components based on the just noticeable distortion (JND) concept of the human vision system (HVS). Both of them are implemented in the compressed domain by modifying the quantized coefficients, combined together to satisfy the requirements of robustness and imperceptibility. Only entropy decoding is required to detect the watermark, and thus the watermark detection process has low computational complexity. Extensive experimental results show that the high robustness and good quality of watermarked AVS video can be achieved simultaneously.     

一种基于P圈的单链路故障启发式算法研究

文章针对传统P圈保护算法计算时间长、资源利用率低的缺点,提出一种新的启发式算法,该算法以冗余度为评价标准,结合了未保护链路比率,在未保护链路数少的情况下能有效地约束P圈的扩张,只需一步就能计算出高效的P圈并100%保护光网络.通过在泛欧COST239网络和新泽西州LATA网络上仿真,表明该算法可以有效地减少配置P圈的数量,减少计算时间,提高网络的资源利用率.     

Reliable guaranteed variance filtering against sensor failures

This paper presents a solution to a reliable filtering problem with error variance specifications for both continuous- and discrete-time systems. The filtering error variance in the sensor failure cases is guaranteed to be less than a given upper bound while the performance in the nominal case is optimized. A convergent iterative algorithm based on linear matrix inequality (LMI) is given to obtain the solution. The algorithm solves the problem without introducing additional conservativeness, and it is shown to get better performance and be less conservative compared with traditional LMI approaches. A numerical example is given to show the advantages of our approach over existing techniques.     

Availability analysis under multiple link failures in WDM networks with shared-link connections

In optical Wavelength Division Multiplexing (WDM) networks, different protection schemes have been proposed in the literature, namely, dedicated protection and shared protection. Shared protection techniques significantly reduce the required spare capacity by providing the same level of availability as dedicated protection. However, current mission critical applications (which heavily depend on the availability of communication resources) require connection availability in the order of 99.999% or higher, which corresponds to a downtime of almost 5 min a year on the average. Therefore, in order to satisfy a connection serviceavailability requirement defined by the users Service Level Agreement in a cost-effective and resource-efficient way, network operators need a systematic mechanism to evaluate the network availability under multiple failure scenario to ensure that current network configuration can meet the required availability degree; otherwise, a network upgrade is required. Unfortunately, under multiple failure scenario, traditional availability analysis techniques based on reliability block diagrams are not suitable for survivable networks with shared spare capacity. Therefore, a new concept is proposed to facilitate the calculations of network availability. In this paper, we propose an analytical model for evaluating the availability of a WDM network with shared-link connections under multiple link failures. The analytical model is also verified using Monte Carlo simulation. The proposed model significantly contributes to the related areas by providing network operators with a quantitative tool to evaluate the system availability and, thus, the expected survivability degree of WDM optical networks with shared connections under multiple link failures.     

一种静态P_Cycle双链路故障保护算法

首先分析了采用P_Cycle(P圈)为网络提供保护时会遇到的双链路故障发生情形,然后分析了在至少3边连通度格状网络中采用P圈偶对实现双链路故障保护的策略.提出了一种最优P圈偶对选取法则:最小等效长度和原则及一种圈共享方案,并在此基础上提出了一种采用P圈偶对实现双链路故障保护的启发式算法.最后,在COST239网络拓扑进行了仿真,仿真的结果验证了算法的有效性和可行性.     

An analysis of the congestion effects of link failures in wide areanetworks

The authors present the results of a study to determine the effects of link failures on the performance of a network in terms of the occurrence of congestion due to traffic restoration after a failure. The network studied is a virtual circuit based packet switched wide area network. A generic queueing framework is developed to study the effect of failures and the subsequent traffic restoration on network performance. In general, the congestion resulting after a failure is a transient phenomenon. Hence, a numerical methods based nonstationary queueing analysis is conducted in order to quantify the effects of failures in terms of the transient behavior of queue lengths and packet loss probabilities. A bounding relationship is developed whereby a network node can determine whether or not congestion will occur as the result of traffic restoration after a failure     

Contribution to future metropolitan access network planning considering link failures in photonic switched networks

Photonic switching for traffic optimization in Metropolitan Access Optical Networks using technologies of optical packet/burst switching (OPS/OBS) seems to be a future-proof solution considering high capacity and the highly variable traffic in these networks. Looking for this future, we propose a study based on the analyze of survivability of traffic unconsidering protection mechanism but considering mesh and ring efficient topologies with node architecture to OPS. The results are obtained through computer modeling and simulation. The main parameters analyzed are as follows: capacity, average number of hops, packet loss fraction, and link utilization for each topology. These parameters are adopted to evaluate the performance of each topology considering failures. Minimum electronic buffering is included at node ingress (client side) to avoid packet loss in the access to the optical layer: high throughput and low latency. It is also observed that optical buffering is not necessary for adequate network performance.     

基于QR分解的强鲁棒性双彩色盲水印算法

提出了一种将彩色快速识别(QR)码作为水印嵌入彩色宿主图像的强鲁棒性盲水印算法。首先 对彩色宿主图像分通道进行离散小波 变换(DWT)和分块QR分解得到非重叠的酉矩阵,然后将QR码分通道置乱加密归一化后嵌入到 宿主图像对应通道 酉矩阵的系数差中。仿真实验结果表明,本算法在满足不可见性的同时具有较强的鲁棒性; 相比现有算法, 本算法不仅能够抵抗旋转和裁切攻击,在JPEG压缩和噪声滤波攻击方面的抵抗能力也有较 大提升;而且本算法属于盲水印技术,具有较大的实际应用价值。     

Network coding based on hyper‐edge decomposition for wireless network with link failures

This paper is concerned with the construction of network coding for wireless network with link failures. Based on hyper‐edge decomposition, for the wireless network, we first construct the hyper‐edge graph, where each node represents one hyper‐edge (consisting of multiple adjacent edges transmitting the same information) of the wireless network. Then we present a heuristic coloration method for the hyper‐edge graph, and a network coding vector allocation scheme based on maximum distance separable code is proposed to effectively overcome some link failures. Copyright © 2014 John Wiley & Sons, Ltd.     

基于DVI双链路的超大分辨率亮度校正系统设计

具备亮度校正功能的DVI-DVI处理器被应用到LED大屏幕显示,可以较好的解决工程上为了增加或升级亮度校正功能而更换显示控制系统的问题.但是DVI-DVI处理器的动态内存读取频率较低,不能发挥DVI双链路的数据传输性能.本文通过对动态内存中待读取的校正参量按照特定算法进行重组和压缩,将动态内存的等效读取频率从266MHz提高到330MHz,实现DVI双链路传输对超大分辨率的LED显示屏进行有效的亮度校正.     

An autonomous recovery mechanism against optical distribution network failures in EPON

Ethernet Passive Optical Network (EPON) is chosen for servicing diverse applications with higher bandwidth and Quality-of-Service (QoS), starting from Fiber-To-The-Home (FTTH), FTTB (business/building) and FTTO (office). Typically, a single OLT can provide services to both residential and business customers on the same Optical Line Terminal (OLT) port; thus, any failures in the system will cause a great loss for both network operators and customers. Network operators are looking for low-cost and high service availability mechanisms that focus on the failures that occur within the drop fiber section because the majority of faults are in this particular section. Therefore, in this paper, we propose an autonomous recovery mechanism that provides protection and recovery against Drop Distribution Fiber (DDF) link faults or transceiver failure at the ONU(s) in EPON systems. In the proposed mechanism, the ONU can automatically detect any signal anomalies in the physical layer or transceiver failure, switching the working line to the protection line and sending the critical event alarm to OLT via its neighbor. Each ONU has a protection line, which is connected to the nearest neighbor ONU, and therefore, when failure occurs, the ONU can still transmit and receive data via the neighbor ONU. Lastly, the Fault Dynamic Bandwidth Allocation for recovery mechanism is presented. Simulation results show that our proposed autonomous recovery mechanism is able to maintain the overall QoS performance in terms of mean packet delay, system throughput, packet loss and EF jitter.     

A mixed connection recovery strategy for surviving dual link failure in WDM networks

As the size and complexity of a network increases, the probability of a dual link failure also increases. For recovering the dual link failures, two strategies have been presented in past. As per the first strategy, SPP-MAS (Shared Path Protection-Maximum Allowable Sharing), the sharing of backup lightpaths in SPP (Shared Path Protection) has been reduced, and in the second strategy TBPS (Two Backup Path Shared), the reservation of two backup lightpaths for each primary lightpath has been undertaken. The main flaw of these strategies is the requirement of redundant network resources towards the establishment of backup lightpaths, and the occurrence of trap problem after the second link fails. To minimize the redundant backup resources and the trap problem, a mixed connection recovery algorithm namely Adaptive Backup Routing over Reserved Resources (ABRRR) has been proposed. The design of ABRRR takes leverage of both, the pre-planned, and the post-failure connection recovery mechanisms. In ABRRR, the failed connections are re-provisioned adaptively over the pre-allocated backup network resources. Adaptive re-provisioning of the failed connection minimizes the trap problem. Using simulation experiments, we undertake a comparative study of the proposed strategy with the existing strategies (i.e. SPP-MAS and TBPS) under the network parameters of Blocking Probability, Dual Restorability, and Resource Utilization Ratio (RUR). Detailed investigations establish that the use of ABRRR leads to lower Blocking Probability, higher Dual Restorability, and minimized RUR compared to the existing strategies. Results also show that the proposed strategy not only survives more connections but also utilizes fewer numbers of resources compared to the existing strategies.