Design of a GMPLS control plane with PCE-based impairment-aware full restoration capability for translucent WSON: Enabling techniques,service demonstration,and performance evaluation

The control plane techniques based on the Generalized Multi-Protocol Label Switching (GMPLS) and Path Computation Element (PCE) architectures are promising candidates for potential industrial deployment in Wavelength Switched Optical Networks (WSON), because they can greatly reduce operational expenses and improve the network intelligence. Moreover, link failures have a critical effect on WSON, since a single failure may result in the loss of a huge amount of data. In light of this, in this paper, we detail the design and implementation of a GMPLS control plane, with PCE-based, impairment-aware, full restoration capability for translucent WSON. We investigate the enabling techniques for such a PCE/GMPLS control plane by surveying a series of solutions, and, based on these enabling techniques, we present an experimental demonstration of service recovery for uncompressed video stream in a GMPLS controlled WSON with PCE-based full lightpath restoration. We also quantitatively evaluate the performance of the PCE-based full restoration, and compare it with the PCE-based pre-planned restoration and the PCE-based pre-computed dynamic restoration in terms of signaling latency and restorability. To the best of our knowledge, it is the first time that the PCE-based full restoration is experimentally investigated on an actual GMPLS controlled WSON testbed, which is beneficial for verifying the overall feasibility and efficiency of the proposed solutions, obtaining valuable insights for its future deployment in a real operational scenario, and providing active contribution in support of the on-going Internet Engineering Task Force (IETF) standardization activities.     

Integrity of public telecommunications networks

Provides an overview of the special issue of the IEEE Journal of Communications, Volume 12, Number 1 (January 1994) which addresses open questions in network integrity, reliability and survivability. Current progress in this area is discussed. The questions addressed include user survivability perspectives on standards, planning, and deployment; the analysis and quantification of network disasters; survivable and fault-tolerant network architectures and associated economic analyses; and techniques to handle network restoration as a result of physical damage or failures in software and control systems. Special interests are devoted to the survivability of broadband networks employing the new transport/switching techniques based on the synchronous optical network (SONET) and asynchronous transfer mode (ATM) standards due to their emerging role in future B-ISDN. Network integrity due to failures of common channel signaling (CCS) systems is also very critical. The present special issue includes 22 papers and is organized into the following sections: user perspectives and planning, software quality and reliability, network survivability characterization and standards, network restoration for SONET networks, network restoration for ATM networks, traffic effect and performance enhancement for computer networks, and survivable network design methods. Network restoration methods for SONET, ATM, and computer networks correspond to those for the physical layer (SONET), ATM layer, and the network layer, defined in the CCITT broadband ISDN layer structure     

Evolving Greenfield Passive Optical Networks

We investigate applying an evolutionary algorithm (EA) to the design of a passive optical network (PON). We use three techniques to improve the performance. Firstly, to reduce the risk of sub-optimal convergence, we use a novel genetic encoding. Secondly, we combine the EA with a heuristic to guide the optimisation. Thirdly, we investigate various ways of sub-dividing the problem. We briefly present experiments to demonstrate how the EA performs. The results show the strengths and weaknesses of the various techniques we employ. This revised version was published online in July 2006 with corrections to the Cover Date.     

Efficient distributed restoration path selection for shared mesh restoration

In MPLS/GMPLS networks, a range of restoration schemes will be required to support different tradeoffs between service interruption time and network resource utilization. In light of these tradeoffs, path-based end-to-end shared mesh restoration provides a very attractive solution. However, efficient use of bandwidth for shared mesh restoration strongly relies on the procedure for selecting restoration paths. We propose an efficient restoration path selection algorithm for restorable connections over shared bandwidth in a fully distributed MPLS/GMPLS architecture. We also describe how to extend MPLS/GMPLS signaling protocols to collect the necessary information efficiently. To evaluate the algorithm's performance, we compare it via simulation with two other well-known algorithms on a typical intercity backbone network. The key figure of merit for restoration bandwidth efficiency is restoration overbuild, i.e., the extra bandwidth required to meet the network restoration objective as a percentage of the bandwidth of the network with no restoration. Our simulation results show that our algorithm uses significantly less restoration overbuild (63%-68%) compared with the other two algorithms (83%-90%).     

