Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “routing”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS2004

Masked Proportional Routing

Masked proportional routing is an improved procedure for choosing links between adjacent nodes of a network for the purpose of transporting an entity from a source node ("A") to a destination node ("B"). The entity could be, for example, a physical object to be shipped, in which case the nodes would represent waypoints and the links would represent roads or other paths between waypoints. For another example, the entity could be a message or packet of data to be transmitted from A to B, in which case the nodes could be computer-controlled switching stations and the links could be communication channels between the stations. In yet another example, an entity could represent a workpiece while links and nodes could represent, respectively, manufacturing processes and stages in the progress of the workpiece towards a finished product. More generally, the nodes could represent states of an entity and the links could represent allowed transitions of the entity. The purpose of masked proportional routing and of related prior routing procedures is to schedule transitions of entities from their initial states ("A") to their final states ("B") in such a manner as to minimize a cost or to attain some other measure of optimality or efficiency. Masked proportional routing follows a distributed (in the sense of decentralized) approach to probabilistically or deterministically choosing the links. It was developed to satisfy a need for a routing procedure that 1. Does not always choose the same link(s), even for two instances characterized by identical estimated values of associated cost functions; 2. Enables a graceful transition from one set of links to another set of links as the circumstances of operation of the network change over time; 3. Is preferably amenable to separate optimization of different portions of the network; 4. Is preferably usable in a network in which some of the routing decisions are made by one or more other procedure(s); 5. Preferably does not cause an entity to visit the same node twice; and 6. Preferably can be modified so that separate entities moving from A to B do not arrive out of order.

Wolpert, David↗
NASA NTRS2017

Analysis of Convective Weather Impact on Pre-Departure Routing of Flights from Fort Worth Center to New York Center

In response to severe weather conditions, Traffic Managers specify flow constraints and reroutes to route air traffic around affected regions of airspace. Providing analysis and recommendations of available reroute options and associated airspace capacities would assist Traffic Managers in making more efficient decisions in response to convective weather. These recommendations can be developed by examining historical data to determine which previous reroute options were used in similar weather and traffic conditions. This paper describes the initial steps and methodology used towards this goal. The focus of this work is flights departing from Fort Worth Center destined for New York Center. Dominant routing structures used in the absence of convective weather are identified. A method to extract relevant features from the large volume of weather data available to quantify the impact of convective weather on this routing structure over a given time range is presented. Finally, a method of estimating flow rate capacity along commonly used routes during convective weather events is described. Results show that the flow rates drop exponentially as a function of the values of the proposed feature and that convective weather on the final third of the route was found to have a greater impact on the flow rate restriction than other portions of the route.

traffic flow management↗
NASA NTRS2017

The Critical Role of the Routing Scheme in Simulating Peak River Discharge in Global Hydrological Models

Global hydrological models (GHMs) have been applied to assess global flood hazards, but their capacity to capture the timing and amplitude of peak river discharge which is crucial in flood simulations has traditionally not been the focus of examination. Here we evaluate to what degree the choice of river routing scheme affects simulations of peak discharge and may help to provide better agreement with observations. To this end we use runoff and discharge simulations of nine GHMs forced by observational climate data (1971-2010) within the ISIMIP2a (Inter-Sectoral Impact Model Intercomparison Project phase 2a) project. The runoff simulations were used as input for the global river routing model CaMa-Flood (Catchment-based Macro-scale Floodplain). The simulated daily discharge was compared to the discharge generated by each GHM using its native river routing scheme. For each GHM both versions of simulated discharge were compared to monthly and daily discharge observations from 1701 GRDC (Global Runoff Data Centre) stations as a benchmark. CaMa-Flood routing shows a general reduction of peak river discharge and a delay of about two to three weeks in its occurrence, likely induced by the buffering capacity of floodplain reservoirs. For a majority of river basins, discharge produced by CaMa-Flood resulted in a better agreement with observations. In particular, maximum daily discharge was adjusted, with a multi-model averaged reduction in bias over about two-thirds of the analysed basin area. The increase in agreement was obtained in both managed and near-natural basins. Overall, this study demonstrates the importance of routing scheme choice in peak discharge simulation, where CaMa-Flood routing accounts for floodplain storage and backwater effects that are not represented in most GHMs. Our study provides important hints that an explicit parameterisation of these processes may be essential in future impact studies.

peak river discharge↗
NASA NTRS2019

Exploration of Near-Term Potential Routes and Procedures for Urban Air Mobility

