SEARCH · Engineering Papers

Results for “congestion control”

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 37 records · Page 2

All sources NASA NTRS DOE OSTI

NASA NTRS2009

Distrubtion Tolerant Network Technology Flight Validation Report: DINET

In October and November of 2008, the Jet Propulsion Laboratory installed and tested essential elements of Delay/Disruption Tolerant Networking (DTN) technology on the Deep Impact spacecraft. This experiment, called Deep Impact Network Experiment (DINET), was performed in close cooperation with the EPOXI project which has responsibility for the spacecraft. During DINET some 300 images were transmitted from the JPL nodes to the spacecraft. Then, they were automatically forwarded from the spacecraft back to the JPL nodes, exercising DTN's bundle origination, transmission, acquisition, dynamic route computation, congestion control, prioritization, custody transfer, and automatic retransmission procedures, both on the spacecraft and on the ground, over a period of 27 days. All transmitted bundles were successfully received, without corruption. The DINET experiment demonstrated DTN readiness for operational use in space missions.

networking↗

NASA NTRS2009

Distribution Tolerant Network Technology Flight Validation Report: DINET

networking↗

NASA NTRS2011

Contact Graph Routing

Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology of scheduled communication contacts in a network based on the DTN (Delay-Tolerant Networking) architecture. It is designed to enable dynamic selection of data transmission routes in a space network based on DTN. This dynamic responsiveness in route computation should be significantly more effective and less expensive than static routing, increasing total data return while at the same time reducing mission operations cost and risk. The basic strategy of CGR is to take advantage of the fact that, since flight mission communication operations are planned in detail, the communication routes between any pair of bundle agents in a population of nodes that have all been informed of one another's plans can be inferred from those plans rather than discovered via dialogue (which is impractical over long one-way-light-time space links). Messages that convey this planning information are used to construct contact graphs (time-varying models of network connectivity) from which CGR automatically computes efficient routes for bundles. Automatic route selection increases the flexibility and resilience of the space network, simplifying cross-support and reducing mission management costs. Note that there are no routing tables in Contact Graph Routing. The best route for a bundle destined for a given node may routinely be different from the best route for a different bundle destined for the same node, depending on bundle priority, bundle expiration time, and changes in the current lengths of transmission queues for neighboring nodes; routes must be computed individually for each bundle, from the Bundle Protocol agent's current network connectivity model for the bundle s destination node (the contact graph). Clearly this places a premium on optimizing the implementation of the route computation algorithm. The scalability of CGR to very large networks remains a research topic. The information carried by CGR contact plan messages is useful not only for dynamic route computation, but also for the implementation of rate control, congestion forecasting, transmission episode initiation and termination, timeout interval computation, and retransmission timer suspension and resumption.

Burleigh, Scott C.↗

NASA NTRS2011

Deep Space Networking Experiments on the EPOXI Spacecraft

NASA's Space Communications & Navigation Program within the Space Operations Directorate is operating a program to develop and deploy Disruption Tolerant Networking [DTN] technology for a wide variety of mission types by the end of 2011. DTN is an enabling element of the Interplanetary Internet where terrestrial networking protocols are generally unsuitable because they rely on timely and continuous end-to-end delivery of data and acknowledgments. In fall of 2008 and 2009 and 2011 the Jet Propulsion Laboratory installed and tested essential elements of DTN technology on the Deep Impact spacecraft. These experiments, called Deep Impact Network Experiment (DINET 1) were performed in close cooperation with the EPOXI project which has responsibility for the spacecraft. The DINET 1 software was installed on the backup software partition on the backup flight computer for DINET 1. For DINET 1, the spacecraft was at a distance of about 15 million miles (24 million kilometers) from Earth. During DINET 1 300 images were transmitted from the JPL nodes to the spacecraft. Then, they were automatically forwarded from the spacecraft back to the JPL nodes, exercising DTN's bundle origination, transmission, acquisition, dynamic route computation, congestion control, prioritization, custody transfer, and automatic retransmission procedures, both on the spacecraft and on the ground, over a period of 27 days. The first DINET 1 experiment successfully validated many of the essential elements of the DTN protocols. DINET 2 demonstrated: 1) additional DTN functionality, 2) automated certain tasks which were manually implemented in DINET 1 and 3) installed the ION SW on nodes outside of JPL. DINET 3 plans to: 1) upgrade the LTP convergence-layer adapter to conform to the international LTP CL specification, 2) add convergence-layer "stewardship" procedures and 3) add the BSP security elements [PIB & PCB]. This paper describes the planning and execution of the flight experiment and the validation results.