Providing quality-of-protection classes through control-message scheduling in DWDM mesh networks with capacity sharing

This paper considers the problem of providing quality-of-protection (QoP) classes and improving the failure-recovery time performance in dense wavelength-division-multiplexing (DWDM) networks that use mesh-based path restoration schemes with capacity sharing. We focus on the signaling process required for reconfiguring the nodes along the preplanned restoration paths, and propose a novel approach for reducing the restoration time and meeting the QoP requirements by coordinating the setup procedures for the backup paths through scheduling. We present priority-based online scheduling algorithms that are amenable to distributed implementation for the problems of: 1) minimizing the worst case restoration time and 2) maximizing the number of connections that meet their QoP-class-specific restoration time deadlines. We also present mixed-integer-linear-program (MILP) formulations for both problems for comparison purposes. The online scheduling methods that we propose use simple connection and/or class-specific information and can be easily implemented with minor modifications to the currently proposed signaling protocols. We apply these methods to signaling protocols that require cross-connect configurations at different nodes to be done in sequence as in the current generalized multiprotocol label switching specification, as well as signaling protocols that allow cross-connect configurations to be done in parallel. It is shown that in both cases, significant performance improvements are achievable through scheduling in terms of both the QoP grades that can be supported and the restoration times, with both the MILP solutions and the heuristics. The improvement in restoration time and restorability through our heuristics can be quite high (e.g., increase from a network restorability performance of 40% to a network restorability of 88%, and a 12% reduction in worst case restoration time).     

Survivability in the Optical Internet Using the Optical Burst Switch

Due to its salient features, the optical burst switch is becoming a key technology for the optical Internet. Within this technology, the survivability issue in the optical Internet has to be addressed because a simple failure causes severe damage to the huge amount of data carried in optical fiber. In this paper, we introduce a restoration procedure that can provide good survivability in the optical burst switch (OBS)‐based optical Internet. OBS restoration can survive various types of network failure while maintaining good network performance. We propose novel restoration mechanisms, namely, “temporary Label Switched Path (LSP)” and “bossy LSP,” to enhance restoration time and network utilization. The simulation results verify that the proposed OBS restoration achieves good network performance and provides good network connectivity as well.     

RBFN restoration of nonlinearly degraded images

We investigate a technique for image restoration using nonlinear networks based on radial basis functions. The technique is also based on the concept of training or learning by examples. When trained properly, these networks are used as spatially invariant feedforward nonlinear filters that can perform restoration of images degraded by nonlinear degradation mechanisms. We examine a number of network structures including the Gaussian radial basis function network (RBFN) and some extensions of it, as well as a number of training algorithms including the stochastic gradient (SG) algorithm that we have proposed earlier. We also propose a modified structure based on the Gaussian-mixture model and a learning algorithm for the modified network. Experimental results indicate that the radial basis function network and its extensions can be very useful in restoring images degraded by nonlinear distortion and noise.     

Improved linear crosstalk tolerance in an un-amplified ring PON

There is increased interest in ring-based passive optical network (PON) architectures due to their local area network (LAN) capability among end users and inherent protection and restoration schemes. The ring architecture includes optical filters and switches with non-ideal channel isolation, leading to the generation of linear crosstalk, which can significantly degrade the system performance if it is not sufficiently suppressed. We use simulation to analyze the effects of linear crosstalk in an un-amplified TDM optical ring and show how we can improve the tolerance of the crosstalk in our architecture that employs optimized tap split ratios as a means of increasing the number of ONUs served. Our approach is based on simulation of the entire network using a combination of wavelength-domain and time-domain techniques. Typically, PON networks use two or three wavelengths that are separated by more than 50 nm to maintain the cost of components low and as such, it is logical that any crosstalk will be negligible. However, the subpar performance of such components motivated our study into the impact of crosstalk. We show that the tap ratio optimization which increases the number ONUs that can be served in the ring can also exacerbate the effects of linear interchannel crosstalk at the ONU’s downstream signal receivers. We also show that surplus power at the last ONU can be utilized to counter this degraded crosstalk performance by careful tap ratio selection, thereby improving the overall tolerance to linear crosstalk in the system.     

