Search NASA⌕ Search

SEARCH · Search NASA

Results for “congestion”

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 55 records · Page 3

Regional Air Transport in Europe: The Potential Role of the Civil Tiltrotor in Reducing Airside Congestion

The volume of air traffic worldwide is still in constant growth despite unfair events that sometimes occur. The demand for regional air transport is also increasing, thanks in part to the use of new vehicles purposely designed for short range flights which make this means of transport more attractive than in the past. This paper studies the possibility of using aircraft capable of vertical or short takeoff or landing (V/STOL), in particular the tiltrotor, in the regional air transport market and the impact on airport capacity that the use of this craft would have. With this in mind the advantages and disadvantages of using this vehicle are identified, as well as the changes to be made to the air transport system in order to exploit its full potential.

Correnti, Vincenzo↗

Airport Pricing Strategies

Conventional economic wisdom suggests that congestion pricing would be an appropriate response to cope with the growing congestion levels currently experienced at many airports. Several characteristics of aviation markets, however, may make naive congestion prices equal to the value of marginal travel delays a non-optimal response. This paper has developed a model of airport pricing that captures a number of these features. The model in particular reflects that airlines typically have market power and are engaged in oligopolistic competition at different sub-markets; that part of external travel delays that aircraft impose are internal to an operator and hence should not be accounted for in congestion tolls. We presented an analytical treatment for a simple bi-nodal symmetric network, which through the use of 'hyper-networks' would be readily applicable to dynamic problems (in discrete time) such as peak - off-peak differences, and some numerical exercises for the same symmetric network, which was only designed to illustrate the possible comparative static impacts of tolling, in addition to marginal equilibrium conditions as could be derived for the general model specification. Some main conclusions are that second-best optimal tolls are typically lower than what would be suggested by congestion costs alone and may even be negative, and that the toll as derived by Brueckner (2002) may not lead to an increase in total welfare. While Brueckner (2002) has made clear that congestion tolls on airports may be smaller than expected when congestion costs among aircraft are internal for a firm, our analysis adds to this that a further downward adjustment may be in order due to market power. The presence of market power (which causes prices to exceed marginal costs) may cause the pure congestion toll to be suboptimal, because the resulting decrease in demand is too high (the pure congestion tall does not take into account the decrease in consumer surplus). The various downward adjustments in welfare maximizing tolls may well cause the optimal values of these to be negative. Insofar as subsidization is considered unacceptable for whichever reason, our results warn that the most efficient among the non-negative tolls may actually be a zero toll; the pure congestion toll may actually decrease welfare compared to the base case. The model in this paper contains a few simplifying assumptions that may be relaxed in future work. Load factors and aircraft capacity are fixed in this model for simplicity. In a more advanced version of this model, load factors and aircraft capacity can be endogenized. This makes the derivation of the optimality conditions far more complicated, but it should be feasible in a numerical experiment. One can also add a fourth layer to the model, describing the airport's optimization problem. For example, the airport can maximize profits under a cost recovery constraint. The model then deals with interactions between four types of agents. No distinction is made between peak and off-peak traffic in this paper. Finally, the results of the numerical exercise in this paper need to be checked against an asymmetric equilibrium.

Pels, Eric↗

Quantum-Accelerated Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

We present two algorithms in the Quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact spanning arborescence of minimum weight, the analog of a Minimum Spanning Tree in a directed graph, each of which uses O~(n^(1/4)) rounds of communication and O~(n^(9/4)) messages, achieving a lower round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. The CONGEST distributed computational model allows limited-sized messages to be transmitted within a network described by a communication graph of size n in a series of rounds to address a computational problem. The size limitation for such messages isO(log(n)) bits at each edge of the communication graph per round. The communication graph in the CONGEST-CLIQUE model is fully connected. In the Quantum CONGEST-CLIQUE model, at most O(log(n)) classical and quantum bits (qubits) can be communicated across each edge of the communication graph per round. At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. These speedups further contribute to understanding what problems can be solved more efficiently when we allow quantum communication in this CONGEST-CLIQUE model of distributed computation.