automated data communication↗

NASA NTRS2009

Disruption Tolerant Networking Flight Validation Experiment on NASA's EPOXI Mission

In October and November of 2008, the Jet Propulsion Laboratory installed and tested essential elements of Delay/Disruption Tolerant Networking (DTN) technology on the Deep Impact spacecraft. This experiment, called Deep Impact Network Experiment (DINET), was performed in close cooperation with the EPOXI project which has responsibility for the spacecraft. During DINET some 300 images were transmitted from the JPL nodes to the spacecraft. Then they were automatically forwarded from the spacecraft back to the JPL nodes, exercising DTN's bundle origination, transmission, acquisition, dynamic route computation, congestion control, prioritization, custody transfer, and automatic retransmission procedures, both on the spacecraft and on the ground, over a period of 27 days. All transmitted bundles were successfully received, without corruption. The DINET experiment demonstrated DTN readiness for operational use in space missions. This activity was part of a larger NASA space DTN development program to mature DTN to flight readiness for a wide variety of mission types by the end of 2011. This paper describes the DTN protocols, the flight demo implementation, validation metrics which were created for the experiment, and validation results.

DTN↗

NASA NTRS1992

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.↗

NASA NTRS2001

Delivering Faster Congestion Feedback with the Mark-Front Strategy

Computer networks use congestion feedback from the routers and destinations to control the transmission load. Delivering timely congestion feedback is essential to the performance of networks. Reaction to the congestion can be more effective if faster feedback is provided. Current TCP/IP networks use timeout, duplicate Acknowledgement Packets (ACKs) and explicit congestion notification (ECN) to deliver the congestion feedback, each provides a faster feedback than the previous method. In this paper, we propose a markfront strategy that delivers an even faster congestion feedback. With analytical and simulation results, we show that mark-front strategy reduces buffer size requirement, improves link efficiency and provides better fairness among users. Keywords: Explicit Congestion Notification, mark-front, congestion control, buffer size requirement, fairness.

Liu, Chunlei↗

NASA NTRS1987

Issues in packet radio network design

The physical aspects of a packet radio network design, the automated management of the network, and the interface of the network to the users are examined. The networks provide data communications to users located over a broad geographic region where direct radio or wire connection between the source and destination user is not practical; the network consists of a radio, antenna, and digital controller. The physical connectivity, bandwidth-time-space management, channel access, and data link control of the network are analyzed. Consideration is given to link determination and control, routing and packet forwarding, congestion and flow control, and supported users management. The operation and management of a packet radio network, in particular network deployment and maintenance, network access methods, and its effect on the radio spectrum, are discussed. The performance and cost of a packet radio network are evaluated.

Leiner, Barry M.↗

NASA NTRS2003

Input-Output Modeling and Control of the Departure Process of Congested Airports

A simple queueing model of busy airport departure operations is proposed. This model is calibrated and validated using available runway configuration and traffic data. The model is then used to evaluate preliminary control schemes aimed at alleviating departure traffic congestion on the airport surface. The potential impact of these control strategies on direct operating costs, environmental costs and overall delay is quantified and discussed.

Pujet, Nicolas↗

NASA NTRS1998

Buffer Management Simulation in ATM Networks