Guaranteed Performance Routing of Unpredictable Traffic With Fast Path Restoration

Two-phase routing, where traffic is first distributed to intermediate nodes before being routed to the final destination, has been recently proposed for handling widely fluctuating traffic without the need to adapt network routing to changing traffic. Preconfiguring the network in a traffic-independent manner using two-phase routing simplifies network operation considerably. In this paper, we extend this routing scheme by providing resiliency against link failures through fast path restoration along disjoint end-to-end backup paths. We view this as important progress toward adding carrier-class reliability to the robustness of the scheme so as to facilitate its future deployment in Internet service provider (ISP) networks. On the theoretical side, the main contribution of the paper is the development of linear-programming-based and fast combinatorial algorithms for two-phase routing with fast path restoration so as to minimize the maximum utilization of any link in the network, or equivalently, maximize the throughput. The algorithms developed are fully polynomial time approximation schemes (FPTAS)-for any given epsiv > 0, an FPTAS guarantees a solution that is within a (1+epsiv)-factor of the optimum and runs in time polynomial in the input size and [ 1/(relax epsiv)]. To the best of our knowledge, this is the first work in the literature that considers making the scheme resilient to link failures through preprovisioned fast restoration mechanisms. We evaluate the performance of fast path restoration (in terms of throughput) and compare it to that of unprotected routing. For our experiments, we use actual ISP network topologies collected for the Rocketfuel project and three research network topologies.     

Locally Restorable Routing of Highly Variable Traffic

Two-phase routing, where traffic is first distributed to intermediate nodes before being routed to the final destination, has been recently proposed for handling widely fluctuating traffic without the need to adapt network routing to changing traffic. Preconfiguring the network in a traffic independent manner using two-phase routing simplifies network operation considerably. In this paper, we extend this routing scheme by providing resiliency against link failures through fast restoration along link backup detours. We view this as important progress towards adding carrier-class reliability to the robustness of the scheme so as to facilitate its future deployment in Internet Service Provider (ISP) networks. On the theoretical side, the main contribution of the paper is the development of linear programming based and fast combinatorial algorithms for two-phase routing with link restoration so as to minimize the maximum utilization of any link in the network, or equivalently, maximize the throughput. The algorithms developed are fully polynomial time approximation schemes (FPTAS)-for any given isin > 0, an FPTAS guarantees a solution that is within a (1 + isin)-factor of the optimum and runs in time polynomial in the input size and 1/isin. To the best of our knowledge, this is the first work in the literature that considers making the scheme resilient to link failures through preprovisioned fast restoration mechanisms. We evaluate the performance of link restoration (in terms of throughput) and compare it with that of unprotected routing. For our experiments, we use actual ISP network topologies collected for the Rocketfuel project and three research network topologies.     

Fault recovery for guaranteed performance communicationsconnections

Fault recovery techniques must be reexamined in the light of the new guaranteed performance services that high-speed packet/cell switched networks will support. We investigate the rerouting of guaranteed performance service connections on the occurrence of link faults, focusing on the aspects of route selection and establishment in the network. We model the rerouting mechanism in terms of three orthogonal components: locus of reroute, reroute timing, and retry model, and explore the effect of variations in each component on the recovery process, in the presence of single- and multiple-link faults in the network. Our schemes are simulated on a cross section of network workloads, and compared using several performance criteria quantifying speed and efficacy. Our results show that global (or end-to-end) rerouting performs well as a locus of reroute selection mechanism, and that randomization is a powerful technique to determine reroute timing. We find that retrying along a new path is less effective than rerouting at a different time, and use this result to develop a new delayed retry technique. Randomization in the retry mechanism obviates the need for randomization in the initial reroute timing, so global rerouting with immediate timing and randomized retries performs well for all our performance criteria in a spectrum of network topologies and workloads for both single and multiple failures. We observe that this combination moves most of the complexity of rerouting to the edge of the network, leading to a very lightweight recovery model     

Mesh network resiliency using GMPLS

