Survivable Lightpath Provisioning in WDM Mesh Networks Under Shared Path Protection and Signal Quality Constraints

This paper addresses the problem of survivable lightpath provisioning in wavelength-division-multiplexing (WDM) mesh networks, taking into consideration optical-layer protection and some realistic optical signal quality constraints. The investigated networks use sparsely placed optical–electrical–optical (O/E/O) modules for regeneration and wavelength conversion. Given a fixed network topology with a number of sparsely placed O/E/O modules and a set of connection requests, a pair of link-disjoint lightpaths is established for each connection. Due to physical impairments and wavelength continuity, both the working and protection lightpaths need to be regenerated at some intermediate nodes to overcome signal quality degradation and wavelength contention. In the present paper, resource-efficient provisioning solutions are achieved with the objective of maximizing resource sharing. The authors propose a resource-sharing scheme that supports three kinds of resource-sharing scenarios, including a conventional wavelength-link sharing scenario, which shares wavelength links between protection lightpaths, and two new scenarios, which share O/E/O modules between protection lightpaths and between working and protection lightpaths. An integer linear programming (ILP)-based solution approach is used to find optimal solutions. The authors also propose a local optimization heuristic approach and a tabu search heuristic approach to solve this problem for real-world, large mesh networks. Numerical results show that our solution approaches work well under a variety of network settings and achieves a high level of resource-sharing rates (over 60% for O/E/O modules and over 30% for wavelength links), which translate into great savings in network costs.

Survivable Traffic Grooming With Path Protection at the Connection Level in WDM Mesh Networks

Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength-division-multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated-protection and shared-protection schemes are considered. Given network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures, such as fiber cut and duct cut, we consider the general shared-risklink- group (SRLG) diverse routing constraints. We first resort to the integer-linear-programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA), and tabu-search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model, respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu-search (TS) method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.

A Load-Balancing Shared-Protection-Path Reconfiguration Approach in WDM Wavelength-Routed Networks

Wavelength-routed networks (WRN) are very promising candidates for next-generation Internet and telecommunication backbones. In such a network, optical-layer protection is of paramount importance due to the risk of losing large amounts of data under a failure. To protect the network against this risk, service providers usually provide a pair of risk-independent working and protection paths for each optical connection. However, the investment made for the optical-layer protection increases network cost. To reduce the capital expenditure, service providers need to efficiently utilize their network resources. Among all the existing approaches, shared-path protection has proven to be practical and cost-efficient [1]. In shared-path protection, several protection paths can share a wavelength on a fiber link if their working paths are risk-independent. In real-world networks, provisioning is usually implemented without the knowledge of future network resource utilization status. As the network changes with the addition and deletion of connections, the network utilization will become sub-optimal. Reconfiguration, which is referred to as the method of re-provisioning the existing connections, is an attractive solution to fill in the gap between the current network utilization and its optimal value [2]. In this paper, we propose a new shared-protection-path reconfiguration approach. Unlike some of previous reconfiguration approaches that alter the working paths, our approach only changes protection paths, and hence does not interfere with the ongoing services on the working paths, and is therefore risk-free. Previous studies have verified the benefits arising from the reconfiguration of existing connections [2] [3] [4]. Most of them are aimed at minimizing the total used wavelength-links or ports. However, this objective does not directly relate to cost saving because minimizing the total network resource consumption does not necessarily maximize the capability of accommodating future connections. As a result, service providers may still need to pay for early network upgrades. Alternatively, our proposed shared-protection-path reconfiguration approach is based on a load-balancing objective, which minimizes the network load distribution vector (LDV, see Section 2). This new objective is designed to postpone network upgrades, thus bringing extra cost savings to service providers. In other words, by using the new objective, service providers can establish as many connections as possible before network upgrades, resulting in increased revenue. We develop a heuristic load-balancing (LB) reconfiguration approach based on this new objective and compare its performance with an approach previously introduced in [2] and [4], whose objective is minimizing the total network resource consumption.

A Heuristic with Bounded Guarantee to Compute Diverse Paths under Shared Protection in WDM Mesh Networks

Establishing a fault-tolerant connection in a network involves computation of diverse working and protection paths. The Shared Risk Link Group (SRLG) [1] concept is used to model several types of failure conditions such as link, node, fiber conduit, etc. In this work we focus on the problem of computing optimal SRLG/link diverse paths under shared protection. Shared protection technique improves network resource utilization by allowing protection paths of multiple connections to share resources. In this work we propose an iterative heuristic for computing SRLG/link diverse paths. We present a method to calculate a quantitative measure that provides a bounded guarantee on the optimality of the diverse paths computed by the heuristic. The experimental results on computing link diverse paths show that our proposed heuristic is efficient in terms of number of iterations required (time taken) to compute diverse paths when compared to other previously proposed heuristics.

