Search NASA⌕ Search

SEARCH · Search NASA

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
NASA NTRS2010

En Route Air Traffic Control Input Devices for the Next Generation

The purpose of this study was to investigate the usefulness of different input device configurations when trial planning new routes for aircraft in an advanced simulation of the en route workstation. The task of trial planning is one of the futuristic tools that is performed by the graphical manipulation of an aircraft's trajectory to reroute the aircraft without voice communication. In this study with two input devices, the FAA's current trackball and a basic optical computer mouse were evaluated with "pick" button in a click-and-hold state and a click-and-release state while the participant dragged the trial plan line. The trial plan was used for three different conflict types: Aircraft Conflicts, Weather Conflicts, and Aircraft + Weather Conflicts. Speed and accuracy were the primary dependent variables. Results indicate that the mouse conditions were significantly faster than the trackball conditions overall with no significant loss of accuracy. Several performance ratings and preference ratings were analyzed from post-run and post-simulation questionnaires. The release conditions were significantly more useful and likable than the hold conditions. The results suggest that the mouse in the release button state was the fastest and most well liked device configuration for trial planning in the en route workstation. Keywords-input devices, en route, controller, workstation, mouse, trackball, NextGen

Mainini, Matthew J.↗
NASA NTRS2010

A Computer Simulation of the System-Wide Effects of Parallel-Offset Route Maneuvers

Most aircraft managed by air-traffic controllers in the National Airspace System are capable of flying parallel-offset routes. This paper presents the results of two related studies on the effects of increased use of offset routes as a conflict resolution maneuver. The first study analyzes offset routes in the context of all standard resolution types which air-traffic controllers currently use. This study shows that by utilizing parallel-offset route maneuvers, significant system-wide savings in delay due to conflict resolution of up to 30% are possible. It also shows that most offset resolutions replace horizontal-vectoring resolutions. The second study builds on the results of the first and directly compares offset resolutions and standard horizontal-vectoring maneuvers to determine that in-trail conflicts are often more efficiently resolved by offset maneuvers.

Lauderdale, Todd A.↗
NASA NTRS2013

Contact Graph Routing Enhancements Developed in ION for DTN

The Interplanetary Overlay Network (ION) software suite is an open-source, flight-ready implementation of networking protocols including the Delay/Disruption Tolerant Networking (DTN) Bundle Protocol (BP), the CCSDS (Consultative Committee for Space Data Systems) File Delivery Protocol (CFDP), and many others including the Contact Graph Routing (CGR) DTN routing system. While DTN offers the capability to tolerate disruption and long signal propagation delays in transmission, without an appropriate routing protocol, no data can be delivered. CGR was built for space exploration networks with scheduled communication opportunities (typically based on trajectories and orbits), represented as a contact graph. Since CGR uses knowledge of future connectivity, the contact graph can grow rather large, and so efficient processing is desired. These enhancements allow CGR to scale to predicted NASA space network complexities and beyond. This software improves upon CGR by adopting an earliest-arrival-time cost metric and using the Dijkstra path selection algorithm. Moving to Dijkstra path selection also enables construction of an earliest- arrival-time tree for multicast routing. The enhancements have been rolled into ION 3.0 available on sourceforge.net.

Segui, John S.↗
NASA NTRS2017

A Machine Learning Concept for DTN Routing

This paper discusses the concept and architecture of a machine learning based router for delay tolerant space networks. The techniques of reinforcement learning and Bayesian learning are used to supplement the routing decisions of the popular Contact Graph Routing algorithm. An introduction to the concepts of Contact Graph Routing, Q-routing and Naive Bayes classification are given. The development of an architecture for a cross-layer feedback framework for DTN (Delay-Tolerant Networking) protocols is discussed. Finally, initial simulation setup and results are given.

Delay Tolerant Networks↗
NASA NTRS2018

