Search NASA⌕ Search

SEARCH · Search NASA

Results for “routing problems”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

The effect of model uncertainty on some optimal routing problems

The effect of model uncertainties on optimal routing in a system of parallel queues is examined. The uncertainty arises in modeling the service time distribution for the customers (jobs, packets) to be served. For a Poisson arrival process and Bernoulli routing, the optimal mean system delay generally depends on the variance of this distribution. However, as the input traffic load approaches the system capacity the optimal routing assignment and corresponding mean system delay are shown to converge to a variance-invariant point. The implications of these results are examined in the context of gradient-based routing algorithms. An example of a model-independent algorithm using online gradient estimation is also included.

Mohanty, Bibhu↗
NASA NTRS1974

An algorithm for a general class of routing problems derived from Huygens' principle

If a set of N points or nodes with a nonnegative cost associated with each ordered pair is known, it is desired to find a path from one given node to another given node which minimizes the cost sum. An algorithm is presented which yields a global minimum solution after at most N - 1 iterations or on a typical large third-generation computer, after 1 hour of computation time for a 10,000-node problem. The rapid-access data storage capacity demanded by the algorithm is approximately 3N words for costs read in from slow-access storage or 2N words for calculable costs. The time-storage requirements of the algorithm known to the authors. When the problem is viewed as a discretized optimal control problem, after N-1 iterations, an optimal control or node transition is established for each of the N nodes or states; thus, the algorithm can be applied to situations were there may be errors in the control that necessitate a closed loop control that necessitate a closed loop control philosophy.

Avis, L. M.↗
NASA NTRS1991

Parallel algorithms for placement and routing in VLSI design

The computational requirements for high quality synthesis, analysis, and verification of very large scale integration (VLSI) designs have rapidly increased with the fast growing complexity of these designs. Research in the past has focused on the development of heuristic algorithms, special purpose hardware accelerators, or parallel algorithms for the numerous design tasks to decrease the time required for solution. Two new parallel algorithms are proposed for two VLSI synthesis tasks, standard cell placement and global routing. The first algorithm, a parallel algorithm for global routing, uses hierarchical techniques to decompose the routing problem into independent routing subproblems that are solved in parallel. Results are then presented which compare the routing quality to the results of other published global routers and which evaluate the speedups attained. The second algorithm, a parallel algorithm for cell placement and global routing, hierarchically integrates a quadrisection placement algorithm, a bisection placement algorithm, and the previous global routing algorithm. Unique partitioning techniques are used to decompose the various stages of the algorithm into independent tasks which can be evaluated in parallel. Finally, results are presented which evaluate the various algorithm alternatives and compare the algorithm performance to other placement programs. Measurements are presented on the parallel speedups available.

Brouwer, Randall Jay↗
NASA NTRS1977

Advances in optimal routing through computer networks

The optimal routing problem is defined. Progress in solving the problem during the previous decade is reviewed, with special emphasis on technical developments made during the last few years. The relationships between the routing, the throughput, and the switching technology used are discussed and their future trends are reviewed. Economic aspects are also briefly considered. Modern technical approaches for handling the routing problems and, more generally, the flow control problems are reviewed.

Paz, I. M.↗
NASA NTRS2000

Problem Definition and Solution Concept for En Route Constrained Airspace Problems

NASA's AATT Program is investigating potential ground-based decision support tool (DST) development for en route controllers and managers. NASA's previous work in en route DST development has focused on Transition airspace, where aircraft are impacted by constraints associated with the transition of aircraft from en route to terminal airspace. This paper investigates the problems associated with aircraft in non-transitional en route airspace, termed Constrained Airspace. A literature search was performed to catalog previously identified constrained airspace problems. The results of this search were investigated with industry representatives to validate these problems were significant in constrained airspace. Three general problem areas were identified. The first problem area involves negative impacts caused by a loss of airspace (e.g., activation of Special Use Airspace (SUA), weather cell formation, and overloaded sectors). The second problem area is the lack of identifying and taking advantage of gained airspace (e.g., SUA deactivation, weather dissipation, and sector loading reductions). The third problem area is unforeseen negative impacts caused by the acceptance of user routing requests (e.g., a route change into an area of congestion that negated the users intended benefit). Based upon the problems identified, an operational concept was developed for a DST to help handle these problems efficiently. The goal is to strategically identify constrained airspace problems and to provide functionality to support ARTCC TMUs in resolving the identified impacts. The capability lends itself well to TMU and Airline Operations Center (AOC) collaboration.

Green, Steven↗
NASA NTRS1990

On well-partial-order theory and its application to combinatorial problems of VLSI design

We nonconstructively prove the existence of decision algorithms with low-degree polynomial running times for a number of well-studied graph layout, placement, and routing problems. Some were not previously known to be in p at all; others were only known to be in p by way of brute force or dynamic programming formulations with unboundedly high-degree polynomial running times. Our methods include the application of the recent Robertson-Seymour theorems on the well-partial-ordering of graphs under both the minor and immersion orders. We also briefly address the complexity of search versions of these problems.