Survivable Traffic Grooming with Path Protection at the Connection Level in WDM Mesh Networks

Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength division multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated protection and shared protection schemes are considered. Given the network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures such as fiber cut and duct cut, we consider the general shared risk link group (SRLG) diverse routing constraints. We first resort to the integer linear programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA) and tabu search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu search method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.

PUBLIC POLICY EDUCATION: AN IMPORTANT WILDLIFE MANAGEMENT OPPORTUNITY

Suburban wildlife management issues are generating heated debate between citizen organizations, elected public officials, and state wildlife management agencies. Decisions are being made by town and county officials which directly impact or supersede state authority for managing resident wildlife. As an example, I will focus this discussion on the white-tailed deer (Odocoileus virginianus), management controversy at Durand Eastman Park, in the greater Rochester metropolitan area, New York.

Role of xanthophyll and water-water cycles in the protection of photosynthetic apparatus in Arbutus unedo and Arabidopsis thaliana

Photosynthetic organisms have sought out the delicate balance between efficient light harvesting under limited irradiance and regulated energy dissipation under excess irradiance. One of the protective mechanisms is the thermal energy dissipation through the xanthophyll cycle that may transform harmlessly the excitation energy into heat and thereby prevent the formation of damaging active oxygen species (AOS). Violaxanthin deepoxidase (VDE) converts violaxanthin (V) to antheraxanthin (A) and zeaxanthin (Z) defending the photosynthetic apparatus from excess of light. Another important biological pathway is the chloroplast water-water cycle, which is referred to the electrons from water generated in PSII reducing atmospheric O2 to water in PSI. This mechanism is active in the scavenging of AOS, when electron transport is slowed down by the over-reduction of NADPH pool. The control of the VDE gene and the variations of a set of physiological parameters, such as chlorophyll florescence and AOS content, have been investigated in response to excess of light and drought condition using Arabidopsis thaliana and Arbutus unedo.. Pigment analysis showed an unambiguous relationship between xanthophyll de-epoxidation state ((A+Z)/(V+A+Z)) and VDE mRNA amount in not-irrigated plants. Unexpectedly, gene expression is higher during the night when xanthophylls are mostly epoxidated and VDE activity is supposed to be very low than during the day. The importance of the water-water cycle in protecting the chloroplasts from light stress has been examined through Arabidopsis plant with a suppressed expression of the key enzyme of the cycle: the thylakoid-attached copper/zinc superoxide dismutase. The analysis revealed changes in transcript expression during leaf development consistent with a signalling role of AOS in plant defence responses but no difference was found any in photosynthesis efficiency or in AOS concentration after short-term exposure to excess of light. Environmental stresses such as drought may render previously optimal light levels excessive. In these circumstances the intrinsic regulations of photosynthetic electron transport like xanthophyll and water-water cycles might modify metabolism and gene expression in order to deal with increasing AOS.

A Law and Economics Analysis of Trade Secrets: Optimal Scope of Law, Misappropriation and Alternative Damages Regimes

This thesis is primarily based on three core chapters, focused on the fundamental issues of trade secrets law. The goal of this thesis is to come up with policy recommendations to improve legal structure governing trade secrets. The focal points of this research are the following. What is the optimal scope of trade secrets law? How does it depend on the market characteristics such as degree of product differentiation between competing products? What factors need to be considered to balance the contradicting objectives of promoting innovation and knowledge diffusion? The second strand of this research focuses on the desirability of lost profits or unjust enrichment damage regimes in case of misappropriation of a trade secret. A comparison between these regimes is made and simple policy implications are extracted from the analysis. The last part of this research is an empirical analysis of a possible relationship between trade secrets sharing and misappropriation instances faced by firms.

Determining the Socially Optimal Recycling Rate

What municipal recycling rate is socially optimal? One credible answer would consider the recycling rate that minimizes the overall social costs of managing municipal waste. Such social costs are comprised of all budgetary costs and revenues associated with operating municipal waste and recycling programs, all costs to recycling households associated with preparing and storing recyclable materials for collection, all external disposal costs associated with waste disposed at landfills or incinerators, and all external benefits associated with the provision of recycled materials that foster environmentally efficient production processes. This paper discusses how to estimate these four components of social cost to then estimate the optimal recycling rate. (C) 2013 Elsevier B.V. All rights reserved.