This paper investigates routes and procedures for Urban Air Mobility (UAM), which aims to reduce congestion on the roads and highways by offering air taxi as an alternative to driving. The routes and procedures being explored are current-day helicopter routes along with different communication procedures that are available as tools in the near-term. Three different levels of UAM traffic were evaluated in the Dallas Fort Worth (DFW) area. The current-day helicopter routes were modified to separate them from traditional traffic, and a Letter of Agreement (LOA) was introduced in some of the conditions to reduce verbal communications. We found that modifications to the routes and introduction of LOA helped increase the number of UAM flights that the controllers reported they could manage and reduce their communications, which made controller self-reported workload more operationally acceptable. However, the self-reported workload experienced by busy airport towers cannot be effectively managed via the usage of LOA and modified helicopter routes, suggesting there is an opportunity to re-think roles and responsibilities of the UAM system participants.

Verma, Savita A.↗
NASA NTRSDate not supplied

Multi-Flight Common Routes

Flights often experience large delays when they are routed around weather. Multi-flight common routes advisories provide delay recovery by suggesting time-saving re-routes for groups of flights whose current weather-avoidance routes have become outdated because the weather has dissipated and/or moved away. The multi-flight common routes tool provides time-saving route change advisories taking into account flight plans, wind fields, and the spatio-temporal evolution of predicted convective weather. A graphical user interface enables these advisories to be easily modified by a traffic manager for possible operational implementation.

ATD-3↗
NASA NTRSDate not supplied

Cooperative Clustering Techniques Applied to Contact Graph Routing

Routing in the space internet has to face many unique challenges - from unplanned disconnections and interruptions to predictable intermittent connectivity due to high network mobility and long propagation delays. NASA’s current approach to such routing is Contact Graph Routing (CGR), using a graph formed of prescheduled communication contacts to compute routes through the network. While this approach manages to tackle issues of connectivity and propagation delays, it is a global approach that requires continuous knowledge of the entire network. In a potential future Solar Space Internet (SSI) such an approach on its own cannot scale to large networks with thousands of members. In this presentation we propose clustering as a solution to CGR scalability. Clustering has been used in many networking problems as a way to subdivide the network and allow for localized routing and better scalability. Using techniques from graph theory and game theory, we explore various existing clustering algorithms and adapt them to the Contact Graph Routing setting. Finally, we propose a way to combine multiple algorithms to create a Delay Tolerant Clustering Protocol.

Yael Kirkpatrick↗
NASA NTRSDate not supplied

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Monte Carlo Tree Search Approach

Numerous unmanned aircraft systems operating at low altitudes to deliver goods and services may one day become ubiquitous in our cities. In the Unmanned Aircraft Systems (UAS) Traffic Management (UTM) framework, such a concept is envisioned, where aerial vehicles operate beyond visual line of sight (BVLOS) within specifically reserved and time stamped “corridors” in the airspace. For example, these corridors or operational intent volumes can connect an aerial vehicle’s origin site to its destination site for package delivery operations. There may also be more than one corridor available for an aerial vehicle to choose from and often different corridors may intersect with one another. Thus, it is imperative to ensure flight trajectories belonging to different aerial vehicles are not in conflict. Per the UTM CONOPs, we assume that a vehicle almost always stays inside its corridor or operational volume. This work provides a framework for strategic deconfliction of UTM or package delivery drones, where we schedule the departure time of all vehicles subject to various temporal constraints (including the corridor deconfliction at the intersections). We present the “multi-route weighted package delivery problem” which serves as an exemplifying model for strategic deconfliction in UTM. In the multi-route weighted package delivery problem, a graph network is given which consists of a set of depots (source) and drop-off (destination) nodes, with multiple routes (defined as a sequence of waypoints) connecting the depots to drop-off nodes. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is for a known set of aerial vehicles to depart from the depots, choose a route and take off time, while avoiding conflicts with other aerial vehicles, and minimizing both risk and distance traveled. We provide a mixed integer linear programming (MILP) formulation of the problem, as well as a heuristic solution based on Monte Carlo Tree Search (MCTS) – a method used in game theory and artificial intelligence – to overcome limitations inherent to optimal solvers. Computational results show the advantages of using MCTS over the MILP formulation; the former can provide a sub-optimal solution quickly, and may sometimes even reach an optimal solution, whereas the latter may not even produce a solution in reasonable time. Furthermore, results from both the MILP formulation and MCTS methods were validated using a preliminary agent-based simulator implementing the UTM concept of operations. Thus, the MCTS method can be seen as a scalable solution to the complex multi-route weighted package delivery problem and may possibly be extended to similar complex optimization problems.

Kenny Chour↗
NASA NTRSDate not supplied

Multi-Domain Routing in Delay Tolerant Networks