The generalized multiprotocol label switching (GMPLS) is being developed as the control plane for the evolving photonic network. We describe how GMPLS can be used with mesh networks to provide efficient network resiliency. In particular we examine the key aspects of GMPLS that are used to support protection and restoration. We also study the various protection and restoration techniques, and we highlight the tradeoffs between recovery time and resource redundancy     

Models of Restoration Probability in WDM Networks Employing Active Restoration

The ever-increasing demand for network bandwidth makes network survivability an issue of great concern. Lightpath restoration is a valuable approach to guaranteeing an acceptable level of survivability in WDM optical networks with better resource utilization than that of its protection counterpart. Active restoration (AR) is a newly proposed lightpath restoration scheme [M. Mostafa et al. OSA Journal of Optical Networking, vol. 3, no. 4, pp. 247–260] that combines the best of protection and reactive restoration while avoiding their shortcomings. In this paper, we conduct detailed performance analysis on the restoration probability of AR-based WDM networks. In particular, analytical models of restoration probability are developed respectively for networks with full-wavelength conversion capability and for networks without wavelength conversion capability under different backup path searching schemes. Based on the new models, we investigate the effects of wavelength availability, wavelength conversion capability, path length as well as backup path seeking methods on the restoration probability.     

Self-healing ATM networks based on virtual path concept

This paper proposes self-healing network techniques suitable for ATM networks in order to realize a high-reliablity B-ISDN. First, the characteristics of the virtual paths (VP) and their influence on failure restoration are discussed. A high-speed restoration technique which exploits the benefits of the VP is then proposed and described. The technique simplifies the message transmission processes and reduces the number of generated messages by using preassigned backup virtual paths. Next, the scheme used to design the backup VP routes and spare resource distribution for each link is proposed in order to create a network that applies the proposed restoration scheme. Next, self-reconstruction techniques of backup virtual paths are proposed for the realization of a reversionless restoration cycle. Finally, the feasibility of the distributed control operation is discussed     

End-to-end survivable broadband networks

Within the EC-sponsored RACE program, the IMMUNE project was established to analyze and specify appropriate strategies for introducing end-to-end survivability into corporate and public broadband networks to support these strategies by proper techniques and evaluation tools, and to demonstrate distributed restoration on PSN (public switched networks) and CPN (customer premises networks) laboratory models. The first objective was to define a set of survivability requirements and metrics to be used in the rest of the project. This has led to the identification of a range of survivability strategy options ann how they can be mapped onto user, service provider and operator requirements. The next step on the road to integral survivability is designing and planning survivable networks, and the evaluation of the restoration and protection mechanisms that will be applied in these networks. An overview is given of this part of the project. Most protection and restoration mechanisms operate within a single network layer and network part, autonomous from network management. The interaction of mechanisms in different network layers or in different network parts, and the role of network management, are discussed. For the demonstration lab models, two techniques have been selected for implementation: a distributed restoration mechanism for a meshed ATM PSN, and a CPN ATM ring protection switching mechanism. These techniques are described and an overview is given of the ongoing activities within the IMMUNE project, with a summary of the status of the demo models     

On combining network coding with duty-cycling in flood-based wireless sensor networks

Network coding and duty-cycling are two major techniques for saving energy in wireless sensor networks. To the best of our knowledge, the idea to combine these two techniques for even more aggressive energy savings, has not been explored. This is not unusual, since these two techniques achieve energy efficiency through conflicting means, e.g., network coding saves energy by exploiting overhearing (i.e., nodes are awake), whereas duty-cycling saves energy by reducing idle listening (i.e., nodes sleep). In this article, we thoroughly investigate if network coding and duty cycling can be used together for more aggressive energy savings in flood-based wireless sensor networks.Our main idea is to exploit the redundancy sometimes present in flooding applications that use network coding, and put a node to sleep (i.e., duty cycle) when a redundant transmission takes place (i.e., the node has already received and successfully decoded a sequence of network-coded packets). We propose a scheme, called DutyCode, in which a multiple access control (MAC) protocol implements packet streaming and allows the network coding-aware application to decide when a node can sleep. We also present an algorithm for deciding the optimal coding scheme for a node to further reduce energy consumption by minimizing redundant packet transmissions. Finally, we propose an adaptive switching technique between DutyCode and an existing duty-cycling MAC protocol. We investigate our proposed solutions analytically and implement them on mote hardware. Our performance evaluation results, obtained from a 42-node indoor testbed, show that our scheme saves 30–46% more energy than network coding-based solutions.     

