Stress Testing High Performance Networking in the International Space Station’s Software Development and Integration Laboratory
Explore the source record for details and available documents.
Space Networking↗
SEARCH · Engineering Papers
Results for “network performance”
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.
Street-level temperature estimation using graph neural networks: Performance, feature embedding and interpretability
Explore the source record for details and available documents.
Yin Yu↗
Analysis of random drop for gateway congestion control
Lately, the growing demand on the Internet has prompted the need for more effective congestion control policies. Currently No Gateway Policy is used to relieve and signal congestion, which leads to unfair service to the individual users and a degradation of overall network performance. Network simulation was used to illustrate the character of Internet congestion and its causes. A newly proposed gateway congestion control policy, called Random Drop, was considered as a promising solution to the pressing problem. Random Drop relieves resource congestion upon buffer overflow by choosing a random packet from the service queue to be dropped. The random choice should result in a drop distribution proportional to the bandwidth distribution among all contending TCP connections, thus applying the necessary fairness. Nonetheless, the simulation experiments demonstrate several shortcomings with this policy. Because Random Drop is a congestion control policy, which is not applied until congestion has already occurred, it usually results in a high drop rate that hurts too many connections including well-behaved ones. Even though the number of packets dropped is different from one connection to another depending on the buffer utilization upon overflow, the TCP recovery overhead is high enough to neutralize these differences, causing unfair congestion penalties. Besides, the drop distribution itself is an inaccurate representation of the average bandwidth distribution, missing much important information about the bandwidth utilization between buffer overflow events. A modification of Random Drop to do congestion avoidance by applying the policy early was also proposed. Early Random Drop has the advantage of avoiding the high drop rate of buffer overflow. The early application of the policy removes the pressure of congestion relief and allows more accurate signaling of congestion. To be used effectively, algorithms for the dynamic adjustment of the parameters of Early Random Drop to suite the current network load must still be developed.
Hashem, Emam Salaheddin↗
Autonomous Congestion Control in Delay-Tolerant Networks
Congestion control is an important feature that directly affects network performance. Network congestion may cause loss of data or long delays. Although this problem has been studied extensively in the Internet, the solutions for Internet congestion control do not apply readily to challenged network environments such as Delay Tolerant Networks (DTN) where end-to-end connectivity may not exist continuously and latency can be high. In DTN, end-to-end rate control is not feasible. This calls for congestion control mechanisms where the decisions can be made autonomously with local information only. We use an economic pricing model and propose a rule-based congestion control mechanism where each router can autonomously decide on whether to accept a bundle (data) based on local information such as available storage and the value and risk of accepting the bundle (derived from historical statistics). Preliminary experimental results show that this congestion control mechanism can protect routers from resource depletion without loss of data.
delay-tolerant networking↗
Autonomous Congestion Control in Delay-Tolerant Networks
Congestion control is an important feature that directly affects network performance. Network congestion may cause loss of data or long delays. Although this problem has been studied extensively in the Internet, the solutions for Internet congestion control do not apply readily to challenged network environments such as Delay Tolerant Networks (DTN) where end-to-end connectivity may not exist continuously and latency can be high. In DTN, end-to-end rate control is not feasible. This calls for congestion control mechanisms where the decisions can be made autonomously with local information only. We use an economic pricing model and propose a rule-based congestion control mechanism where each router can autonomously decide on whether to accept a bundle (data) based on local information such as available storage and the value and risk of accepting the bundle (derived from historical statistics).
delay tolerant networking↗
Advanced Communication Technology Satellite (ACTS) Very Small Aperture Terminal (VSAT) Network Control Performance
This paper discusses the performance of the network control function for the Advanced Communications Technology Satellite (ACTS) very small aperture terminal (VSAT) full mesh network. This includes control of all operational activities such as acquisition, synchronization, timing and rain fade compensation as well as control of all communications activities such as on-demand integrated services (voice, video, and date) connects and disconnects Operations control is provided by an in-band orderwire carried in the baseboard processor (BBP) control burst, the orderwire burst, the reference burst, and the uplink traffic burst. Communication services are provided by demand assigned multiple access (DAMA) protocols. The ACTS implementation of DAMA protocols ensures both on-demand and integrated voice, video and data services. Communications services control is also provided by the in-band orderwire but uses only the reference burst and the uplink traffic burst. The performance of the ACTS network control functions have been successfully tested during on-orbit checkout and in various VSAT networks in day to day operations. This paper discusses the network operations and services control performance.
Coney, T. A.↗
Preliminary performance analysis of high-speed digital data circuits in the NASCOM network
Performance evaluation of high speed digital data circuits in NASA communications network /NASCOM/
Dickinson, W. B.↗
The operational performance of hydrogen masers in the Deep Space Network (the performance of laboratory reference frequency standards in an operational environment)
Spacecraft navigation to the outer planets (Jupiter and beyond) places very stringent demands upon the performance of frequency and time (F&T) reference standards. The Deep Space Network (DSN) makes use of hydrogen masers as an aid in meeting the routine F&T operational requirements within the 64 m antenna network. Results as of October 1980 indicate the hydrogen masers are performing within the required specifications. Two problem areas are discussed: insufficient control over the environment in which the reference standards reside; and frequency drift.
Ward, S. C.↗
The operational performance of hydrogen masers in the deep space network: The performance of laboratory reference frequency standards in an operational environment
Hydrogen masers used as aids in meeting the routine frequency and time operational requirements within the 64 m antenna Deep Space Network. Both the operational syntonation (frequency synchronization) and the the clock (epoch) synchronization requirements were established through the use of specifically calibrated H-P E215061A flying clock. The sync/synt to UTC was maintained using LORAN and TV in simultaneous reception mode. The sync/synt within the 64 m net was maintained through the use of very long base interferometry. Results indicate that the hydrogen masers perform well within the required specifications.
Ward, S. C.↗
Efficient Use of Distributed Systems for Scientific Applications
Distributed computing has been regarded as the future of high performance computing. Nationwide high speed networks such as vBNS are becoming widely available to interconnect high-speed computers, virtual environments, scientific instruments and large data sets. One of the major issues to be addressed with distributed systems is the development of computational tools that facilitate the efficient execution of parallel applications on such systems. These tools must exploit the heterogeneous resources (networks and compute nodes) in distributed systems. This paper presents a tool, called PART, which addresses this issue for mesh partitioning. PART takes advantage of the following heterogeneous system features: (1) processor speed; (2) number of processors; (3) local network performance; and (4) wide area network performance. Further, different finite element applications under consideration may have different computational complexities, different communication patterns, and different element types, which also must be taken into consideration when partitioning. PART uses parallel simulated annealing to partition the domain, taking into consideration network and processor heterogeneity. The results of using PART for an explicit finite element application executing on two IBM SPs (located at Argonne National Laboratory and the San Diego Supercomputer Center) indicate an increase in efficiency by up to 36% as compared to METIS, a widely used mesh partitioning tool. The input to METIS was modified to take into consideration heterogeneous processor performance; METIS does not take into consideration heterogeneous networks. The execution times for these applications were reduced by up to 30% as compared to METIS. These results are given in Figure 1 for four irregular meshes with number of elements ranging from 30,269 elements for the Barth5 mesh to 11,451 elements for the Barth4 mesh. Future work with PART entails using the tool with an integrated application requiring distributed systems. In particular this application, illustrated in the document entails an integration of finite element and fluid dynamic simulations to address the cooling of turbine blades of a gas turbine engine design. It is not uncommon to encounter high-temperature, film-cooled turbine airfoils with 1,000,000s of degrees of freedom. This results because of the complexity of the various components of the airfoils, requiring fine-grain meshing for accuracy. Additional information is contained in the original.
Taylor, Valerie↗
Urban Air Mobility Network and Vehicle Type - Modeling and Assessment
This paper describes exploratory modeling of an on-demand urban air mobility (UAM) network and sizing of vehicles to operate within that network. UAM seeks to improve the movement of goods and people around a metropolitan area by utilizing the airspace for transport. Aircraft sizing and overall network performance results are presented that include comparisons of battery-electric and various hybrid-electric vehicles that are fueled with diesel, jet fuel, compressed natural gas, and liquefied natural gas (LNG). Hybrid-electric propulsion systems consisting of internal combustion engine-generators, turbine-generators, and solid oxide fuel cells are explored. Ultimately, the "performance" of the UAM network over a day for each of the different vehicle types, propulsion systems, and stored energy sources is described in four parameters: 1) the average cost per seat-kilometer, which considers the costs of the energy/fuel, vehicle acquisition, insurance, maintenance, pilot, and battery replacement costs, 2) carbon dioxide emission rates associated with vehicle operations, 3) the average passenger wait time, and 4) the average load factor, i.e., the total number of seats filled with paying passengers divided by the total number of available seats. Results indicate that the "dispatch model," which determines when and where aircraft are flown around the UAM network, is critical in determining the overall network performance. This is due to the often-conflicting desires to allow passengers to depart with minimal wait time while still maintaining a high load factor to reduce operating costs. Additionally, regardless of the dispatch model, hybrid-electric aircraft powered by internal combustion engines fueled with diesel or LNG are consistently the lowest cost per seat-kilometer. Battery-electric and future technology LNG/solid oxide fuel cell aircraft produce the lowest emissions (assuming the California grid) with LNG-fueled internal combustion engine-powered hybrids producing only slightly more carbon dioxide.
Assessment↗
Developing High Performance Space Networking Capabilities for the International Space Station and Beyond
A performance optimized implementation of Delay Tolerant Networking (DTN) with the capacity of gigabit-per second rates is developed for the International Space Station (ISS) and missions demanding large amounts of communications bandwidth. An overview of the High-rate Delay Tolerant Networking (HDTN) architecture and support for different convergence layers is provided. This paper then presents an overview of the testing and integration efforts to evaluate interoperability and capability in relevant environments. The first was interoperability testing with DTN Marshall Enterprise (DTNME) which resulted in near-gigabit per second data rates. This was followed by ISS emulation testing with the Software Development and Integration Laboratory (SDIL) at the Lyndon B. Johnson Space Center (JSC) and local testing based on the ISS DTN network topology. The local tests resulted in the discovery of potential sources of performance loss in the network and demonstrated near-gigabit rates between HDTN and DTNME.
Daniel Raible↗
An Investigation of Synchrony in Transport Networks
The cumulative degree distributions of transport networks, such as air transportation networks and respiratory neuronal networks, follow power laws. The significance of power laws with respect to other network performance measures, such as throughput and synchronization, remains an open question. Evolving methods for the analysis and design of air transportation networks must address network performance in the face of increasing demands and the need to contain and control local network disturbances, such as congestion. Toward this end, we investigate functional relationships that govern the performance of transport networks; for example, the links between the first nontrivial eigenvalue of a network's Laplacian matrix - a quantitative measure of network synchronizability - and other global network parameters. In particular, among networks with a fixed degree distribution and fixed network assortativity (a measure of a network's preference to attach nodes based on a similarity or difference), those with the small eigenvalue are shown to be poor synchronizers, to have much longer shortest paths and to have greater clustering in comparison to those with large. A simulation of a respiratory network adds data to our investigation. This study is a beginning step in developing metrics and design variables for the analysis and active design of air transport networks.
Kincaid, Rex K.↗
Adaptive Bio-Inspired Wireless Network Routing for Planetary Surface Exploration
Wireless mobile networks suffer connectivity loss when used in a terrain that has hills, and valleys when line of sight is interrupted or range is exceeded. To resolve this problem and achieve acceptable network performance, we have designed an adaptive, configurable, hybrid system to automatically route network packets along the best path between multiple geographically dispersed modules. This is very useful in planetary surface exploration, especially for ad-hoc mobile networks, where computational devices take an active part in creating a network infrastructure, and can actually be used to route data dynamically and even store data for later transmission between networks. Using inspiration from biological systems, this research proposes to use ant trail algorithms with multi-layered information maps (topographic maps, RF coverage maps) to determine the best route through ad-hoc network at real time. The determination of best route is a complex one, and requires research into the appropriate metrics, best method to identify the best path, optimizing traffic capacity, network performance, reliability, processing capabilities and cost. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing through the use of pheromones. They are also able to adapt to changes in the environment using subtle clues. To use ant trail algorithms, we need to define the probability function. The artificial ant is, in this case, a software agent that moves from node to node on a network graph. The function to calculate the fitness (evaluate the better path) includes: length of the network edge, the coverage index, topology graph index, and pheromone trail left behind by other ant agents. Each agent modifies the environment in two different ways: 1) Local trail updating: As the ant moves between nodes it updates the amount of pheromone on the edge; and 2) Global trail updating: When all ants have completed a tour the ant that found the shortest route updates the edges in its path.
Alena, Richard I.↗
Tracking and data system support for the Pioneer project. Volume 2: Pioneer 11 prelaunch planning through second trajectory correction, to 1 May 1973
The tracking and data system support of the planning, testing, launch, near-earth, and deep space phases of the Pioneer 11 Jupiter Mission are described, including critical phases of spacecraft flight and guidance. Scientific instruments aboard the spacecraft registered information relative to interplanetary particles and fields. Knowledge of the celestial mechanics of the solar system was improved through radiometric data gathering. Network performance, details of network support activity, and special support activities are discussed.
Barton, W. R.↗
Deep Space Network equipment performance, reliability, and operations management information system
The Deep Space Mission System (DSMS) Operations Program Office and the DeepSpace Network (DSN) facilities utilize the Discrepancy Reporting Management System (DRMS) to collect, process, communicate and manage data discrepancies, equipment resets, physical equipment status, and to maintain an internal Station Log. A collaborative effort development between JPL and the Canberra Deep Space Communication Complex delivered a system to support DSN Operations.
discrepancy reporting DSN operations web-based too↗
Photonics and other approaches to high speed communications
Our research group of 4 faculty and about 10-15 graduate students was actively involved (as a group) in the development of computer communication networks for the last five years. Many of its individuals have been involved in related research for a much longer period. The overall research goal is to extend network performance to higher data rates, to improve protocol performance at most ISO layers and to improve network operational performance. We briefly state our research goals, then discuss the research accomplishments and direct your attention to attached and/or published papers which cover the following topics: scalable parallel communications; high performance interconnection between high data rate networks; and a simple, effective media access protocol system for integrated, high data rate networks.
Maly, Kurt↗
Deep Space Network equipment performance, reliability, and operations management using the discrepancy reporting management system (DRMS)
Explore the source record for details and available documents.
discrepancy reporting↗