The goal of Delay Tolerant Networking (DTN) is to provide the missing ingredient for the ever-growing collection of communicating nodes in our solar system to become a Solar System Internet (SSI). Great strides have been made in modeling particular types of DTNs, such as schedule- or discovery-based. Now, analogously to the Internet, these smaller DTNs can be considered routing domains which must be stitched together to form the overall SSI. In this paper, we propose a framework for cross-domain routing in DTNs as well as methodologies for detecting these sub-domains. Example time-varying networks are given to demonstrate the techniques proposed. A basic component is the mathematical theory of sheaves, which unifies the underlying model of DTN routing algorithms, by giving rise to routing sheaves – these can be defined for the dynamic and scheduled networks as noted above, and can also be used to define the interfaces between these domains in order to route across them. An immediate application would be routing across discovery-based networks connected by scheduled networks. These DTN subdomains remain elusive, however, and need to become well-defined and properly sized for tractable computability. In particular, a balance must be determined between areas that are too large (i.e. large matrix computations) versus areas that are too small (i.e. “many” single-noded domains). Moreover, the connections between the domains should, at least locally, be chosen to optimize data flow and connectivity: we address this in three ways. First, tools from persistent homology are given to understand underlying structures, reminiscent of hierarchies in the Internet Protocol (IP) addressing. Second, we construct a notion of temporal graph curvature based on network geometry to analyze flows induced by dynamical processes on these networks. Finally, Schrodinger Bridges, a tool arising from statistical physics, are proposed as a method of constructing flows on time-evolving networks with desirable properties such as speed, robustness, and load sensitivity. We construct an approach to temporal hypergraphs to simultaneously model unicast, multicast, and broadcast, using the language of scheme theory, and then consider DTN network coding as a way to achieve network-level computation and organization. The paper concludes with a discussion and ideas for future work.

Alan Hylton↗
DOE OSTI2025

Evaluation of Flow Routing on the Unstructured Voronoi Meshes in Earth System Modeling

Flow routing is a fundamental process of Earth System Models' (ESMs) river component. Traditional flow routing models rely on Cartesian rectangular meshes, which exhibit limitations, particularly when coupled with unstructured mesh-based ocean components. They also lack the support for regionally refined models. While previous studies have highlighted the potential benefits of unstructured meshes for flow routing, their widespread application and comprehensive evaluation within ESMs remain limited. This study extends the river component of the Energy Exascale Earth System Model to unstructured Voronoi meshes. We evaluated the model's performance in simulating river discharge and water depth across three watersheds spanning the Arctic, temperate, and tropical regions. The results show that while providing several benefits, unstructured mesh-based flow routing can achieve comparable performance to structured mesh-based routing, and their difference is often less than 10%. Although the unstructured mesh-based method could address several existing limitations, this research also shows that additional improvements in the numerical method are needed to fully exploit the advantages of unstructured mesh for hydrologic and ESMs.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Discrete global grid system-based flow routing datasets in the Amazon and Yukon basins

Abstract. Discrete global grid systems (DGGS) are emerging spatial data structures widely used to organize geospatial datasets across scales. While DGGS have found applications in various scientific disciplines, including atmospheric science and ecology, their integration into physically based hydrological models and Earth system models (ESMs) has been hindered by the lack of flow routing datasets based on DGGS. In response to this gap, this study pioneers the development of new flow routing datasets using icosahedral Snyder equal-area (ISEA) DGGS and a novel mesh-independent flow direction model. We present flow routing datasets for two large basins, the tropical Amazon River basin and the Arctic Yukon River basin. These datasets (1) facilitate the adoption of DGGS for hydrological models and (2) provide flow routing inputs for evaluation of DGGS-based flow routing in the Amazon and Yukon river basins. The data are available at https://doi.org/10.5281/zenodo.8377765 (Liao, 2023).

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS2016

Toward a Unified Routing Framework for Delay-Tolerant Networking

Routing in Delay-/Disruption-Tolerant Networking (DTN) has long been recognized as a challenging research topic. The difficulty lies in the fact that link intermittency and network partitioning, possibly coupled with long delays, prevent the use of Internet solutions based on an up-to-date comprehensive knowledge of network topology, as communicated by routing protocols. In the literature on DTN routing, there is a dichotomy between solutions designed for deterministic (e.g., space flight) networks, such as Contact Graph Routing (CGR), and the wide variety of protocols designed for opportunistic terrestrial networks. After a discussion of the origin and motivations of this duality, the paper presents an opportunistic extension of CGR (OCGR). The aim is to try to resolve the DTN routing dichotomy by providing a unified approach suitable for all DTN environments.