Fellows, M.↗
NASA NTRS1993

Isomorphic routing on a toroidal mesh

We study a routing problem that arises on SIMD parallel architectures whose communication network forms a toroidal mesh. We assume there exists a set of k message descriptors (xi, yi), where (xi, yi) indicates that the ith message's recipient is offset from its sender by xi hops in one mesh dimension, and yi hops in the other. Every processor has k messages to send, and all processors use the same set of message routing descriptors. The SIMD constraint implies that at any routing step, every processor is actively routing messages with the same descriptors as any other processor. We call this isomorphic routing. Our objective is to find the isomorphic routing schedule with least makespan. We consider a number of variations on the problem, yielding complexity results from O(k) to NP-complete. Most of our results follow after we transform the problem into a scheduling problem, where it is related to other well-known scheduling problems.

Mao, Weizhen↗
NASA NTRSDate not supplied

Deep Reinforcement Learning based Routing in an Air-to-Air Ad-hoc Network

This paper studies the Multiple Sources and Multiple Destinations (MSMD) routing problem in a dynamic Air-to-Air Ad-hoc Network (AAAN). We consider a spectrum limited scenario where multiple links have to share the same frequency channel so that co-channel interference becomes inevitable. As a result, routing decisions and spectrum access are coupled and must be jointly considered. This paper proposes a deep Q-learning based algorithm to find an optimal routing and channel selection strategy that minimizes the end-to-end communication delay. Specifically, under the assumption that only local information is available to every node, the Deep Q-Network (DQN) is trained offline to learn the optimal routing and channel selection strategy. After the trained DQN is implemented in every node, multiple relay nodes can simultaneously determine their next-hop relay and channel selections in real-time. Simulation results demonstrate the efficacy of our proposed algorithm.

AAAN↗
NASA NTRSDate not supplied

Deep Reinforcement Learning based Routing in an Air-to-Air Ad-hoc Network

This paper studies the Multiple Sources and Multiple Destinations (MSMD) routing problem in a dynamic Air-to-Air Ad-hoc Network (AAAN). We consider a spectrum limited scenario where multiple links have to share the same frequency channel so that co-channel interference becomes inevitable. As a result, routing decisions and spectrum access are coupled and must be jointly considered. This paper proposes a deep Q-learning based algorithm to find an optimal routing and channel selection strategy that minimizes the end-to-end communication delay. Specifically, under the assumption that only local information is available to every node, the Deep Q-Network (DQN) is trained offline to learn the optimal routing and channel selection strategy. After the trained DQN is implemented in every node, multiple relay nodes can simultaneously determine their next-hop relay and channel selections in real-time. Simulation results demonstrate the efficacy of our proposed algorithm.

AAAN↗
NASA NTRS2010

A Mixed Integer Linear Program for Solving a Multiple Route Taxi Scheduling Problem

Aircraft movements on taxiways at busy airports often create bottlenecks. This paper introduces a mixed integer linear program to solve a Multiple Route Aircraft Taxi Scheduling Problem. The outputs of the model are in the form of optimal taxi schedules, which include routing decisions for taxiing aircraft. The model extends an existing single route formulation to include routing decisions. An efficient comparison framework compares the multi-route formulation and the single route formulation. The multi-route model is exercised for east side airport surface traffic at Dallas/Fort Worth International Airport to determine if any arrival taxi time savings can be achieved by allowing arrivals to have two taxi routes: a route that crosses an active departure runway and a perimeter route that avoids the crossing. Results indicate that the multi-route formulation yields reduced arrival taxi times over the single route formulation only when a perimeter taxiway is used. In conditions where the departure aircraft are given an optimal and fixed takeoff sequence, accumulative arrival taxi time savings in the multi-route formulation can be as high as 3.6 hours more than the single route formulation. If the departure sequence is not optimal, the multi-route formulation results in less taxi time savings made over the single route formulation, but the average arrival taxi time is significantly decreased.

Montoya, Justin Vincent↗
NASA NTRS2012

Efficient Computation of Separation-Compliant Speed Advisories for Air Traffic Arriving in Terminal Airspace

A class of problems in air traffic management asks for a scheduling algorithm that supplies the air traffic services authority not only with a schedule of arrivals and departures, but also with speed advisories. Since advisories must be finite, a scheduling algorithm must ultimately produce a finite data set, hence must either start with a purely discrete model or involve a discretization of a continuous one. The former choice, often preferred for intuitive clarity, naturally leads to mixed-integer programs, hindering proofs of correctness and computational cost bounds (crucial for real-time operations). In this paper, a hybrid control system is used to model air traffic scheduling, capturing both the discrete and continuous aspects. This framework is applied to a class of problems, called the Fully Routed Nominal Problem. We prove a number of geometric results on feasible schedules and use these results to formulate an algorithm that attempts to compute a collective speed advisory, effectively finite, and has computational cost polynomial in the number of aircraft. This work is a first step toward optimization and models refined with more realistic detail.