quantum distributed algorithms↗

Automated Flight Routing Using Stochastic Dynamic Programming

Airspace capacity reduction due to convective weather impedes air traffic flows and causes traffic congestion. This study presents an algorithm that reroutes flights in the presence of winds, enroute convective weather, and congested airspace based on stochastic dynamic programming. A stochastic disturbance model incorporates into the reroute design process the capacity uncertainty. A trajectory-based airspace demand model is employed for calculating current and future airspace demand. The optimal routes minimize the total expected traveling time, weather incursion, and induced congestion costs. They are compared to weather-avoidance routes calculated using deterministic dynamic programming. The stochastic reroutes have smaller deviation probability than the deterministic counterpart when both reroutes have similar total flight distance. The stochastic rerouting algorithm takes into account all convective weather fields with all severity levels while the deterministic algorithm only accounts for convective weather systems exceeding a specified level of severity. When the stochastic reroutes are compared to the actual flight routes, they have similar total flight time, and both have about 1% of travel time crossing congested enroute sectors on average. The actual flight routes induce slightly less traffic congestion than the stochastic reroutes but intercept more severe convective weather.

Ng, Hok K.↗

Collaborative Seamless Manager for Airspace Resources and Traffic

In today's NAS, airlines conduct pre-departure flight planning with limited information about traffic congestion. Then, as events evolve (pre-departure, on the surface, or inflight) and are impacted by congestion, limited options for changing flight plans are offered to the airlines, and, in some cases, flight plans are changed by air traffic managers on behalf of the airlines. For the airlines, this produces flight plan uncertainty and possible disruption to their business plans. The Collaborative Seamless Manager of Airspace Resources and Traffic (CSMART) is a tool being developed for the 2045 Next Gen System that will enhance the airlines' ability to flight plan, both pre-departure and during flight. CSMART achieves this, using the UTM architecture approach, by connecting via the internet airlines with other airlines and airlines with FAA agents. Flight plans, including digital, discrete planned trajectories with tolerances, are passed through the connection. Planned trajectories are used to create probabilistic predictions of when and where congestion will occur. Pre-departure, airline agents will use the predictions to collaboratively and seamlessly create flight plans that avoid congestion or go through it, depending on business objectives. In cases, where demand exceeds capacity and priorities need to be set, airline agents will have the ability to negotiate with each other to set them. Moreover, if flights are impacted by congestion during flight, CSMART will allow airlines more real-time decision making options for changing flight plans. This seminar presents the general CSMART concept and tool and research needed to develop it.

Windhorst, Robert D.↗

High performance interconnection between high data rate networks

The bridge/gateway system needed to interconnect a wide range of computer networks to support a wide range of user quality-of-service requirements is discussed. The bridge/gateway must handle a wide range of message types including synchronous and asynchronous traffic, large, bursty messages, short, self-contained messages, time critical messages, etc. It is shown that messages can be classified into three basic classes, synchronous and large and small asynchronous messages. The first two require call setup so that packet identification, buffer handling, etc. can be supported in the bridge/gateway. Identification enables resequences in packet size. The third class is for messages which do not require call setup. Resequencing hardware based to handle two types of resequencing problems is presented. The first is for a virtual parallel circuit which can scramble channel bytes. The second system is effective in handling both synchronous and asynchronous traffic between networks with highly differing packet sizes and data rates. The two other major needs for the bridge/gateway are congestion and error control. A dynamic, lossless congestion control scheme which can easily support effective error correction is presented. Results indicate that the congestion control scheme provides close to optimal capacity under congested conditions. Under conditions where error may develop due to intervening networks which are not lossless, intermediate error recovery and correction takes 1/3 less time than equivalent end-to-end error correction under similar conditions.

Foudriat, E. C.↗

Delay Banking for Managing Air Traffic