Routing↗
DOE OSTI2022

Routes and rates of bacterial dispersal impact surface soil microbiome composition and functioning

Abstract Recent evidence suggests that, similar to larger organisms, dispersal is a key driver of microbiome assembly; however, our understanding of the rates and taxonomic composition of microbial dispersal in natural environments is limited. Here, we characterized the rate and composition of bacteria dispersing into surface soil via three dispersal routes (from the air above the vegetation, from nearby vegetation and leaf litter near the soil surface, and from the bulk soil and litter below the top layer). We then quantified the impact of those routes on microbial community composition and functioning in the topmost litter layer. The bacterial dispersal rate onto the surface layer was low (7900 cells/cm2/day) relative to the abundance of the resident community. While bacteria dispersed through all three routes at the same rate, only dispersal from above and near the soil surface impacted microbiome composition, suggesting that the composition, not rate, of dispersal influenced community assembly. Dispersal also impacted microbiome functioning. When exposed to dispersal, leaf litter decomposed faster than when dispersal was excluded, although neither decomposition rate nor litter chemistry differed by route. Overall, we conclude that the dispersal routes transport distinct bacterial communities that differentially influence the composition of the surface soil microbiome.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Sea ice evolution along the Northern Sea Route and implications for trans-Arctic shipping from 2021 through 2060

Arctic surface temperatures warmed at twice the global average in the second half of the 20 th century due to Arctic amplification (AA), a phenomenon predominantly caused by regional polar changes, like the melting of perennial sea ice and reduced sea ice extent (leading to more solar radiation being absorbed by the ocean surface as opposed to being reflected back to space by the ice surface). AA is projected to reach a factor of three even if the climate is stabilized by the mid 21 st century by reduced greenhouse gas emissions. In all emissions scenarios, AA is projected to lead to temperature changes at least 2.4 times larger than global mean surface temperature changes occurring between 2070 and 2100. The ice-albedo feedback, which occurs when the polar-marine surface absorbs more radiation as highly reflective sea ice melts, is reversible such that the premise of a runaway process is no longer accepted as a realistic possibility. No matter what actions are taken to reduce CO 2 concentrations in the atmosphere from now on, two different methods of predicting an ice-free Arctic suggest that perennial sea ice will mostly disappear in September by the year 2050. If there is no reduction in anthropogenic CO 2 and methane emissions, that scenario could occur sooner than 2030. Defining Arctic navigability as safe and economic passage of Polar Class 7 cargo ships without need of an escorting icebreaker, no single trans Arctic ship route will be navigable year-round in the first half of the 21 st century, including in the strong emission scenarios. However, seasonal trans-Arctic navigability will increase this century. An estimate on the number of days per year that the Northern See Route (NSR) will be navigable in the future is beyond the scope of this report. Along Northern Sea Routes 5 and 6, which run close to the Russian coast and Yamal LNG plant, an ARC 7 ice class LNG tanker, the equivalent of a Polar Class 3 (PC3) vessel, will be at low risk in December through April at some point during the current decade. May will continue to entail some risk (more than April) along relatively short segments of these routes through the end of the next decade (2030-2039). Come June, snow rapidly melts away, and thereafter the underlying sea ice begins becomes thinner and less concentrated, greatly reducing risk. However, neither path is desirable for ARC 7 tankers due to shallow bathymetry in Sannikov Strait, and a more desirable path for these ships passes to the north of the New Siberian Islands (route 20, discussed further below). Conventional LNG tankers (i.e., non-ice-strengthened vessels according to the IMO classification), without icebreaker escorts, will continue to encounter dangerous or impassable conditions along many sections of the NSR through the end of this decade for many months of the year. Through 2039, these conventional tankers will be able to operate safely along NSR 6 from August through October. By 2040-2049, the span of safe operation increases to August through November, and by 2050-2059 it increases to July through November, assuming a northward deviation to avoid the Sannikov Strait.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Effect of realistic routing on the social burden metric

The distance people travel to reach critical services is a key input to the Social Burden metric used by Sandia’s Resilient Node Cluster Analysis Tool (ReNCAT) in the optimization’s objective function. By default, ReNCAT utilizes Euclidian distances between population blocks and critical facilities when calculating Social Burden. However, these straight-line distances do not reflect how most residents or goods would travel throughout the area. As distance is a vital input to the burden calculation, a more realistic distance calculation will yield more realistic burden values. This work uses real road networks and calculates the shortest distance path between population centers and critical facilities using a standard graph theory approach. These realistic route distances are then used to compute Social Burden for four areas of study. It was found that distances using real road routes are generally, but not always, longer than the Euclidean distance. The increased length increases the final Social Burden metric, however, the overall burden percent change ranged between 17% and 52%, which means the impact of realistic routes relies heavily upon the area’s road topology. It was found that rural locations within an area may have larger burden increases than urban areas as more dense road networks allow routes to more closely follow a straight-line path. Additionally, using the most straight forward routing algorithms requires high computational effort for areas with large road networks. While it is believed this process can be made more performant, that task is beyond this scope of work.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2024

