Network Design (network + design)

Distribution by Scientific Domains

Terms modified by Network Design

  • network design problem

  • Selected Abstracts


    OBSERVATION WELL NETWORK DESIGN FOR PUMPING TESTS IN UNCONFINED AQUIFERS,

    JOURNAL OF THE AMERICAN WATER RESOURCES ASSOCIATION, Issue 1 2003
    Xunhong Chen
    ABSTRACT: This paper presents a method for determining locations of observation wells to be used in conducting pumping tests in unconfined aquifers. Sensitivity coefficients, the distribution of relative errors, and the correlation coefficients between four aquifer parameters (horizontal and vertical hydraulic conductivities Kr and Kz, storage coefficient S, and specific yield Sy) are used as the criteria for the design of observation well networks and the interpretation of pumping tests. The contours of the relative errors over a vertical profile are very useful in selecting the "best" location of an observation well. Results from theoretical analyses suggest that a wide range of locations is suitable for the determination of Kr and that good locations for the determination of Kz and S may be poorly suited for the determination of Sy. Consideration must be given to the position and lengths of the pumping well screen in the selection of observation well locations. For a given location, the quality of test data can be improved by using high pumping rates and frequent sampling of drawdowns. We found that a minimum of two and preferably three observation locations are needed along a given transect. Results of the four parameters from a single well analysis may contain higher uncertainties. However, composite analyses of multiple observation wells can reduce the correlation between the four aquifer parameters, particularly between Kr and Sy, thus, improving the quality of parameter estimation. Results from two pumping tests conducted at sites located in Nebraska were examined with regard to the proposed methodology. [source]


    RAINGAGE NETWORK DESIGN USING NEXRAD PRECIPITATION ESTIMATES,

    JOURNAL OF THE AMERICAN WATER RESOURCES ASSOCIATION, Issue 5 2002
    A. Allen Bradley
    ABSTRACT: A general framework is proposed for using precipitation estimates from NEXRAD weather radars in raingage network design. NEXRAD precipitation products are used to represent space time rainfall fields, which can be sampled by hypothetical raingage networks. A stochastic model is used to simulate gage observations based on the areal average precipitation for radar grid cells. The stochastic model accounts for subgrid variability of precipitation within the cell and gage measurement errors. The approach is ideally suited to raingage network design in regions with strong climatic variations in rainfall where conventional methods are sometimes lacking. A case study example involving the estimation of areal average precipitation for catchments in the Catskill Mountains illustrates the approach. The case study shows how the simulation approach can be used to quantify the effects of gage density, basin size, spatial variation of precipitation, and gage measurement error, on network estimates of areal average precipitation. Although the quality of NEXRAD precipitation products imposes limitations on their use in network design, weather radars can provide valuable information for empirical assessment of rain-gage network estimation errors. Still, the biggest challenge in quantifying estimation errors is understanding subgrid spatial variability. The results from the case study show that the spatial correlation of precipitation at subgrid scales (4 km and less) is difficult to quantify, especially for short sampling durations. Network estimation errors for hourly precipitation are extremely sensitive to the uncertainty in subgrid spatial variability, although for storm total accumulation, they are much less sensitive. [source]


    Robust Transportation Network Design Under Demand Uncertainty

    COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, Issue 1 2007
    Satish V. Ukkusuri
    The origin,destination trip matrices are taken as random variables with known probability distributions. Instead of finding optimal network design solutions for a given future scenario, we are concerned with solutions that are in some sense "good" for a variety of demand realizations. We introduce a definition of robustness accounting for the planner's required degree of robustness. We propose a formulation of the robust network design problem (RNDP) and develop a methodology based on genetic algorithm (GA) to solve the RNDP. The proposed model generates globally near-optimal network design solutions, f, based on the planner's input for robustness. The study makes two important contributions to the network design literature. First, robust network design solutions are significantly different from the deterministic NDPs and not accounting for them could potentially underestimate the network-wide impacts. Second, systematic evaluation of the performance of the model and solution algorithm is conducted on different test networks and budget levels to explore the efficacy of this approach. The results highlight the importance of accounting for robustness in transportation planning and the proposed approach is capable of producing high-quality solutions. [source]


    Genetic Algorithms for Optimal Urban Transit Network Design

    COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, Issue 3 2003
    Partha Chakroborty
    This article attempts to highlight the effectiveness of genetic algorithm (GA),based procedures in solving the urban transit network design problem (UTNDP). The article analyzes why traditional methods have problems in solving the UTNDP. The article also suggests procedures to alleviate these problems using GA,based optimization technique. The thrust of the article is three,fold: (1) to show the effectiveness of GAs in solving the UTNDP, (2) to identify features of the UTNDP that make it a difficult problem for traditional techniques, and (3) to suggest directions, through the presentation of GA,based methodologies for the UTNDP, for the development of GA,based procedures for solving other optimization problems having features similar to the UTNDP. [source]


    Solving the Hub location problem in telecommunication network design: A local search approach

    NETWORKS: AN INTERNATIONAL JOURNAL, Issue 2 2004
    G. Carello
    Abstract This article deals with a Hub Location Problem arising in Telecommunication Network Design. The considered network presents two different kinds of nodes: access nodes, that represent source and destination of traffic demands but cannot be directly connected, and transit nodes, that have no own traffic demand but collect traffic from access nodes and route it through the network. Transit nodes are supposed to be fully connected. Given a set of access nodes and a set of potential locations for the transit nodes, the problem is to decide number and positions of the transit nodes to guarantee that all access nodes are allocated to a transit node, satisfying capacity constraints. The goal is to minimize the total cost of the network, which is the sum of connection costs and nodes fixed costs. The problem is a Hub Location Problem, which is known to be NP-hard. A local search approach is proposed, and different metaheuristic algorithms, such as tabu search, iterated local search and random multistart, have been developed, based on such local search. [A preliminary procedure has been developed in a research project joint with Telecom Italia (Turin Research & Innovation Laboratories) and a patent application has been filed to cover this issue.] © 2004 Wiley Periodicals, Inc. NETWOEKS, Vol. 44(2), 94,105 2004 [source]


    A Linear Model for the Continuous Network Design Problem

    COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, Issue 5 2006
    S. Travis Waller
    A linear programming formulation is introduced based on a dynamic traffic assignment (DTA) model that propagates traffic according to the cell transmission model. The introduced approach is limited to continuous link improvements and does not provide for new link additions. The main contribution of the article is to provide an analytical formulation for network design that accounts for DTA conditions that can be used for further analysis and extensions. The model is tested on a single destination example network, resembling a freeway corridor, for various congestion levels, loading patterns and budget sizes, to demonstrate the simplicity and effectiveness of the approach. [source]


    Wilderness and future conservation priorities in Australia

    DIVERSITY AND DISTRIBUTIONS, Issue 6 2009
    James E.M. Watson
    Abstract Aim, Most approaches to conservation prioritization are focused on biodiversity features that are already threatened. While this is necessary in the face of accelerating anthropogenic threats, there have been calls to conserve large intact landscapes, often termed ,wilderness', to ensure the long-term persistence of biodiversity. In this study, we examine the consequences of directing conservation expenditure using a threat-based framework for wilderness conservation. Location, The Australian continent. Methods, We measured the degree of congruence between the extent of wilderness and the Australian protected area network in 2000 and 2006, which was established using a threat-based systematic planning framework. We also assessed priority areas for future reserve acquisitions identified by the Australian government under the current framework. Results, In 2000, 14% of Australia's wilderness was under formal protection, while the protected area network covered only 8.5% of the continent, suggesting a historical bias towards wilderness protection. However, the expansion of the reserve system from 2000 to 2006 was biased towards non-wilderness areas. Moreover, 90% of the wilderness that was protected over this period comprised areas not primarily designated for biodiversity conservation. We found a significant (P < 0.05) negative relationship between bioregions considered to be a priority for future reserve prioritization and the amount of wilderness they contain. Main conclusions, While there is an urgent need to overcome past biases in reserve network design so as to better protect poorly represented species and habitats, prioritization approaches should not become so reactive as to ignore the role that large, intact landscapes play in conserving biodiversity, especially in a time of human-induced climate change. This can be achieved by using current or future threats rather than past threats to prioritize areas, and by incorporating key ecological processes and costs of acquisition and management within the planning framework. [source]


    Does conservation planning matter in a dynamic and uncertain world?

    ECOLOGY LETTERS, Issue 8 2004
    Eli Meir
    Abstract Loss of biodiversity is one of the world's overriding environmental challenges. Reducing those losses by creating reserve networks is a cornerstone of global conservation and resource management. Historically, assembly of reserve networks has been ad hoc, but recently the focus has shifted to identifying optimal reserve networks. We show that while comprehensive reserve network design is best when the entire network can be implemented immediately, when conservation investments must be staged over years, such solutions actually may be sub-optimal in the context of biodiversity loss and uncertainty. Simple decision rules, such as protecting the available site with the highest irreplaceability or with the highest species richness, may be more effective when implementation occurs over many years. [source]


    Survivable wavelength-routed optical network design using genetic algorithms

    EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 3 2008
    Y. S. Kavian
    The provision of acceptable service in the presence of failures and attacks is a major issue in the design of next generation dense wavelength division multiplexing (DWDM) networks. Survivability is provided by the establishment of spare lightpaths for each connection request to protect the working lightpaths. This paper presents a genetic algorithm (GA) solver for the routing and wavelength assignment problem with working and spare lightpaths to design survivable optical networks in the presence of a single link failure. Lightpaths are encoded into chromosomes made up of a fixed number of genes equal to the number of entries in the traffic demand matrix. Each gene represents one valid path and is thus coded as a variable length binary string. After crossover and mutation, each member of the population represents a set of valid but possibly incompatible paths and those that do not satisfy the problem constraints are discarded. The best paths are then found by use of a fitness function and these are assigned the minimum number of wavelengths according to the problem constraints. The proposed approach has been evaluated on dedicated path protection and shared path protection. Simulation results show that the GA method is efficient and able to design DWDM survivable real-world optical mesh networks. Copyright © 2007 John Wiley & Sons, Ltd. [source]


    Molecular Origins of the Mechanical Behavior of Hybrid Glasses

    ADVANCED FUNCTIONAL MATERIALS, Issue 17 2010
    Mark S. Oliver
    Abstract Hybrid organic-inorganic glasses exhibit unique electro-optical properties along with excellent thermal stability. Their inherently mechanically fragile nature, however, which derives from the oxide component of the hybrid glass network together with the presence of terminal groups that reduce network connectivity, remains a fundamental challenge for their integration in nanoscience and energy technologies. We report on a combined synthesis and computational strategy to elucidate the effect of molecular structure on mechanical properties of hybrid glass films. We first demonstrate the importance of rigidity percolation to elastic behavior. Secondly, using a novel application of graph theory, we reveal the complex 3-D fracture path at the molecular scale and show that fracture energy in brittle hybrid glasses is fundamentally governed by the bond percolation properties of the network. The computational tools and scaling laws presented provide a robust predictive capability for guiding precursor selection and molecular network design of advanced hybrid organic-inorganic materials. [source]


    Rainfall network design using kriging and entropy

    HYDROLOGICAL PROCESSES, Issue 3 2008
    Yen-Chang Chen
    Abstract The spatial distribution of rainfall is related to meteorological and topographical factors. An understanding of the weather and topography is required to select the locations of the rain gauge stations in the catchment to obtain the optimum information. In theory, a well-designed rainfall network can accurately represent and provide the needed information of rainfall in the catchment. However, the available rainfall data are rarely adequate in the mountainous area of Taiwan. In order to provide enough rainfall data to assure the success of water projects, the rainfall network based on the existing rain gauge stations has to be redesigned. A method composed of kriging and entropy that can determine the optimum number and spatial distribution of rain gauge stations in catchments is proposed. Kriging as an interpolator, which performs linear averaging to reconstruct the rainfall over the catchment on the basis of the observed rainfall, is used to compute the spatial variations of rainfall. Thus, the rainfall data at the locations of the candidate rain gauge stations can be reconstructed. The information entropy reveals the rainfall information of the each rain gauge station in the catchment. By calculating the joint entropy and the transmitted information, the candidate rain gauge stations are prioritized. In addition, the saturation of rainfall information can be used to add or remove the rain gauge stations. Thus, the optimum spatial distribution and the minimum number of rain gauge stations in the network can be determined. The catchment of the Shimen Reservoir in Taiwan is used to illustrate the method. The result shows that only seven rain gauge stations are needed to provide the necessary information. Copyright © 2007 John Wiley & Sons, Ltd. [source]


    ,The National Stream Quality Accounting Network: a flux-based approach to monitoring the water quality of large rivers

    HYDROLOGICAL PROCESSES, Issue 7 2001
    Richard P. Hooper
    Abstract Estimating the annual mass flux at a network of fixed stations is one approach to characterizing water quality of large rivers. The interpretive context provided by annual flux includes identifying source and sink areas for constituents and estimating the loadings to receiving waters, such as reservoirs or the ocean. Since 1995, the US Geological Survey's National Stream Quality Accounting Network (NASQAN) has employed this approach at a network of 39 stations in four of the largest river basins of the USA: the Mississippi, the Columbia, the Colorado and the Rio Grande. In this paper, the design of NASQAN is described and its effectiveness at characterizing the water quality of these rivers is evaluated using data from the first 3 years of operation. A broad range of constituents was measured by NASQAN, including trace organic and inorganic chemicals, major ions, sediment and nutrients. Where possible, a regression model relating concentration to discharge and season was used to interpolate between chemical observations for flux estimation. For water-quality network design, the most important finding from NASQAN was the importance of having a specific objective (that is, estimating annual mass flux) and, from that, an explicitly stated data analysis strategy, namely the use of regression models to interpolate between observations. The use of such models aided in the design of sampling strategy and provided a context for data review. The regression models essentially form null hypotheses for concentration variation that can be evaluated by the observed data. The feedback between network operation and data collection established by the hypothesis tests places the water-quality network on a firm scientific footing. Published in 2001 by John Wiley & Sons, Ltd. [source]


    Sensor network design for fault tolerant estimation

    INTERNATIONAL JOURNAL OF ADAPTIVE CONTROL AND SIGNAL PROCESSING, Issue 1 2004
    M. Staroswiecki
    Abstract This paper addresses the problem of fault tolerant estimation and the design of fault tolerant sensor networks. Fault tolerance is defined with respect to a given estimation objective, namely a given functional of the system state should remain observable when sensor failures occur. Redundant and minimal sensor sets are defined and organized into an automaton which contains all the subsets of sensors such that the estimation objective can be achieved. Three criteria, which evaluate the system fault tolerance with respect to sensor failures when a reconfiguration strategy is used, are introduced: (strong and weak) redundancy degrees (RD), sensor network reliability (R), and mean time to non-observability (MTTNO). Sensor networks are designed by finding redundant sensor sets whose RD and/or R and/or MTTNO are larger than some specified values. A ship boiler example is developed for illustration. Copyright © 2004 John Wiley & Sons, Ltd. [source]


    Online end-to-end quality of service monitoring for service level agreement management

    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 4 2008
    Xiaoyuan Ta
    Abstract A major challenge in network and service level agreement (SLA) management is to provide Quality of Service (QoS) demanded by heterogeneous network applications. Online QoS monitoring plays an important role in the process by providing objective measurements that can be used for improving network design, troubleshooting and management. Online QoS monitoring becomes increasingly difficult and complex due to the rapid expansion of the Internet and the dramatic increase in the speed of network. Sampling techniques have been explored as a means to reduce the difficulty and complexity of measurement. In this paper, we investigate several major sampling techniques, i.e. systematic sampling, simple random sampling and stratified sampling. Performance analysis is conducted on these techniques. It is shown that stratified sampling with optimum allocation has the best performance. However, stratified sampling with optimum allocation requires additional statistics usually not available for real-time applications. An adaptive stratified sampling algorithm is proposed to solve the problem. Both theoretical analysis and simulation show that the proposed adaptive stratified sampling algorithm outperforms other sampling techniques and achieves a performance comparable to stratified sampling with optimum allocation. A QoS monitoring software using the aforementioned sampling techniques is designed and tested in various real networks. Copyright © 2007 John Wiley & Sons, Ltd. [source]


    A tutorial on using genetic algorithms for the design of network topology

    INTERNATIONAL JOURNAL OF NETWORK MANAGEMENT, Issue 4 2006
    Bassam Al-Bassam
    The design of network topology is an important part of network design, since network topology is directly associated with network operational behavior, capacity, reliability, and cost. This paper is a tutorial paper concerned with illustrating how the optimization capabilities of genetic algorithms can be used to design suitable network topologies considering basic topology problems. Simple genetic algorithms have been developed for the topology problem of mesh networks, considering single node and single link failure tolerance. The algorithms are based on criteria of two important measures: minimizing the length of communication links; and minimizing traffic flow through these links for given traffic loads. The first measure contributes to minimizing the cost of cabling, while the second measure contributes to minimizing the cost of link capacity. The work provides a useful approach and tools to network students and professionals concerned with the topology design of backbone networks. The developed software is made available on the Internet.,Copyright © 2006 John Wiley & Sons, Ltd. [source]


    Matching network design using non-Foster impedances

    INTERNATIONAL JOURNAL OF RF AND MICROWAVE COMPUTER-AIDED ENGINEERING, Issue 2 2006
    *Article first published online: 8 FEB 200, Stephen E. Sussman-Fort
    Abstract Non-Foster synthesis bypasses the gain-bandwidth limitations of conventional LC matching and achieves superior broadband performance by employing negative circuit elements, which are realized via negative impedance converters. The idea is to construct a negative-image model of an antenna, which cancels the antenna's parasitic reactance and transforms its frequency-dependent radiation resistance to a constant value. Successful implementation of negative-image modeling requires the realization of stable, low-loss negative elements. After a discussion of the basic ideas of non-Foster matching, we present experimental results for broadband, stable, high- Q, grounded negative capacitance. Next, in the first experimental confirmation of non-Foster impedance matching for signal reception, we use a floating negative capacitor to cancel a substantial portion of the reactance of a 6-in. monopole antenna. Over 20,110 MHz, the signal-to-noise ratio improved by up to 6 dB as compared to the same antenna with no matching, or to a lossy-matched blade antenna of twice the size. © 2006 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2006. [source]


    Recent developments in nonlinear network design: Overview of integrated nonlinear microwave and millimeter-wave circuits workshop

    INTERNATIONAL JOURNAL OF RF AND MICROWAVE COMPUTER-AIDED ENGINEERING, Issue 5 2002
    Adalbert BeyerArticle first published online: 27 AUG 200
    Abstract In the 1960s and 1970s the design of microwave networks containing nonlinear elements often consisted of trial and error routines. The required circuit performance was then achieved iteratively. With the knowledge of the physical property of the materials at microwave frequencies and its influence on active devices used in microwave networks, it is possible to reduce the time required to analyze new nonlinear circuits for microwave purposes. Advanced tools are necessary, which can analyze the network very quickly for a short development time. The basic requirements are a fast and accurate nonlinear measurement system and descriptions that match the real counterpart. This article shows the development of the nonlinear microwave network design for the last decade as a reflection of the workshop entitled Integrated Nonlinear Microwave and Millimeterwave Circuits. © 2002 Wiley Periodicals, Inc. Int J RF and Microwave CAE 12, 388,417, 2002. Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mmce10041 [source]


    Integrating the scene length characteristics of MPEG video bitstreams into a direct broadcast satellite network with return channel system

    INTERNATIONAL JOURNAL OF SATELLITE COMMUNICATIONS AND NETWORKING, Issue 2 2004
    Fatih Alagöz
    Abstract In order to optimize the network resources, we should incorporate all the available information into the network design. However, incorporating irrelevant information may increase the design complexity and/or decrease the performance of the network. In this paper, we investigate the relevance of integrating the scene length characteristics of moving pictures expert group (MPEG) coded video bitstreams into a direct broadcast satellite (DBS) network with return channel system (DVB-RCS). Due to the complexity of the studied system, unless disputable simplifications are made, it is hard to achieve a mathematical foundation for this integration. Our analysis relies on extensive set of simulations. Firstly, we achieve the scene length distributions for MPEG bitstreams based on the proposed scene change models and their subjective observations of the actual video. We show that these models may be used to estimate the scene length of MPEG bitstreams. We then integrate this estimation into a DBS network simulator. Finally, we show that the scene length characteristics may be used to improve the DBS network performance under certain conditions. Copyright © 2004 John Wiley & Sons, Ltd. [source]


    Assessment of the Automobile Assembly Paint Process for Energy, Environmental, and Economic Improvement

    JOURNAL OF INDUSTRIAL ECOLOGY, Issue 1-2 2004
    Geoffrey J. Roelant
    A coat of paint adds considerable value to an automobile. In addition to consuming up to 60% of the energy needed by automobile assembly plants, however, the painting process also creates both economic and environmental impacts. This study investigated the degree of cost and environmental impact improvement that can be expected when modifications are considered for existing paint processes through heat integration. In order to accomplish this goal, a mathematical model was created to describe the energy use, costs, and environmental impacts from energy consumption in an automobile assembly painting facility. The model agrees with measured energy consumption data for process heating and electricity demand to within about 15% for one Michigan truck facility from which model input parameters were obtained. Thermal pinch analysis determined an energy conservation target of 58% of paint process energy demand. A heat exchanger network optimization study was conducted in order to determine how closely the network design could achieve this target. The resulting heat exchanger network design was profitable based on a discounted cash flow analysis and may achieve reductions in total corporate energy consumption of up to 16% if implemented corporatewide at a major automobile manufacturer. [source]


    RAINGAGE NETWORK DESIGN USING NEXRAD PRECIPITATION ESTIMATES,

    JOURNAL OF THE AMERICAN WATER RESOURCES ASSOCIATION, Issue 5 2002
    A. Allen Bradley
    ABSTRACT: A general framework is proposed for using precipitation estimates from NEXRAD weather radars in raingage network design. NEXRAD precipitation products are used to represent space time rainfall fields, which can be sampled by hypothetical raingage networks. A stochastic model is used to simulate gage observations based on the areal average precipitation for radar grid cells. The stochastic model accounts for subgrid variability of precipitation within the cell and gage measurement errors. The approach is ideally suited to raingage network design in regions with strong climatic variations in rainfall where conventional methods are sometimes lacking. A case study example involving the estimation of areal average precipitation for catchments in the Catskill Mountains illustrates the approach. The case study shows how the simulation approach can be used to quantify the effects of gage density, basin size, spatial variation of precipitation, and gage measurement error, on network estimates of areal average precipitation. Although the quality of NEXRAD precipitation products imposes limitations on their use in network design, weather radars can provide valuable information for empirical assessment of rain-gage network estimation errors. Still, the biggest challenge in quantifying estimation errors is understanding subgrid spatial variability. The results from the case study show that the spatial correlation of precipitation at subgrid scales (4 km and less) is difficult to quantify, especially for short sampling durations. Network estimation errors for hourly precipitation are extremely sensitive to the uncertainty in subgrid spatial variability, although for storm total accumulation, they are much less sensitive. [source]


    Conserving the evolutionary potential of California valley oak (Quercus lobata Née): a multivariate genetic approach to conservation planning

    MOLECULAR ECOLOGY, Issue 1 2008
    DELPHINE GRIVET
    Abstract California valley oak (Quercus lobata Née) is a seriously threatened endemic oak species in California and a keystone species for foothill oak ecosystems. Urban and agricultural development affects a significant fraction of the species' range and predicted climate change is likely to dislocate many current populations. Here, we explore spatial patterns of multivariate genotypes and genetic diversity throughout the range of valley oak to determine whether ongoing and future patterns of habitat loss could threaten the evolutionary potential of the species by eradicating populations of distinctive genetic composition. This manuscript will address three specific questions: (i) What is the spatial genetic structure of the chloroplast and nuclear genetic markers? (ii) What are the geographical trends in the distribution of chloroplast and nuclear genotypes? (iii) Is there any part of the species' range where allelic diversity in either the chloroplast or nuclear genomes is particularly high? We analysed six chloroplast and seven nuclear microsatellite genetic markers of individuals widespread across the valley oak range. We then used a multivariate approach correlating genetic markers and geographical variables through a canonical trend surface analysis, followed by GIS mapping of the significant axes. We visualized population allelic richness spatially with GIS tools to identify regions of high diversity. Our findings, based on the distribution of multivariate genotypes and allelic richness, identify areas with distinctive histories and genetic composition that should be given priority in reserve network design, especially because these areas also overlap with landscape change and little degree of protection. Thus, without a careful preservation plan, valuable evolutionary information will be lost for valley oak. [source]


    Information security: Designing a stochastic-network for throughput and reliability,,

    NAVAL RESEARCH LOGISTICS: AN INTERNATIONAL JOURNAL, Issue 7 2009
    Jeffrey Schavland
    Abstract Todas information and communication network requires a design that is secure to tampering. Traditional performance measures of reliability and throughput must be supplemented with measures of security. Recognition of an adversary who can inflict damage leads toward a game-theoretic model. Through such a formulation, guidelines for network designs and improvements are derived. We opt for a design that is most robust to withstand both natural degradation and adversarial attacks. Extensive computational experience with such a model suggests that a Nash-equilibrium design exists that can withstand the worst possible damage. Most important, the equilibrium is value-free in that it is stable irrespective of the unit costs associated with reliability vs. capacity improvement and how one wishes to trade between throughput and reliability. This finding helps to pinpoint the most critical components in network design. From a policy standpoint, the model also allows the monetary value of information-security to be imputed. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 [source]


    Outbound supply chain network design with mode selection and lead time considerations

    NAVAL RESEARCH LOGISTICS: AN INTERNATIONAL JOURNAL, Issue 3 2007
    Erdem Eskigun
    Abstract We present a large-scale network design model for the outbound supply chain of an automotive company that considers transportation mode selection (road vs. rail) and explicitly models the relationship between lead times and the volume of flow through the nodes of the network. We formulate the problem as a nonlinear zero-one integer program, reformulate it to obtain a linear integer model, and develop a Lagrangian heuristic for its solution that gives near-optimal results in reasonable time. We also present scenario analyses that examine the behavior of the supply chain under different parameter settings and the performance of the solution procedures under different experimental conditions. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 [source]


    On the complexity of resilient network design

    NETWORKS: AN INTERNATIONAL JOURNAL, Issue 2 2010
    Artur Tomaszewski
    Abstract In this article we prove ,,,,-hardness of two well-known optimization problems related to the design of multicommodity flow networks with two different methods for providing network resiliency against failures: path diversity and flow restoration. Path diversity is a static mechanism that consists of using, for each demand, a number of paths and oversizing the flows assigned to these paths so that for any failure the total surviving flow is not less than the volume of the demand. By contrast, flow restoration is a dynamic mechanism that consists of reassigning the failed flows to backup paths when a failure occurs. Both mechanisms are of practical interest because although flow restoration is in general superior to path diversity in terms of the required amount of resource capacity, it might be too complicated to implement. By providing an appropriate reduction from the fractional graph coloring problem, we show that both problems are ,,,,-hard in the general case of failure scenarios that admit simultaneous failures of multiple links. Finally, we discuss how to efficiently solve the two problems using path generation techniques. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010 [source]


    Minimizing SONET Add-Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths

    NETWORKS: AN INTERNATIONAL JOURNAL, Issue 3 2009
    Yong Wang
    Abstract In SONET/WDM optical networks, a high-speed wavelength channel is usually shared by multiplexed low-rate network traffic demands. The multiplexing is known as traffic grooming and carried out by SONET Add-Drop Multiplexers (SADM). The maximum number of low-rate traffic demands that can be multiplexed into one wavelength is called the grooming factor. Because SADMs are expensive network devices, a key optimization problem in optical network design is to groom a given set of low-rate traffic demands such that the number of required SADMs is minimized. This optimization problem is challenging and NP-hard even for Unidirectional Path-Switched Ring networks with unitary duplex traffic demands. In this article, we propose two linear-time approximation algorithms for this NP-hard problem based on a novel graph partitioning approach. Both algorithms achieve better worst case performance than the previous algorithms. We also show that the upper bounds obtained by our algorithms are very close to the lower bounds for some instances. In addition, both of our algorithms use the minimum number of wavelengths, which are precious resources as well in optical networks. © 2008 Wiley Periodicals, Inc. NETWORKS, 2009 [source]


    Exact algorithms for the master ring problem,

    NETWORKS: AN INTERNATIONAL JOURNAL, Issue 2 2008
    Hadas Shachnai
    Abstract We consider the master ring problem (MRP) which often arises in optical network design. Given a network which consists of a collection of interconnected rings R1,,,RK, with n1,,,nK distinct nodes, respectively, we need to find an ordering of the nodes in the network that respects the ordering of every individual ring, if one exists. We show that MRP is NP-complete, and therefore, it is unlikely to be solvable by a polynomial time algorithm. Our main result is an algorithm which solves MRP in steps, for some polynomial Q, as the nk values become large. For the ring clearance problem, a special case of practical interest, our algorithm achieves this running time for rings of any size nk , 2. This yields the first nontrivial improvement, by factor of , over the running time of the naive algorithm, which exhaustively enumerates all possible solutions. © 2008 Wiley Periodicals, Inc. NETWORKS, 2008 [source]


    A hub covering model for cargo delivery systems

    NETWORKS: AN INTERNATIONAL JOURNAL, Issue 1 2007
    Pinar Z. Tan
    Abstract The hub location problem appears in a variety of applications including airline systems, cargo delivery systems, and telecommunication network design. When we analyze the application areas separately, we observe that each area has its own characteristics. In this research we focus on cargo delivery systems. Our interviews with various cargo delivery firms operating in Turkey enabled us to determine the constraints, requirements, and criteria of the hub location problem specific to the cargo delivery sector. We present integer programming formulations and large-scale implementations of the models within Turkey. The results are compared with the current structure of a cargo delivery firm operating in Turkey. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 49(1), 28,39 2007 [source]


    Solving the Hub location problem in telecommunication network design: A local search approach

    NETWORKS: AN INTERNATIONAL JOURNAL, Issue 2 2004
    G. Carello
    Abstract This article deals with a Hub Location Problem arising in Telecommunication Network Design. The considered network presents two different kinds of nodes: access nodes, that represent source and destination of traffic demands but cannot be directly connected, and transit nodes, that have no own traffic demand but collect traffic from access nodes and route it through the network. Transit nodes are supposed to be fully connected. Given a set of access nodes and a set of potential locations for the transit nodes, the problem is to decide number and positions of the transit nodes to guarantee that all access nodes are allocated to a transit node, satisfying capacity constraints. The goal is to minimize the total cost of the network, which is the sum of connection costs and nodes fixed costs. The problem is a Hub Location Problem, which is known to be NP-hard. A local search approach is proposed, and different metaheuristic algorithms, such as tabu search, iterated local search and random multistart, have been developed, based on such local search. [A preliminary procedure has been developed in a research project joint with Telecom Italia (Turin Research & Innovation Laboratories) and a patent application has been filed to cover this issue.] © 2004 Wiley Periodicals, Inc. NETWOEKS, Vol. 44(2), 94,105 2004 [source]


    Low-connectivity network design on series-parallel graphs

    NETWORKS: AN INTERNATIONAL JOURNAL, Issue 3 2004
    S. Raghavan
    Abstract Network survivability is a critical issue for modern fiber-optic telecommunication networks. Networks with alternate routes between pairs of nodes permit users to communicate in the face of equipment failure. In this paper, we consider the following low-connectivity network design (LCND) problem: Given a graph G = (N, E) and a connectivity requirement di , {0, 1, 2} for each node and edge costs ce for each edge e , E, design a minimum-cost network that contains at least dst = min{ds, dt} disjoint paths between nodes s and t. We present linear-time algorithms for both node- and edge-connectivity versions of the problem on series-parallel graphs. Due to the sparsity of telecommunications networks, this algorithm can be applied to obtain partial solutions and decompositions that may be embedded in a heuristic solution procedure as well as exact solution algorithms for the problem on general graphs. © 2004 Wiley Periodicals, Inc. [source]


    Optimization of Internet Protocol network design and routing

    NETWORKS: AN INTERNATIONAL JOURNAL, Issue 1 2004
    Kaj Holmberg
    Abstract We consider network design and routing for Internet Protocol (IP) traffic. The design problem concerns capacity dimensioning of communication links, where the design cost consists of fixed charges and linear capacity expansion costs. The optimization problem also concerns determining the amount of traffic demand to be carried by the network and the metric used by a shortest path routing protocol. We present a novel linear mixed-integer mathematical formulation and two heuristic solution procedures. The first heuristic uses mixed-integer programming to generate a sequence of routing solutions. The second solution approach is a simulated annealing meta heuristic. Computational experiments for synthesized and real-life networks show that high-quality solutions can be obtained by both approaches. © 2003 Wiley Periodicals, Inc. [source]