Delay banking has been invented to enhance air-traffic management in a way that would increase the degree of fairness in assigning arrival, departure, and en-route delays and trajectory deviations to aircraft impacted by congestion in the national airspace system. In delay banking, an aircraft operator (airline, military, general aviation, etc.) would be assigned a numerical credit when any of their flights are delayed because of an air-traffic flow restriction. The operator could subsequently bid against other operators competing for access to congested airspace to utilize part or all of its accumulated credit. Operators utilize credits to obtain higher priority for the same flight, or other flights operating at the same time, or later, in the same airspace, or elsewhere. Operators could also trade delay credits, according to market rules that would be determined by stakeholders in the national airspace system. Delay banking would be administered by an independent third party who would use delay banking automation to continually monitor flights, allocate delay credits, maintain accounts of delay credits for participating airlines, mediate bidding and the consumption of credits of winning bidders, analyze potential transfers of credits within and between operators, implement accepted transfers, and ensure fair treatment of all participating operators. A flow restriction can manifest itself in the form of a delay in assigned takeoff time, a reduction in assigned airspeed, a change in the position for the aircraft in a queue of all aircraft in a common stream of traffic (e.g., similar route), a change in the planned altitude profile for an aircraft, or change in the planned route for the aircraft. Flow restrictions are typically imposed to mitigate traffic congestion at an airport or in a region of airspace, particularly congestion due to inclement weather, or the unavailability of a runway or region of airspace. A delay credit would be allocated to an operator of a flight that has accepted, or upon which was imposed, a flow restriction. The amount of the credit would increase with the amount of delay caused by the flow restriction, the exact amount depending on which of several candidate formulas is eventually chosen. For example, according to one formula, there would be no credit for a delay smaller than some threshold value (e.g., 30 seconds) and the amount of the credit for a longer delay would be set at the amount of the delay minus the threshold value. Optionally, the value of a delay credit could be made to decay with time according to a suitable formula (e.g., an exponential decay). Also, optionally, a transaction charge could be assessed against the value of a delay credit that an operator used on a flight different from the one for which the delay originated or that was traded with a different operator. The delay credits accumulated by a given airline could be utilized in various ways. For example, an operator could enter a bid for priority handling in a new flow restriction that impacts one or more of the operator s flights; if the bid were unsuccessful, all or a portion of the credit would be returned to the bidder. If the bid pertained to a single aircraft that was in a queue, delay credits could be consumed in moving the aircraft to an earlier position within the queue. In the case of a flow restriction involving a choice of alternate routes, planned altitude profile, aircraft spacing, or other non-queue flow restrictions, delay credits could be used to bid for an alternative assignment.

Green, Steve↗

A Minimax Network Flow Model for Characterizing the Impact of Slot Restrictions

This paper proposes a model for evaluating long-term measures to reduce congestion at airports in the National Airspace System (NAS). This model is constructed with the goal of assessing the global impacts of congestion management strategies, specifically slot restrictions. We develop the Minimax Node Throughput Problem (MINNTHRU), a multicommodity network flow model that provides insight into air traffic patterns when one minimizes the worst-case operation across all airports in a given network. MINNTHRU is thus formulated as a model where congestion arises from network topology. It reflects not market-driven airline objectives, but those of a regulatory authority seeking a distribution of air traffic beneficial to all airports, in response to congestion management measures. After discussing an algorithm for solving MINNTHRU for moderate-sized (30 nodes) and larger networks, we use this model to study the impacts of slot restrictions on the operation of an entire hub-spoke airport network. For both a small example network and a medium-sized network based on 30 airports in the NAS, we use MINNTHRU to demonstrate that increasing the severity of slot restrictions increases the traffic around unconstrained hub airports as well as the worst-case level of operation over all airports.

Lee, Douglas W.↗

Operational Evaluatioin of Dynamic Weather Routes at American Airlines