Carrier-grade ethernet:etherpath protection vs. ethertunnel protection

Ethernet is a success story in local area networks. Efforts to extend its boundaries beyond LAN to the carriers' backbone networks are in progress. We study the problem of designing reliable and cost-efficient high-rate (100 Gb/s) carrier-grade Ethernet. Reliability is considered for application at one of two levels: Etherpath protection (where an Etherpath is a lightpath established by Ethernet interfaces) or Ethertunnel protection (where an Ethertunnel is an Ethernet connection). We develop the protection algorithms for the two cases, and study the trade-offs in their impact on network cost and implementation complexity. We consider practical settings for the envisioned next-generation carrier-grade Ethernet networks with the following characteristics: high-rate (up to 100 Gb/s) Etherpaths constrained by the signal's maximum all-optical transmission range before which 3R signal regeneration is required, and an Ethernet network with mixed line rates. Our algorithms, tested on a 17-node German study network, lead to the following findings: ETP is more resource-efficient than EPP, but EPP incurs less implementation complexity than ETP.     

On the eNB‐based energy‐saving cooperation techniques for LTE access networks

Energy efficiency is one of the top priorities for future cellular networks, which could be accomplished by implementing cooperative mechanisms. In this paper, we propose three evolved node B (eNB)‐centric energy‐saving cooperation techniques for long‐term evolution (LTE) systems. These techniques, named as intra‐network, inter‐network, and joint cooperation, involve traffic‐aware intelligent cooperation among eNBs belonging to the same or different networks. Our proposed techniques dynamically reconfigure LTE access networks in real time utilizing less number of active eNBs and thus, achieve energy savings. In addition, these techniques are distributed and self‐organizing in nature. Analytical models for evaluating switching dynamics of eNBs under these cooperation mechanisms are also formulated. We thoroughly investigate the proposed system under different numbers of cooperating networks, traffic scenarios, eNB power profiles, and their switching thresholds. Optimal energy savings while maintaining quality of service is also evaluated. Results indicate a significant reduction in network energy consumption. System performance in terms of network capacity utilization, switching statistics, additional transmit power, and eNB sleeping patterns is also investigated. Finally, a comprehensive comparison with other works is provided for further validation. Copyright © 2013 John Wiley & Sons, Ltd.     

基于神经网络和维纳滤波的半盲离焦图像复原

本文提出了一种基于小波神经网络和维纳(Wiener)滤波的半盲离焦图像复原算法,首先提取训练图像的小波域特点参数向量,将该参数用来训练小波神经网络,利用训练好的网络估计图像离焦模糊参数.由离焦模糊参数获得点扩展函数,然后用Wiener滤波完成图像的复原.实验结果表明:该方法能有效地估计离焦模糊参数和复原模糊图像.     

Performance comparisons of restoration techniques in optical burst switching networks

This paper describes restoration techniques for OBS networks. First, we introduce the design issues to be essentially considered, when restoration techniques will be built into OBS networks. Second, considering the design issues, we propose a novel restoration model named “Recover-Then-Reserve,” which can enhance the restoration performance. Third, we develop a simulator using the NS-2 platform to verify the performance of the restoration techniques (path, link, and sub-path) designed by each restoration model (GMPLS-based OBS restoration and our proposal). Performance is evaluated on the following metrics: restoration success rate, restoration time, connection availability, and burst loss probability. The effects of the failure frequency and the number of the restoration attempts on the restoration performance are also investigated. Our experiments show that the proposal can reduce the restoration time by about 25 ms compared to the GMPLS-based OBS restoration model. Also, path restoration technique has better performance than link and sub-path restoration techniques because it has the highest restoration success rate, allowing similar restoration time. Our experiments also show that the more the restoration attempts made and the less the failure frequency becomes, the better the restoration performance obtained.