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.

SourceResearch connectionFrom yearThrough year

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

At least 163 records · Page 9

All sources NASA NTRS DOE OSTI

NASA NTRS1983

A frequency-routed satellite system concept using multiple orthogonally-polarized beams for frequency reuse

The design concepts of a multibeam frequency-division multiplexed satellite system accessed by many moderately sized earth stations are outlined. In the system proposed here, traffic is routed from beam to beam through appropriate apportionment and filtering. Within a beam, the routing to particular users is achieved by conventional FDM. The optimum beam size, beam isolation, orthogonal polarization assignment to beams, the concept of beam groups yielding a simple transponder design, and the establishment of a frequency plan providing interference-free band assignments are discussed.

Rotholz, E.↗

NASA NTRS1986

Hybrid routing technique for a fault-tolerant, integrated information network

The evolutionary growth of the space station and the diverse activities onboard are expected to require a hierarchy of integrated, local area networks capable of supporting data, voice, and video communications. In addition, fault-tolerant network operation is necessary to protect communications between critical systems attached to the net and to relieve the valuable human resources onboard the space station of time-critical data system repair tasks. A key issue for the design of the fault-tolerant, integrated network is the development of a robust routing algorithm which dynamically selects the optimum communication paths through the net. A routing technique is described that adapts to topological changes in the network to support fault-tolerant operation and system evolvability.

Meredith, B. D.↗

NASA NTRS1987

Bendable Routing Tool

Tool extends routing bit into internal cavities or passages so burrs and similar defects removed. Bent so inserted through curving channels. Copper sheath gives stiffness to flexible shaft but can itself be bent. Several types of routing bits attached to shaft.

Mayer, Walter↗

NASA NTRS1987

A parallel algorithm for channel routing on a hypercube

A new parallel simulated annealing algorithm for channel routing on a P processor hypercube is presented. The basic idea used is to partition a set of tracks equally among processors in the hypercube. In parallel, P/2 pairs of processors perform displacements and exchanges of nets between tracks, compute the changes in cost functions, and accept moves using a parallel annealing criteria. Through the use of a unique distributed data structure, it is possible to minimize message traffic and add versatility and efficiency in a parallel routing tool. The algorithm has been implemented and is being tested on some of the popular channel problems from the literature.

Brouwer, Randall↗

NASA NTRS1988

The prediction of en route noise levels for a DC-9 aircraft

En route noise for advanced propfan powered aircraft has become an issue of concern for the Federal Aviation Administration. The NASA Aircraft Noise Prediction Program (ANOPP) is used to demonstrate the source noise and propagation effects for an aircraft in level flight up to 35,000 feet altitude. One-third octave band spectra of the source noise, atmospheric absorption loss, and received noise are presented. The predicted maximum A-weighted sound pressure level is compared to measured data from the Aeronautical Research Institute of Sweden. ANOPP is shown to be an effective tool in evaluating the en route noise characteristics of a DC-9 aircraft.

Weir, Donald S.↗

NASA NTRS1988

Message routing in an injured hypercube

A distributed fault-tolerant routing scheme for an injured hypercube multicomputer is described. The scheme is based on the topology of the hypercube, and it requires each node to possess only the information on the failure of its own links. A rigorous analysis of the scheme shows that it is not only capable of routing messages successfully in an injured Q(n) when the number of component failures is less than n, but can also choose a shortest path with a very high probability.

Chen, Ming-Syan↗

NASA NTRS1989

Message routing in HARTS with faulty components

It is important to design a distributed system which is capable of delivering messages even in the presence of faulty components between their source and destination nodes. A routing scheme is developed in two steps for a wrapped hexagonal mesh, called HARTS (Hexagonal Architecture for Real-Time Systems), which assures the delivery of every message as long as there is a path between its source and destination. The proposed scheme can also detect the nonexistence of path between a pair of nodes in a finite amount of time. Moreover, the scheme requires each node in HARTS to know only the state (faulty or not) of each of its own links. The performance of the simple routing scheme is simulated for 3- and 5-dimensional H-meshes while varying the physical distribution of faulty components. It is shown that a shortest path between the source and destination of each message is taken with a high probability and a path, if it exists, is usually found very quickly.

Olson, Alan↗

NASA NTRS1990

A conflict analysis of 4D descent strategies in a metered, multiple-arrival route environment