Dynamic Weather Routes (DWR) is a search engine that continuously and automatically analyzes inflight aircraft in en route airspace and proposes simple route amendments for more efficient routes around convective weather while considering sector congestion, traffic conflicts, and active Special Use Airspace. NASA and American Airlines (AA) are conducting an operational trial of DWR at the AA System Operations Center in Fort Worth, TX. The trial includes only AA flights in Fort Worth Center airspace. Over the period from July 31, 2012 through August 31, 2012, 45% of routes proposed by DWR and evaluated by AA users - air traffic control coordinators and flight dispatchers - were rated as acceptable as proposed or with some modifications. The wind-corrected potential flying time savings for these acceptable routes totals 470 flying min, and results suggest another 1,500 min of potential savings for flights not evaluated due to staffing limitations. A sector congestion analysis shows that in only two out of 83 DWR routes rated acceptable by AA staff were the flights predicted to fly through a congested sector inside of 30 min downstream of present position. This shows that users considered sector congestion data provided by DWR automation and in nearly all cases did not accept routes through over-capacity sectors. It is estimated that 12 AA flights were given reroute clearances as a direct result of DWR for a total savings of 67 flying min.

air traffic trajectory automation↗

TPSAS-NF1676L-12321-DND

The operation of some networks, such as air transportation networks, can be complicated by congestion through a small subset of nodes. The congestion may be influenced by the connectivity of the network, or by the presence of constraints restricting the flow through particular nodes. This work investigates the effects of both connectivity and node flow constraints on the operation of a network. We develop the Minimax Node Load Problem (MNLP), a multicommodity flow model which minimizes the worst-case flow through any node in a given input network. The optimal solution to this problem provides us with the minimax node load, which we propose as a measure of network congestion. Keeping the number of nodes fixed, we first increase connectivity in a series of networks, and observe that topologies with more distributed connections result in a reduction in the minimax node load. However, when connectivity is increased further, the reductions diminish and are accompanied by solutions with undesirable qualities such as longer commodity paths. We then perform a second set of experiments over the same network, constraining flow through different subsets of nodes at different magnitudes of flow restriction, finding that (1) more constrained nodes lead to the largest increases in minimax node load and (2) constraints on the most connected nodes have the greatest effect on both congestion and commodity path length.

Douglas W Lee↗

TPSAS-NF1676L-12264-DND

The operation of some networks, such as air transportation networks, can be complicated by congestion through a small subset of nodes. The congestion may be influenced by the connectivity of the network, or by the presence of constraints restricting the flow through particular nodes. This work investigates the effects of both connectivity and node flow constraints on the operation of a network. We develop the Minimax Node Load Problem (MNLP), a multicommodity flow model which minimizes the worst-case flow through any node in a given input network. The optimal solution to this problem provides us with the minimax node load, which we propose as a measure of network congestion. Keeping the number of nodes fixed, we first increase connectivity in a series of networks, and observe that topologies with more distributed connections result in a reduction in the minimax node load. However, when connectivity is increased further, the reductions diminish and are accompanied by solutions with undesirable qualities such as longer commodity paths. We then perform a second set of experiments over the same network, constraining flow through different subsets of nodes at different magnitudes of flow restriction, finding that (1) more constrained nodes lead to the largest increases in minimax node load and (2) constraints on the most connected nodes have the greatest effect on both congestion and commodity path length.

Douglas Lee↗

Vertiport Dynamic Density