This paper presents a simulation of a new dynamic buffer allocation management scheme in ATM networks. To achieve this objective, an algorithm that detects congestion and updates the dynamic buffer allocation scheme was developed for the OPNET simulation package via the creation of a new ATM module.

simulations Asynchronous Transfer Mode ATM Switch ↗

NASA NTRS1998

Using Transmission Control Protocol in the Trans-Pacific High Definition Video Satellite Communication Experiment - the Next Test

Ths paper describes a future Transmission Control Protocol (TCP) test which was planned as a part of the Trans-Pacific High Definition Video Satellite Communications Experiment. The TCP test portion of the Trans-Pacific High Definition Video Satellite Communications Experiment intends to examine the correlation between the underlying assumptions of come TCP algorithms and the performance shortfalls observed when the algorithms are used in a stellite-based environment, and to make experimental changes to existing TCP variants to study the effects of the modifications.

global information infrastructure (GII) satellites↗

NASA NTRS2006

Spacecraft Data and Relay Management using Delay Tolerant Networking

NASA's demonstration of the successful transmission of relay data through the orbiting Mars Odyssey, Mars Global Surveyor, and Mars Express by the Mars Exploration Rovers has shown not only the benefit of using a relay satellite for multiple landed assets in a deep space environment but also the benefit of international standards for such architecture. As NASA begins the quest defined in the Vision for Exploration with robotic and manned missions to the Moon, continues its study of Mars, and is joined in these endeavors by countries world-wide, landed assets transmitting data through relay satellites will be crucial for completing mission objectives. However, this method of delivery of data will result in increased complexity in routing and prioritization of data transmission as the number of missions increases. Also, there is currently no standard method among organizations conducting such missions to return these data sets to Earth given a complex environment. One possibility for establishing such a standard is for mission designers to deploy protocols which fall under the umbrella of Delay Tolerant Networking (DTN). These developing standards include the Bundle Protocol (BP) which provides a standard, secure, store and forward mechanism designed for high latency and asymmetric communication links and the Licklider Transmission Protocol (LTP) which is used to provide a reliable deep space link transmission service.

network congestion control algorithm↗

NASA NTRS1985

Integrated risk/cost planning models for the US Air Traffic system

A prototype network planning model for the U.S. Air Traffic control system is described. The model encompasses the dual objectives of managing collision risks and transportation costs where traffic flows can be related to these objectives. The underlying structure is a network graph with nonseparable convex costs; the model is solved efficiently by capitalizing on its intrinsic characteristics. Two specialized algorithms for solving the resulting problems are described: (1) truncated Newton, and (2) simplicial decomposition. The feasibility of the approach is demonstrated using data collected from a control center in the Midwest. Computational results with different computer systems are presented, including a vector supercomputer (CRAY-XMP). The risk/cost model has two primary uses: (1) as a strategic planning tool using aggregate flight information, and (2) as an integrated operational system for forecasting congestion and monitoring (controlling) flow throughout the U.S. In the latter case, access to a supercomputer is required due to the model's enormous size.

Mulvey, J. M.↗

NASA NTRS1980

Some wake-related operational limitations of rotorcraft

Wind tunnel measurements show that the wake of a rotor, except at near hovering speeds, is not like that of a propeller. The wake is more like that of a wing except that, because of the slow speeds, the wake velocities may be much greater. The helicopter can produce a wake hazard to following light aircraft that is disproportionately great compared to an equivalent fixed wing aircraft. This hazard should be recognized by both pilots and airport controllers when operating in congested areas. Ground effect is generally counted as a blessing since it allows overloaded takeoffs; however, it also introduces additional operation problems. These problems include premature blade stall in hover, settling in forward transition, shuddering in approach to touchdown and complicatons with yaw control. Some of these problems were treated analytically in an approximate manner and reasonable experiment agreement was obtained. An awareness of these effects can prepare the user for their appearance and their consequences.

Heyson, H. H.↗

NASA NTRS1997