A conflict analysis was performed on multiple arrival traffic at a typical metered airport. The Flow Management Evaluation Model (FMEM) was used to simulate arrival operations using Denver Stapleton's arrival route structure. Sensitivities of conflict performance to three different 4-D descent strategies (clear-idle Mach/Constant AirSpeed (CAS), constant descent angle Mach/CAS and energy optimal) were examined for three traffic mixes represented by those found at Denver Stapleton, John F. Kennedy and typical en route metering (ERM) airports. The Monte Carlo technique was used to generate simulation entry point times. Analysis results indicate that the clean-idle descent strategy offers the best compromise in overall performance. Performance measures primarily include susceptibility to conflict and conflict severity. Fuel usage performance is extrapolated from previous descent strategy studies.

Izumi, K. H.↗

NASA NTRS1990

A parallel algorithm for global routing

A Parallel Hierarchical algorithm for Global Routing (PHIGURE) is presented. The router is based on the work of Burstein and Pelavin, but has many extensions for general global routing and parallel execution. Main features of the algorithm include structured hierarchical decomposition into separate independent tasks which are suitable for parallel execution and adaptive simplex solution for adding feedthroughs and adjusting channel heights for row-based layout. Alternative decomposition methods and the various levels of parallelism available in the algorithm are examined closely. The algorithm is described and results are presented for a shared-memory multiprocessor implementation.

Brouwer, Randall J.↗

NASA NTRS1990

Agenda toward the development of a rational noise descriptor system relevant to human annoyance by en route aircraft noise

A rational, internationally consistent, noise descriptor system is needed to express existing and predicted en route aircraft noise levels in terms closely correlated to the annoyance perceived by people and physiologically identifiable in people, to provide guidance for aircraft and powerplant design, flight management, land-use planning, and building codes. Expanding on previous discussions, a new comprehensive statement of the specific questions that must be resolved by needed research, and the nature and quality of proof that must be adduced to justify further steps toward the drafting and adoption of new international en route aircraft-noise standards is sought. The single noise-descriptor system envisioned must be valid for widely varying aircraft-noise frequency spectra, including time-variant components and agreeable and disagreeable discrete tones and combinations of tones. The measures and criteria established by the system must be valid at high and low immission levels, at high and low ambient noise levels, for great and small number of noise events, and outdoors and indoors.

Garbell, Maurice A.↗

NASA NTRS1991

Planning The Route Of A Robotic Land Vehicle

Algorithm enables experimental robotic land vehicle to follow automatically route computed on basis of terrain-height-map data. Computer executing algorithm merges coarser global topographical data with finer local topographical data obtained through stereoscopic video system as vehicle moves along, then smoothes merged elevation map, interpolates map to evenly-horizontally-spaced grid points, and differentiates map to produce data on slopes and roughness for use in calculations of traversability and optimum route(s). Distance traveled minimized to extent possible consistent with avoidance of obstacles.

Gennery, Donald B.↗

NASA NTRS1991

Flood routing of the Maja outflow across Xanthe Terra

The object is to trace a single flood crest through the Maja outflow system and to evaluate the effects of topography on ponding and multiple channel routing. Maja Valles provides a good model because it has a single source and a well defined channel system. The 1500 km long Maja Valles originates in Juventae Chasma. The outflow system stretches 1100 km northward along the Lunae Planum/Xanthe Terra boundary, then eastward across the Xanthe Terra highlands. It descends to Chryse Planitia where it extends northeastward toward the middle of the basin. It is concluded that flood routing through multiple channels and retardation in local impoundments are responsible for breakup of the initial flood crest and the formation of multiple flood crests. Recombined flow near the mouths of these canyons results in an extended flow regime and multiple flood surges. As a result of ponding along the flood course, depositional sites are localized and renewed erosion downstream (from ponded sites) results in sediment source areas not greatly removed from depositional sites.

Dehon, R. A.↗

NASA NTRS1922

Laying Out of a Practical Air Route

Unfortunately the problem of laying out an air route has been approached by all who give it consideration as one of the hardest tasks in the world. Whereas, as a matter of fact, a very serviceable air route can be laid out with an absolute minimum of ground work.

Miner, V S↗

NASA NTRS1995

Effect of Processing Route on Strain Controlled Low Cycle Fatigue Behavior of Polycrystalline NiAl

The present investigation examines the effects of manufacturing process on the total axial strain controlled low cycle fatigue behavior of polycrystalline NiAl at 1000 K, a temperature above the monotonic Brittle-to-Ductile Transition Temperature (BDTT). The nickel aluminide samples were produced by three different processing routes: hot isostatic pressing of pre- alloyed powders, extrusion of prealloyed powders, and extrusion of vacuum induction melted ingots. The LCF behavior of the cast plus extruded material was also determined at room temperature (below the BD77) for comparison to the high temperature data. The cyclic stress response, cyclic stress-strain behavior, and strain-life relationships were influenced by the alloy preparation technique and the testing temperature. Detailed characterization of the LCF tested samples was conducted by optical and electron microscopy to determine the variations in fracture and deformation modes and to determine any microstructural changes that occurred during LCF testing. The dependence of LCF properties on processing route was rationalized on the basis of starting microstructure, brittle-to-ductile transition temperature, deformation induced changes in the basic microstructure, deformation substructure, and synergistic interaction between the damage modes.