Air Traffic Management Technology Demonstration - 3 (ATD-3) Multi-Flight Common Route (MFCR) Concept of Operations Version 1.0

NASA's Multi Flight Common Route (MFCR) automation represents one element of those technologies focusing primarily on delay recovery in the en route phase of flight. Delay recovery is an attenuation of flight-time delay, accomplished by periodically revising weather-avoidance routing as the convective weather system evolves. MFCR is intended for use by Traffic Management Coordinators (TMCs) in Air Route Traffic Control Centers (ARTCCs, or Centers) and traffic management specialists (TMSs) in the Air Traffic Control System Command Center (ATCSCC). MFCR leverages existing weather, airspace, and traffic data, as well as improvements in navigation, surveillance, communication, and digital information technologies, to build on existing ATM automation and address some of the shortcomings associated with strategic traffic flow management initiatives and weather forecasting uncertainties. These capabilities provide significant potential benefits in the form of time, fuel, and cost savings. The concept of operations described in this document describes MFCR functionality as delivered by NASA to the FAA in December 2017, including a list of potential enhancements that may be realized when the system is fielded.

conops↗
NASA NTRS2014

Development of a Route Crossing Tool for Shared Airspace Environments

In current-day Terminal Radar Approach Control (TRACON) operations, departure and arrival controllers maintain separate and dedicated airspace for their respective traffic flows. Although this practice has obvious safety features, it also leads to inefficiencies; for example, departure aircraft may be routinely capped beneath arrival airspace. With the right decision-support and coordination tools, departures could continue to climb through arrival airspace when sufficient gaps exist. Previous studies of ‘shared airspace’ have examined pre-arranged coordination procedures, as well as tools that gave feedback to the controllers on where gaps between arrivals were located and whether the departure aircraft could be scheduled to fly through those gaps [1, 2, 3, 4]. Since then, the Route Crossing Tool (RCT) has been developed to allow controllers to assess multiple pre-defined route options at points where the arrivals and departures cross, thereby increasing the possibility of climbing a departure through an arrival gap.The RCT aids in ensuring lateral separation between departure and arrival aircraft that pass through the same altitude. Since the RCT can be applied tactically, it can enable aircraft to fly through arrival flows even if these aircraft depart outside scheduled times. The RCT makes use of a set of predefined parallel departure routes crossing the arrival flow at equidistant intersecting points on the arrival route. The RCT uses the Estimated Time of Arrival (ETA) of the departure aircraft at each intersecting point to calculate the lateral separation with the neighboring arrivals when it crosses that point; this information is graphically displayed to the controller. Additionally, the RCT incorporates forecast winds in its ETA predictions.Multiple prototypes of the RCT have been iteratively developed with feedback from Subject Matter Experts (SMEs). This paper presents the final design, the design process, and lessons learned. Initial results from a simulation suggest that the tool was successful in helping controllers to safely climb more aircraft. Controller feedback on the tool was also positive.

shared airspace↗
NASA NTRS2019

Application of Machine Learning Techniques to Delay Tolerant Network Routing

This dissertation discusses several machine learning techniques to improve routing in delay tolerant networks (DTNs). These are networks in which there may be long one-way trip times, asymmetric links, high error rates, and deterministic as well as non-deterministic loss of contact between network nodes, such as interplanetary satellite networks, mobile ad hoc networks and wireless sensor networks. This work uses historical network statistics to train a multi-label classifier to predict reliable paths through the network. In addition, a clustering technique is used to predict future mobile node locations. Both of these techniques are used to reduce the consumption of resources such as network bandwidth, memory and data storage that is required by replication routing methods often used in opportunistic DTN environments. Thesis contributions include: an emulation tool chain developed to create a DTN test bed for machine learning, the network and software architecture for a machine learning based routing method, the development and implementation of classification and clustering techniques and performance evaluation in terms of machine learning and routing metrics.

Dudukovich, Rachel M.↗
NASA NTRS2015

