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.

Hydrogeologic Setting and Ground-Water Flow Simulations of the Eastern High Plains Regional Study Area, Nebraska

The transport of anthropogenic and natural contaminants to public-supply wells was evaluated in a part of the High Plains aquifer near York, Nebraska, as part of the U.S. Geological Survey National Water-Quality Assessment Program. The aquifer in the Eastern High Plains regional study area is composed of Quaternary alluvial deposits typical of the High Plains aquifer in eastern Nebraska and Kansas, is an important water source for agricultural irrigation and public water supply, and is susceptible and vulnerable to contamination. A six-layer, steady-state ground-water flow model of the High Plains aquifer near York, Nebraska, was constructed and calibrated to average conditions for the time period from 1997 to 2001. The calibrated model and advective particle-tracking simulations were used to compute areas contributing recharge and travel times from recharge areas to selected public-supply wells. Model results indicate recharge from agricultural irrigation return flow and precipitation (about 89 percent of inflow) provides most of the ground-water inflow, whereas the majority of ground-water discharge is to pumping wells (about 78 percent of outflow). Particle-tracking results indicate areas contributing recharge to public-supply wells extend northwest because of the natural ground-water gradient from the northwest to the southeast across the study area. Particle-tracking simulations indicate most ground-water travel times from areas contributing recharge range from 20 to more than 100 years but that some ground water, especially that in the lower confined unit, originates at the upgradient model boundary instead of at the water table in the study area and has travel times of thousands of years.