Advanced Air Mobility (AAM) is envisioned to be another spoke in a region’s transportation system, supplementing ground-based travel with air-based travel. Eventually, air taxis will be pervasive, convenient, and affordable. As demand and operations tempo increase, congestion may arise. Several characteristics of AAM reduce the applicability of techniques used in today’s National Airspace System (NAS) to manage congestion. AAM will include both scheduled and non-scheduled, on-demand operations, challenging strategic deconfliction algorithms. Flights will be fairly short, traversing an urban area, not hundreds or thousands of miles, with corresponding low energy reserves, prohibiting excessive delays. Flight operators will need flexibility in operations, scheduling a flight only minutes before departure, or diverting to an alternate vertiport if it becomes advantageous, further adding to trajectory uncertainty that would challenge strategic deconfliction. Finally, operators will desire privacy to protect sensitive information or preserve competitive advantage, limiting early access to intent information. In this paper, we present an approach for managing congestion at vertiports by providing insight into the traffic situation to support operationally-advantageous and safe land or divert decisions. We propose a metric designed with usefulness and usability in AAM operations in mind. The metric uses the sociology concept of dynamic density (DD) that takes into consideration not only number of flights, but also the interaction of those flights with the vertiport’s limited resources, namely the landing pads and the parking spots. DD supports a Pilot in Command (PIC) with decisions about whether to proceed, expedite, delay, or divert; and supports air traffic control (ATC) and vertiport operators in airspace management and vertiport usage. We demonstrate the metric on a notional vertiport scenario. We also show that DD provides better insight into congestion and resulting flight delays than an aircraft count metric used in traditional air traffic management.

Lilly Spirkovska↗

Reliable multicast protocol specifications flow control and NACK policy

This appendix presents the flow and congestion control schemes recommended for RMP and a NACK policy based on the whiteboard tool. Because RMP uses a primarily NACK based error detection scheme, there is no direct feedback path through which receivers can signal losses through low buffer space or congestion. Reliable multicast protocols also suffer from the fact that throughput for a multicast group must be divided among the members of the group. This division is usually very dynamic in nature and therefore does not lend itself well to a priori determination. These facts have led the flow and congestion control schemes of RMP to be made completely orthogonal to the protocol specification. This allows several differing schemes to be used in different environments to produce the best results. As a default, a modified sliding window scheme based on previous algorithms are suggested and described below.

Callahan, John R.↗

Auction Mechanism to Allocate Air Traffic Control Slots

This article deals with an auction mechanism for airspace slots, as a means of solving the European airspace congestion problem. A disequilibrium, between Air Traffic Control (ATC) services supply and ATC services demand are at the origin of almost one fourth of delays in the air transport industry in Europe. In order to tackle this congestion problem, we suggest modifying both pricing and allocation of ATC services, by setting up an auction mechanism. Objects of the auction will be the right for airlines to cross a part of the airspace, and then to benefit from ATC services over a period corresponding to the necessary time for the crossing. Allocation and payment rules have to be defined according to the objectives of this auction. The auctioneer is the public authority in charge of ATC services, whose aim is to obtain an efficient allocation. Therefore, the social value will be maximized. Another objective is to internalize congestion costs. To that end, we apply the principle of Clarke-Groves mechanism auction: each winner has to pay the externalities imposed on other bidders. The complex context of ATC leads to a specific design for this auction.

Raffarin, Marianne↗

Integrated Traffic Flow Management Decision Making

A generalized approach is proposed to support integrated traffic flow management decision making studies at both the U.S. national and regional levels. It can consider tradeoffs between alternative optimization and heuristic based models, strategic versus tactical flight controls, and system versus fleet preferences. Preliminary testing was accomplished by implementing thirteen unique traffic flow management models, which included all of the key components of the system and conducting 85, six-hour fast-time simulation experiments. These experiments considered variations in the strategic planning look-ahead times, the replanning intervals, and the types of traffic flow management control strategies. Initial testing indicates that longer strategic planning look-ahead times and re-planning intervals result in steadily decreasing levels of sector congestion for a fixed delay level. This applies when accurate estimates of the air traffic demand, airport capacities and airspace capacities are available. In general, the distribution of the delays amongst the users was found to be most equitable when scheduling flights using a heuristic scheduling algorithm, such as ration-by-distance. On the other hand, equity was the worst when using scheduling algorithms that took into account the number of seats aboard each flight. Though the scheduling algorithms were effective at alleviating sector congestion, the tactical rerouting algorithm was the primary control for avoiding en route weather hazards. Finally, the modeled levels of sector congestion, the number of weather incursions, and the total system delays, were found to be in fair agreement with the values that were operationally observed on both good and bad weather days.

Grabbe, Shon R.↗