Simple Tool for Aircraft Noise-Reduction Route Design

The design of arrival and departure routes from an airport has to balance the conflicting requirements of fuel efficiency, airport capacity utilization and community emission and noise considerations. The commonly used tools for aircraft noise assessment are the FAA’s Integrated Noise Model (INM) and Aviation Environmental Design Tool (AEDT). These tools are suitable to generate precise noise contours. However, they are harder to use with other tools for route design optimization involving evaluation of a large number of aircraft trajectories. A simplified aircraft noise computation tool, named AIRNOISE, is developed for preliminary aircraft noise-reduction route design in this paper. AIRNOISE computes aircraft noise based on the same SAE-AIR-1845 procedures used by INM and AEDT. AIRNOISE does not consider components related to terrain and atmosphere adjustments. As a result, it is not only computationally efficient but also flexible to use for customized aircraft profiles. The aircraft noise results are compared with the FAA’s AEDT2b and show that the level of accuracy achieved by AIRNOISE can be used to reduce the number of route design options to a small number from a large pool for subsequent accurate analysis by INM.

Li, Jinhua↗
NASA NTRS2015

Dynamic Arrival Routes: A Trajectory-Based Weather Avoidance System for Merging Arrivals and Metering

Convective weather can cause arrival traffic to fly less efficient weather avoidance routes and is the primary cause for time-based metering to be discontinued. Dynamic Arrival Routes (DAR) is a trajectory-based weather avoidance system that is designed to help improve arrival traffic flow when weather is present. The DAR system continuously analyzes airborne arrival flights for opportunities to reroute them to more efficient arrival routes or around weather that is predicted to be on their current flight plan early enough to allow the arrival time-based metering system to adjust its times of arrival for the presence of weather. Analysis of 93 hours of actual traffic over 12 different days from Fort Worth Center showed DAR proposed more efficient arrival reroutes for 352 arrival flights for an average time savings of 12.3 minutes per flight at a look-ahead time of 60 minutes from the meter fix. DAR also identified 642 arrival flights with a need to deviate around weather and proposed weather avoidance routes that were analytically shown to remain weather-free 83 percent of the time for a look-ahead time of 30 minutes from the meter fix.

Arrivals↗
DOE OSTI2017

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

Chen, Dong↗
DOE OSTI2022

Verification and Validation of START: A Spent Nuclear Fuel Routing and Decision Support Tool

The Stakeholder Tool for Assessing Radioactive Transportation (START) is a web-based geospatial decision-support tool being developed by the US Department of Energy’s Office of Integrated Waste Management (IWM) to support federal interim storage for spent nuclear fuel (SNF) and associated transportation. START provides many functions for the IWM program including: serving as a communications tool for conveying geospatial data and information, an options analysis tool for exploring potential transport modes and routes for transporting SNF from nuclear power plants to future federal interim storage facilities, an emergency response planning tool for Tribes and States to identify training needs along potential SNF transport corridors, an environmental analysis tool for estimating potential radiation dose exposure from incident-free and incident-case SNF transport conditions, and a systems analysis support tool providing route-related inputs for system throughput analysis. As part of the START development process, a verification and validation (V&V) effort is being undertaken. In the initial V&V phase, several outputs of the START tool were checked such as the total distance, population and population densities within the buffer zone, and incident free dose. The V&V process is fluid as it will be utilized after each version change to ensure that the core functionalities of the tool are maintained and the results are consistent with the previous versions. Efforts have also been put into developing scripts to aid in the process of automating certain sections of the V&V work. As some of the V&V efforts use Environmental Systems Research Institute’s (ESRI) tools upon which the START framework is built, the START data were compared against outputs from tools like Quantum Geographic Information System (QGIS) for buffer zone populations and route lengths to ensure independence of the V&V process. Good agreement was observed between the START results and the independent V&V studies with the majority of the differences falling between 1% and 5% for populations within the buffer zone and route distance. This presentation describes the development and design of the START tool, V&V methods employed for various metrics of interest and their respective results, and future plans.