Sadovsky, Alexander V.↗
NASA NTRS1990

Proposed definition of the term en route in en route aircraft noise

The problem of en route aircraft noise was examined in a formal, dedicated, setting. Whereas the general meaning of the term en route might be intuitively understood, it is suggested that a precise formal definition of the term en route would be opportune from the outset, especially since the scientific and technical investigation of the problem of noise immissions on the ground from aircraft in flight away from the airspace of an airport may conceivably lead to administrative, regulatory, and legal consequences that would mandatorily require a precise definition of the term en route. Five flight segments, with their differing airframe configurations, engine thrusts, and airspeed management, should form the basis for the differential consideration of the noise immissions perceived on the ground underneath or near the defined segments of the flightpath in en route flight, from the end of the initial climb from an airport after takeoff until the final approach to an airport.

Garbell, Maurice A.↗
NASA NTRS1997

Routing in Networks with Random Topologies

We examine the problems of routing and server assignment in networks with random connectivities. In such a network the basic topology is fixed, but during each time slot and for each of tis input queues, each server (node) is either connected to or disconnected from each of its queues with some probability.

Random Topologies routing↗
NASA NTRS2013

An Active Heater Control Concept to Meet IXO Type Mirror Module Thermal-Structural Distortion Requirement

Flight mirror assemblies (FMAs) of large telescopes, such as the International X-ray Observatory (IXO), have very stringent thermal-structural distortion requirements. The spatial temperature gradient requirement within a FMA could be as small as 0.05 C. Con ventionally, heaters and thermistors are attached to the stray light baffle (SLB), and centralized heater controllers (i.e., heater controller boards located in a large electronics box) are used. Due to the large number of heater harnesses, accommodating and routing them is extremely difficult. The total harness length/mass is very large. This innovation uses a thermally conductive pre-collimator to accommodate heaters and a distributed heater controller approach. It minimizes the harness length and mass, and reduces the problem of routing and accommodating them. Heaters and thermistors are attached to a short (4.67 cm) aluminum portion of the pre-collimator, which is thermally coupled to the SLB. Heaters, which have a very small heater power density, and thermistors are attached to the exterior of all the mirror module walls. The major portion (23.4 cm) of the pre-collimator for the middle and outer modules is made of thin, non-conductive material. It minimizes the view factors from the FMA and heated portion of the precollimator to space. It also minimizes heat conduction from one end of the FMA to the other. Small and multi-channel heater controllers, which have adjustable set points and internal redundancy, are used. They are mounted to the mechanical support structure members adjacent to each module. The IXO FMA, which is 3.3 m in diameter, is an example of a large telescope. If the heater controller boards are centralized, routing and accommodating heater harnesses is extremely difficult. This innovation has the following advantages. It minimizes the length/mass of the heater harness between the heater controllers and heater circuits. It reduces the problem of routing and accommodating the harness on the FMA. It reduces the risk of X-ray attenuation caused by the heater harness. Its adjustable set point capability eliminates the need for survival heater circuits. The operating mode heater circuits can also be used as survival heater circuits. In the non-operating mode, a lower set point is used.

Choi, Michael↗
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 NTRS1990

Stochastic ordering properties and optimal routing control for a class of finite capacity queueing systems

The problem of routing jobs to parallel queues with identical exponential servers and unequal finite buffer capacities is considered. Stochastic ordering and weak majorization properties on critical performance measures are established by means of event-driven inductions. In particular, it is shown that the intuitive 'join the shortest non-full queue' (SNQ) policy is optimal with respect to an overall function that accounts for holding and blocking costs. Moreover, the buffer allocation problem is solved by proving the intuitive result that, for a fixed total buffer capacity, the optimal allocation scheme is the one in which the difference between the maximum and minimum queue capacities is minimized, i.e., becomes either 0 or 1.

Towsley, Don↗
NASA NTRS1970

On the use of space photography for identifying transportation routes: A summary of problems

It has been widely suggested that space photography may be used for updating maps of transportation networks. Proponents of the argument have suggested that color space photographs of the resolution obtained with Hasselblad 80 mm lenses (about 300 feet) contain enough useful information to update the extensions of major U. S. highways. The present study systematically documents for the Dallas-Fort Worth area the potential of such space photography in detecting, and to a lesser degree identifying, the existing road networks. Color separation plates and an enlargement of the color photograph were produced and all visible roads traced onto transparencies for study. Major roads and roads under construction were the most visible while lower class roads and roads in urban areas had the poorest return. Road width and classification were found to be the major determinant in visibility, varying from 100 per cent visible for divided highways to 15 per cent visible of bladed earth roads. In summary, space photographs of this resolution proved to be difficult to use for accurate road delineation. Only super highways in rural areas with the greatest road-width were completely identifiable, the width being about 1/3 that of the resolution cell.

Simonett, D. S.↗