Enhancing Acute Migraine Treatment: Exploring Solid Lipid Nanoparticles and Nanostructured Lipid Carriers for the Nose-to-Brain Route

Migraine has a high prevalence worldwide and is one of the main disabling neurological diseases in individuals under the age of 50. In general, treatment includes the use of oral analgesics or non-steroidal anti-inflammatory drugs (NSAIDs) for mild attacks, and, for moderate or severe attacks, triptans or 5-HT1B/1D receptor agonists. However, the administration of antimigraine drugs in conventional oral pharmaceutical dosage forms is a challenge, since many molecules have difficulty crossing the blood-brain barrier (BBB) to reach the brain, which leads to bioavailability problems. Efforts have been made to find alternative delivery systems and/or routes for antimigraine drugs. In vivo studies have shown that it is possible to administer drugs directly into the brain via the intranasal (IN) or the nose-to-brain route, thus avoiding the need for the molecules to cross the BBB. In this field, the use of lipid nanoparticles, in particular solid lipid nanoparticles (SLN) and nanostructured lipid carriers (NLC), has shown promising results, since they have several advantages for drugs administered via the IN route, including increased absorption and reduced enzymatic degradation, improving bioavailability. Furthermore, SLN and NLC are capable of co-encapsulating drugs, promoting their simultaneous delivery to the site of therapeutic action, which can be a promising approach for the acute migraine treatment. This review highlights the potential of using SLN and NLC to improve the treatment of acute migraine via the nose-to-brain route. First sections describe the pathophysiology and the currently available pharmacological treatment for acute migraine, followed by an outline of the mechanisms underlying the nose-to-brain route. Afterwards, the main features of SLN and NLC and the most recent in vivo studies investigating the use of these nanoparticles for the treatment of acute migraine are presented.

Torres, Joana (ORCID:0000000327276229)↗
NASA NTRS1987

Automatic routing module

Automatic Routing Module (ARM) is a tool to partially automate Air Launched Cruise Missile (ALCM) routing. For any accessible launch point or target pair, ARM creates flyable routes that, within the fidelity of the models, are optimal in terms of threat avoidance, clobber avoidance, and adherence to vehicle and planning constraints. Although highly algorithmic, ARM is an expert system. Because of the heuristics applied, ARM generated routes closely resemble manually generated routes in routine cases. In more complex cases, ARM's ability to accumulate and assess threat danger in three dimensions and trade that danger off with the probability of ground clobber results in the safest path around or through difficult areas. The tools available prior to ARM did not provide the planner with enough information or present it in such a way that ensured he would select the safest path.

Malin, Janice A.↗
NASA NTRS1987

Route planning in a four-dimensional environment

Robots must be able to function in the real world. The real world involves processes and agents that move independently of the actions of the robot, sometimes in an unpredictable manner. A real-time integrated route planning and spatial representation system for planning routes through dynamic domains is presented. The system will find the safest most efficient route through space-time as described by a set of user defined evaluation functions. Because the route planning algorthims is highly parallel and can run on an SIMD machine in O(p) time (p is the length of a path), the system will find real-time paths through unpredictable domains when used in an incremental mode. Spatial representation, an SIMD algorithm for route planning in a dynamic domain, and results from an implementation on a traditional computer architecture are discussed.

Slack, M. G.↗
NASA NTRS1990

Depth-first search approach for fault-tolerant routing in hypercube multicomputers

Using depth-first search, the authors develop and analyze the performance of a routing scheme for hypercube multicomputers in the presence of an arbitrary number of faulty components. They derive an exact expression for the probability of routing messages by way of optimal paths (of length equal to the Hamming distance between the corresponding pair of nodes) from the source node to an obstructed node. The obstructed node is defined as the first node encountered by the message that finds no optimal path to the destination node. It is noted that the probability of routing messages over an optimal path between any two nodes is a special case of the present results and can be obtained by replacing the obstructed node with the destination node. Numerical examples are given to illustrate the results, and they show that, in the presence of component failures, depth-first search routing can route a message to its destination by means of an optimal path with a very high probability.

Chen, Ming-Syan↗