A Loss Tolerant Rate Controller for Reliable Multicast

This paper describes the design, specification, and performance of a Loss Tolerant Rate Controller (LTRC) for use in controlling reliable multicast senders. The purpose of this rate controller is not to adapt to congestion (or loss) on a per loss report basis (such as per received negative acknowledgment), but instead to use loss report information and perceived state to decide more prudent courses of action for both the short and long term. The goal of this controller is to be responsive to congestion, but not overly reactive to spurious independent loss. Performance of the controller is verified through simulation results.

Montgomery, Todd↗

NASA NTRS1980

Operational implications of some NACA/NASA rotary wing induced velocity studies

Wind tunnel measurements show that the wake of a rotor, except at near-hovering speeds, is not like that of a propeller. The wake is more like that of a wing except that, because of the slow speeds, the wake velocities may be much greater. The helicopter can produce a wake hazard to following light aircraft that is disproportionately great compared to an equivalent fixed-wing aircraft. This hazard should be recognized by both pilots and airport controllers when operating in congested areas. Even simple momentum theory shows that, in autorotation and partial-power descent, the required power is a complex function of both airspeed and descent angle. The nonlinear characteristic, together with an almost total lack of usable instrumentation at low airspeeds, has led to numerous power-settling accidents. The same theory shows that there is a minimum forward speed at which a rotor can autorotate. Neglect of, or inadequate appraisal of this minimum speed has also led to numerous accidents. Ground effect and the problems it creates is discussed.

Heyson, H. H.↗

NASA NTRS2001

Improving Simulated Annealing by Recasting it as a Non-Cooperative Game

The game-theoretic field of COllective INtelligence (COIN) concerns the design of computer-based players engaged in a non-cooperative game so that as those players pursue their self-interests, a pre-specified global goal for the collective computational system is achieved "as a side-effect". Previous implementations of COIN algorithms have outperformed conventional techniques by up to several orders of magnitude, on domains ranging from telecommunications control to optimization in congestion problems. Recent mathematical developments have revealed that these previously developed game-theory-motivated algorithms were based on only two of the three factors determining performance. Consideration of only the third factor would instead lead to conventional optimization techniques like simulated annealing that have little to do with non-cooperative games. In this paper we present an algorithm based on all three terms at once. This algorithm can be viewed as a way to modify simulated annealing by recasting it as a non-cooperative game, with each variable replaced by a player. This recasting allows us to leverage the intelligent behavior of the individual players to substantially improve the exploration step of the simulated annealing. Experiments are presented demonstrating that this recasting improves simulated annealing by several orders of magnitude for spin glass relaxation and bin-packing.

Wolpert, David↗

NASA NTRS2001

Improving Simulated Annealing by Replacing Its Variables with Game-Theoretic Utility Maximizers

The game-theory field of Collective INtelligence (COIN) concerns the design of computer-based players engaged in a non-cooperative game so that as those players pursue their self-interests, a pre-specified global goal for the collective computational system is achieved as a side-effect. Previous implementations of COIN algorithms have outperformed conventional techniques by up to several orders of magnitude, on domains ranging from telecommunications control to optimization in congestion problems. Recent mathematical developments have revealed that these previously developed algorithms were based on only two of the three factors determining performance. Consideration of only the third factor would instead lead to conventional optimization techniques like simulated annealing that have little to do with non-cooperative games. In this paper we present an algorithm based on all three terms at once. This algorithm can be viewed as a way to modify simulated annealing by recasting it as a non-cooperative game, with each variable replaced by a player. This recasting allows us to leverage the intelligent behavior of the individual players to substantially improve the exploration step of the simulated annealing. Experiments are presented demonstrating that this recasting significantly improves simulated annealing for a model of an economic process run over an underlying small-worlds topology. Furthermore, these experiments reveal novel small-worlds phenomena, and highlight the shortcomings of conventional mechanism design in bounded rationality domains.

Wolpert, David H.↗