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.

Maximizing Resource Sharing in WDM Mesh Networks With Path-Based Protection and Sparse OEO Regeneration

We propose a resource-sharing scheme that supports three kinds of sharing scenarios in a WDM mesh network with path-based protection and sparse OEO regeneration. Several approaches are used to maximize the sharing of wavelength-links and OEO regenerators.

Examining the use of terms "Conservation" "Restoration" and "Preservation" between Natural Resource Professionals and Literature Reviews

ABSTRACT This thesis will determine if there is a discrepancy between how literature defines conservation, preservation, and restoration, and how natural resource professionals define these terms. Interviews were conducted with six professionals from six different agencies that deal with natural resources. These agencies consisted of both government and non-government groups. In addition to interviewing these professionals regarding how they define the terms, they were asked where their work fits into the context of these terms. The interviewees’ responses were then compared with the literature to determine inconsistencies with the use of these terms in the literature and real world settings. The literature and the interviewees have agreed on the term conservation. There are some different points of view about preservation, some see it as ‘no management’ and some others see it as keeping things the same or ‘static.’ Restoration was the term where both the literature and professionals thought of moving an ecosystem from one point of succession or community, to another point on a continuum. The only thing in which they disagree on is the final goal of a restoration project. The literature would suggest restoring the ecosystem to a past historic condition, where the interviewees said to restore it to the best of their abilities and to a functioning ecosystem.

Book Review of Archaeological Theory and the Politics of Cultural Heritage by Laurajane Smith

The passage of the Native American Graves Protection and Repatriation Act (NAGPRA) in 1991 significantly changed the way archaeology would be done in the United States. This act was presaged by growing complaints and resentment directed at the scientific community by Native Americans over the treatment of their ancestral remains. Many of the underlying issues came to a head with the discovery and subsequent court battles over the 9,200-year-old individual commonly known as Kennewick Man. This had a galvanizing effect on the discipline, not only perpetuating the sometimes adversarial relationship between archaeologists and Native Americans, but also creating a rift between those archaeologists who understood Native American concerns and those who saw their ancestral skeletal remains representing the legacy of humankind and thus belonging to everyone. Similar scenarios have emerged in Australia.

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.

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.