START, transportation, GIS, V&V↗
DOE OSTI2023

Fort Erie Case Study - Transition from Fixed-Route to On-Demand Transit

Rural and smaller-sized communities in North America face unique mobility challenges due to their low population density, lower public transit spending per capita compared to major cities, and a high reliance on private vehicles. In recent years, communities such as Fort Erie, Ontario, have restructured or advanced their public transit systems using on-demand services. Fort Erie is a relatively sparsely populated region of 32,901 residents, spread across a land area of 166 square kilometers (64 square miles), for an average population density of 193 residents per square kilometer (500 per square mile). In October 2021, the town implemented a mobility-on-demand system integrated with smartphone software to replace its fixed-route community bus system, which consisted of four buses with three routes, each with a roughly 1-hour, one-way loop. The new service utilizes a fleet of six minivans, two of which are retrofitted with wheelchair-accessible ramps. The system may require that a passenger requesting a standard van walk up to 400 meters (a quarter mile) to their pickup location to optimize vehicle routing while providing origin-to-destination service. The on-demand system proved effective in providing service, eclipsing pre-pandemic ridership by 40%, decreasing greenhouse gas emissions per ride by 63%, and decreasing the cost to the town per ride by 29%. This report documents both the previous system and the new system in terms of routes, ridership, costs, fuel, and other notable system parameters. This work is part of an ongoing series of case studies on providing small communities with on-demand, right-sized vehicle service coupled with a smartphone application.

ADVANCED PROPULSION SYSTEMS,ENERGY PLANNING, POLIC↗
DOE OSTI2023

Secure eco-routing with databases under homomorphic encryption

A method for generating energy-optimized travel routes for a motor vehicle includes one or more of the following: receiving an origin destination (OD) of the motor vehicle and an encrypted energy consumption database of the motor vehicle; generating N candidate routes for the OD; evaluating encrypted energy consumption over a route using an encrypted energy consumption database; applying at least one of homomorphic addition function or homomorphic multiplication function to the encrypted energy consumption data; and returning N candidate routes and their encrypted energy consumption to a client.

Hegde, Bharatkumar↗
DOE OSTI2017

Routing Options for Transporting Commercial Spent Nuclear Fuel in the Continental United States - 17504

The U.S. Department of Energy (DOE) has a goal to develop solutions for the long-term, sustainable management of the nation's spent nuclear fuel and high-level radioactive waste. The DOE is planning for an integrated waste management system to transport, store, and dispose of spent nuclear fuel and high-level radioactive waste from commercial electricity generation, as well national defense activities. The DOE Office of Nuclear Energy (DOE-NE), Office of Spent Fuel and Waste Disposition's (SFWD) Integrated Waste Management (IWM) program is applying integrated waste management system analysis, system engineering, and decision analysis principles to inform future decisions regarding potential future nuclear waste management system architectures. Integrated waste management system architecture analyses are being conducted to support the future deployment of a comprehensive system for managing nuclear waste that considers all aspects of the back-end of the nuclear fuel cycle (transportation, storage, and disposal). One aspect of a potential future nuclear waste management system is transportation of spent nuclear fuel from the fleet of commercial nuclear reactors to destinations where waste management facilities, such as an interim storage facility, would be located. Example rail transportation routes from commercial nuclear reactor sites to various locations in the continental U.S. - chosen as hypothetical locations for future waste management system facilities - were evaluated in 2014 using DOE's GIS-based Stakeholder Tool for Assessing Radioactive Transportation (START). The objective of that evaluation was to identify and parameterize generic transportation routes for use in integrated waste management system analyses, the associated uncertainty in these selections, and the uncertainty associated with different transportation route selection criteria. The analysis presented herein considers rail transportation routes from commercial nuclear reactor sites to hypothetical destinations within the continental U.S. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