Rao, K. Bhanu Sankara↗

NASA NTRS1992

Multicast Routing of Hierarchical Data

The issue of multicast of broadband, real-time data in a heterogeneous environment, in which the data recipients differ in their reception abilities, is considered. Traditional multicast schemes, which are designed to deliver all the source data to all recipients, offer limited performance in such an environment, since they must either force the source to overcompress its signal or restrict the destination population to those who can receive the full signal. We present an approach for resolving this issue by combining hierarchical source coding techniques, which allow recipients to trade off reception bandwidth for signal quality, and sophisticated routing algorithms that deliver to each destination the maximum possible signal quality. The field of hierarchical coding is briefly surveyed and new multicast routing algorithms are presented. The algorithms are compared in terms of network utilization efficiency, lengths of paths, and the required mechanisms for forwarding packets on the resulting paths.

Shacham, Nachum↗

NASA NTRS2000

Adaptivity in Agent-Based Routing for Data Networks

Adaptivity, both of the individual agents and of the interaction structure among the agents, seems indispensable for scaling up multi-agent systems (MAS s) in noisy environments. One important consideration in designing adaptive agents is choosing their action spaces to be as amenable as possible to machine learning techniques, especially to reinforcement learning (RL) techniques. One important way to have the interaction structure connecting agents itself be adaptive is to have the intentions and/or actions of the agents be in the input spaces of the other agents, much as in Stackelberg games. We consider both kinds of adaptivity in the design of a MAS to control network packet routing. We demonstrate on the OPNET event-driven network simulator the perhaps surprising fact that simply changing the action space of the agents to be better suited to RL can result in very large improvements in their potential performance: at their best settings, our learning-amenable router agents achieve throughputs up to three and one half times better than that of the standard Bellman-Ford routing algorithm, even when the Bellman-Ford protocol traffic is maintained. We then demonstrate that much of that potential improvement can be realized by having the agents learn their settings when the agent interaction structure is itself adaptive.

Wolpert, David H.↗

NASA NTRS2000

User's Guide for Computer Program that Routes Signal Traces

This disk contains both a FORTRAN computer program and the corresponding user's guide that facilitates both its incorporation into your system and its utility. The computer program represents an efficient algorithm that routes signal traces on layers of a printed circuit with both through-pins and surface mounts. The computer program included is an implementation of the ideas presented in the theoretical paper titled "A Formal Algorithm for Routing Signal Traces on a Printed Circuit Board", NASA TP-3639 published in 1996. The computer program in the "connects" file can be read with a FORTRAN compiler and readily integrated into software unique to each particular environment where it might be used.

Hedgley, David R., Jr.↗

NASA NTRS2001

Theoretical Studies of Possible Synthetic Routes for the High Energy Density Material Td N4: Excited Electronic States

Vertical electronic excitation energies for single states have been computed for the high energy density material (HEDM) Td N4 in order to assess possible synthetic routes that originate from excited electronic states of N2 molecules. Several ab initio theoretical approaches have been used, including complete active space self-consistent field (CASSCF), state averaged CASSCF (SA-CASSCF), singles configuration interaction (CIS), CIS with second-order and third-order correlation corrections [CIS(D)) and CIS(3)], and linear response singles and doubles coupled-cluster (LRCCSD), which is the highest level of theory employed. Standard double zeta polarized (DZP) and triple zeta double polarized (TZ2P) one-particle basis sets were used. The CASSCF calculations are found to overestimate the excitation energies, while the SA-CASSCF approach rectifies this error to some extent, but not completely. The accuracy of the CIS calculations varied depending on the particular state, while the CIS(D), CIS(3), and LRCCSD results are in generally good agreement. Based on the LRCCSD calculations, the lowest six excited singlet states are 9.35(l(sup)T1), 10.01(l(sup)T2), 10.04(1(sup)A2), 10.07(1(sup)E), 10.12(2(sup)T1), and 10.42(2(sup)T2) eV above the ground state, respectively. Comparison of these excited state energies with the energies of possible excited states of N2+N2 fragments, leads us to propose that the most likely synthetic route for Td N4 involving this mechanism arises from combination of two bound quintet states of N2.

Lee, Timothy J.↗