Search NASA⌕ Search

SEARCH · Search NASA

Results for “network”

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 1,045 records · Page 58

Heterogeneous Spacecraft Networks

The present invention provides a heterogeneous spacecraft network including a network management architecture to facilitate communication between a plurality of operations centers and a plurality of data user communities. The network management architecture includes a plurality of network nodes in communication with the plurality of operations centers. The present invention also provides a method of communication for a heterogeneous spacecraft network. The method includes: transmitting data from a first space segment to a first ground segment; transmitting the data from the first ground segment to a network management architecture; transmitting data from a second space segment to a second ground segment, the second space and ground segments having incompatible communication systems with the first space and ground segments; transmitting the data from the second ground station to the network management architecture; and, transmitting data from the network management architecture to a plurality of data user communities.

Nakamura, Yosuke↗

The Network for the Detection of Atmospheric Composition Change (NDACC): History, Status and Perspectives

The Network for the Detection of Atmospheric Composition Change (NDACC) is an international global network of more than 90 stations making high-quality measurements of atmospheric composition that began official operations in 1991 after 5 years of planning. Apart from sonde measurements, all measurements in the network are performed by ground-based remote-sensing techniques. Originally named the Network for the Detection of Stratospheric Change (NDSC), the name of the network was changed to NDACC in 2005 to better reflect the expanded scope of its measurements. The primary goal of NDACC is to establish long-term databases for detecting changes and trends in the chemical and physical state of the atmosphere (mesosphere, stratosphere, and troposphere) and to assess the coupling of such changes with climate and air quality. NDACC's origins, station locations, organizational structure, and data archiving are described. NDACC is structured around categories of ground-based observational techniques (sonde, lidar, microwave radiometers, Fourier-transform infrared, UV-visible DOAS (differential optical absorption spectroscopy)-type, and Dobson-Brewer spectrometers, as well as spectral UV radiometers), timely cross-cutting themes (ozone, water vapour, measurement strategies, cross-network data integration), satellite measurement systems, and theory and analyses. Participation in NDACC requires compliance with strict measurement and data protocols to ensure that the network data are of high and consistent quality. To widen its scope, NDACC has established formal collaborative agreements with eight other cooperating networks and Global Atmosphere Watch (GAW). A brief history is provided, major accomplishments of NDACC during its first 25 years of operation are reviewed, and a forward-looking perspective is presented.

lidar↗

Potential Improvements in Global Carbon Flux Estimates from a Network of Laser Heterodyne Radiometer Measurements of Column Carbon Dioxide

We present observing system simulation experiments (OSSEs) to evaluate the impact of a proposed network of ground-based miniaturized laser heterodyne radiometer (mini-LHR) instruments that measure atmospheric column-averaged carbon dioxide (XCO2) with a 1 ppm precision. A particular strength of this passive measurement approach is its insensitivity to clouds and aerosols due to its direct sun pointing and narrow field of view (0.2°). Developed at the NASA Goddard Space Flight Center (GSFC), these portable, low-cost mini-LHR instruments were designed to operate in tandem with the sun photometers used by the AErosol RObotic NETwork (AERONET). This partnership allows us to leverage the existing framework of AERONET's global ground network of more than 500 sites as well as providing simultaneous measurements of aerosols that are known to be a major source of error in retrievals of XCO2 from passive nadir-viewing satellite observations. We show, using the global 3-D GEOS-Chem chemistry transport model, that a deployment of 50 mini-LHRs at strategic (but not optimized) AERONET sites significantly improves our knowledge of global and regional land-based CO2 fluxes. This improvement varies seasonally and ranges 58%–81% over southern lands, 47%–76% over tropical lands, 71%–92% over northern lands, and 64%–91% globally. We also show significant added value from combining mini-LHR instruments with the existing ground-based NOAA flask network. Collectively, these data result in improved a posteriori CO2 flux estimates on spatial scales of ∼10 km2, especially over North America and Europe, where the ground-based networks are densest. Our studies suggest that the mini-LHR network could also play a substantive role in reducing carbon flux uncertainty in Arctic and tropical systems by filling in geographical gaps in measurements left by ground-based networks and space-based observations. A realized network would also provide necessary data for the quinquennial global stock takes that form part of the Paris Agreement.

Palmer, Paul I.↗

Working Toward A National Coordinated Soil Moisture Monitoring Network: Vision, Progress, and Future Directions

Soil moisture is a critical land surface variable, impacting the water, energy, and carbon cycles. While in situ soil moisture monitoring networks are still developing, there is no cohesive strategy or framework to coordinate, integrate, or disseminate these diverse data sources in a synergistic way that can improve our ability to understand climate variability at the national, state, and local levels. Thus, a national strategy is needed to guide network deployment, sustainable network operation, data integration and dissemination, and user-focused product development. The National Coordinated Soil Moisture Monitoring Network (NCSMMN) is a federally led, multi-institution effort that aims to address these needs by capitalizing on existing wide-ranging soil moisture monitoring activities, increasing the utility of observational data, and supporting their strategic application to the full range of decision-making needs. The goals of the NCSMMN are to 1) establish a national “network of networks” that effectively demonstrates data integration and operational coordination of diverse in situ networks; 2) build a community of practice around soil moisture measurement, interpretation, and application—a “network of people” that links data providers, researchers, and the public; and 3) support research and development (R&D) on techniques to merge in situ soil moisture data with remotely sensed and modeled hydrologic data to create user-friendly soil moisture maps and associated tools. The overarching mission of the NCSMMN is to provide coordinated high-quality, nationwide soil moisture information for the public good by supporting applications like drought and flood monitoring, water resource management, agricultural and forestry planning, and fire danger ratings.

C. Bruce Baker↗

Diagnosing Anomalous Network Performance with Confidence

Variability in network performance is a major obstacle in effectively analyzing the throughput of modern high performance computer systems. High performance interconnection networks offer excellent best-case network latencies; however, highly parallel applications running on parallel machines typically require consistently high levels of performance to adequately leverage the massive amounts of available computing power. Performance analysts have usually quantified network performance using traditional summary statistics that assume the observational data is sampled from a normal distribution. In our examinations of network performance, we have found this method of analysis often provides too little data to understand anomalous network performance. In particular, we examine a multi-modal performance scenario encountered with an Infiniband interconnection network and we explore the performance repeatability on the custom Cray SeaStar2 interconnection network after a set of software and driver updates.

99 GENERAL AND MISCELLANEOUS↗

Examining Anomalous Network Performance with Confidence

Variability in network performance is a major obstacle in effectively analyzing the throughput of modern high performance computer systems. High performance interconnection networks offer excellent best-case network latencies; however, highly parallel applications running on parallel machines typically require consistently high levels of performance to adequately leverage the massive amounts of available computing power. Performance analysts have usually quantified network performance using traditional summary statistics that assume the observational data is sampled from a normal distribution. In our examinations of network performance, we have found this method of analysis often provides too little data to understand anomalous network performance. In particular, we examine a multi-modal performance scenario encountered with an Infiniband interconnection network and we explore the performance repeatability on the custom Cray SeaStar2 interconnection network after a set of software and driver updates.

99 GENERAL AND MISCELLANEOUS↗

Real-time method for establishing a detection map for a network of sensors

A method for establishing a detection map of a dynamically configurable sensor network. This method determines an appropriate set of locations for a plurality of sensor units of a sensor network and establishes a detection map for the network of sensors while the network is being set up; the detection map includes the effects of the local terrain and individual sensor performance. Sensor performance is characterized during the placement of the sensor units, which enables dynamic adjustment or reconfiguration of the placement of individual elements of the sensor network during network set-up to accommodate variations in local terrain and individual sensor performance. The reconfiguration of the network during initial set-up to accommodate deviations from idealized individual sensor detection zones improves the effectiveness of the sensor network in detecting activities at a detection perimeter and can provide the desired sensor coverage of an area while minimizing unintentional gaps in coverage.

47 OTHER INSTRUMENTATION↗

Calculating a checksum with inactive networking components in a computing system

Calculating a checksum utilizing inactive networking components in a computing system, including: identifying, by a checksum distribution manager, an inactive networking component, wherein the inactive networking component includes a checksum calculation engine for computing a checksum; sending, to the inactive networking component by the checksum distribution manager, metadata describing a block of data to be transmitted by an active networking component; calculating, by the inactive networking component, a checksum for the block of data; transmitting, to the checksum distribution manager from the inactive networking component, the checksum for the block of data; and sending, by the active networking component, a data communications message that includes the block of data and the checksum for the block of data.

97 MATHEMATICS AND COMPUTING↗

Calculating a checksum with inactive networking components in a computing system

Calculating a checksum utilizing inactive networking components in a computing system, including: identifying, by a checksum distribution manager, an inactive networking component, wherein the inactive networking component includes a checksum calculation engine for computing a checksum; sending, to the inactive networking component by the checksum distribution manager, metadata describing a block of data to be transmitted by an active networking component; calculating, by the inactive networking component, a checksum for the block of data; transmitting, to the checksum distribution manager from the inactive networking component, the checksum for the block of data; and sending, by the active networking component, a data communications message that includes the block of data and the checksum for the block of data.

97 MATHEMATICS AND COMPUTING↗

Utilizing Genetic Programming to Identify Failures in ICS Networks

Previously, researchers have attempted to apply machine learning techniques to network anomaly detection problems. Due to the staggering amount of variety that can occur in normal networks, the results have often been underwhelming. These challenges are far less pronounced when considering industrial control system (ICS) networks. The recurrent nature of these networks results in less noise and more consistent patterns for a machine learning algorithm to recognize. Here, we propose a method of evolving decision trees through genetic programming (GP) in order to detect network anomalies, such as device outages. Our approach extracts over a dozen features from network packet captures and netflows, normalizes them, and relates them in decision trees using fuzzy logic operators. Furthermore, the trees were used to detect three specific network events from three different points on the network across a statistically significant number of runs and achieved 100% accuracy on five of the nine experiments. When the trees attempted to detect more challenging events at points of presence further from the occurrence, the accuracy averaged to above 98%. Finally, using our method, all of the evolutionary cycles of the GP algorithm are computed a-priori, allowing the best resultant trees to be deployed as semi-real-time sensors with little overhead.

97 MATHEMATICS AND COMPUTING↗

Switch-connected HyperX network

A network system includes a plurality of sub-network planes and global switches. The sub-network planes have a same network topology as each other. Each of the sub-network planes includes edge switches. Each of the edge switches has N ports. Each of the global switches is configured to connect a group of edge switches at a same location in the sub-network planes. In each of the sub-network planes, some of the N ports of each of the edge switches are connected to end nodes, and others of the N ports are connected to other edge switches in the same sub-network plane, other of the N ports are connected to at least one of the global switches.

42 ENGINEERING↗

Technologies for increasing bandwidth in partitioned hierarchical networks

Technologies for increasing the bandwidth of partitioned hierarchical networks is disclosed. If each partition of network groups of a computer network are isolated, then the connections between the network groups of different partitions may go unused. However, careful selection of the network connections between partitions of different network groups may allow for a pseudo-direct connection between two network groups of the same partition using a single non-blocking switch in a network group of a different partition. Such a configuration can increase the effective bandwidth available within a partition without affecting the bandwidth available in another partition.

Flajslik, Mario↗

Continuous Test and Transition Infrastructure for Quantum Networking for Science Complex

We propose a network architecture with a separate quantum dataplane and a conventional control plane: (a) Quantum Data Plane: The Quantum Data plane consists of links of dark fibers connecting quantum switches and repeaters, which in turn, connect to quantum computers, memory and sensors. Since the current reach is limited to local areas, it will begin as a collection of site networks at laboratories, (b) Conventional Control Plane: The Control plane provides management access to quantum devices for configuration and provisioning via control nodes with firewall and encryption capabilities. Continuous Test and Transition Infrastructure: We propose an infrastructure with a control plane connecting multiple sites via encrypted tunnels over conventional networks consisting of the following: (a) Site Quantum Networks: Individual site networks supported by their fiber plants connect laboratories that house and connect to their quantum devices for testing and interoperability.(b) Site Control Planes: Sites are connected over individual control planes with control hosts with Software Defined Networking capabilities, which can be peered with other networks via ESnet.(c) Progressive Expansion: Initially, sites will develop individual data planes with their specific quantum devices and fiber connections, and mechanisms to interface with conventional networks. They progressively expand and interconnect, under a wide-area ecosystem of peered control planes for device testing, interoperability development and roll off into production environments.

Rao, Nageswara S.↗

One step removed shadow network

A system and method includes an operational network that communicates with an external network by opening a first transmission protocol socket. A data diode coupled to the operational network and a gateway enables the one-way transfer of all information received from the external network and transmitted by the operational network to the gateway such that no information travels from the gateway to the operational network or the external network. The gateway opens a second transmission protocol socket by mapping a sequence number to an acknowledgement number and increasing that mapped acknowledgement number by a value of one. A transmitter then transmits the acknowledgment to a remote network or a gateway.

Park, Brent K.↗

Learning Distributed Geometric Koopman Operator for Sparse Networked Dynamical Systems

Koopman operator theory provides an alternative to study nonlinear networked dynamical systems by mapping the state space to an abstract higher dimensional space where the system evolution is linear. Recent works show the application of graph neural networks (GNNs) to learn state to object-centric embeddings and achieve centralized block-wise computation of Koopman operator (KO) under additional assumptions on the underlying agents properties and constraints on the KO structure. However, the computational complexity of learning the Koopman increases exponentially for networked systems where the number of possible system states grows in a combinatorial fashion with the number of nodes. The learning challenge is further amplified for sparse networks by two factors: 1) sample sparsity for learning the Koopman operator in the non-linear space, and 2) the divergence in the dynamics of individual nodes or from one subgraph to another. Our work aims to address these challenge by formulating the representation learning of networked dynamical systems into a multi-agent paradigm and learning the Koopman operator in a distributive manner. The computational as well as performance advantages of distributed Koopman is predominant for sparse networks whereas for fully connected networks, it is shown to coincide with the centralized one. The empirical study on rope system, network of oscillators and a synthetic power system show comparable and superior performance along with computational benefits with the state-of-the-art methods.

Mukherjee, Sayak↗

Spiral antenna assembly with integrated feed network structure and method of manufacture

A spiral antenna assembly with an integrated feed network and method of manufacturing the same are disclosed. The spiral antenna assembly may comprise a supporting structure integrally formed with a feed network structure, thereby presenting a monolithic structure. A spiral antenna element may be disposed on a bottom surface or a top surface of the supporting structure. The feed network structure may comprise the feed network and project from a center of the top surface of the supporting structure. The feed network may comprise a microstrip balun architecture. The spiral antenna assembly may be formed by additively manufacturing the supporting structure and the feed network structure. A laser direct structuring process may write and activate the spiral antenna element on the supporting structure and the feed network on the feed network structure.

Byers, Kyle J.↗

A Network Inference Workflow Applied to Virulence-Related Processes in Salmonella typhimurium

Inference of the structure of mRNA transcriptional regulatory networks, protein regulatory or interaction networks, and protein activation/inactivation-based signal transduction networks are critical tasks in systems biology. In this article we discuss a workflow for the reconstruction of parts of the transcriptional regulatory network of the pathogenic bacterium Salmonella typhimurium based on the information contained in sets of microarray gene expression data now available for that organism, and describe our results obtained by following this workflow. The primary tool is one of the network inference algorithms deployed in the Software Environment for BIological Network Inference (SEBINI). Specifically, we selected the algorithm called Context Likelihood of Relatedness (CLR), which uses the mutual information contained in the gene expression data to infer regulatory connections. The associated analysis pipeline automatically stores the inferred edges from the CLR runs within SEBINI and, upon request, transfers the inferred edges into either Cytoscape or the plug-in Collective Analysis of Biological of Biological Interaction Networks (CABIN) tool for further post-analysis of the inferred regulatory edges. The following article presents the outcome of this workflow, as well as the protocols followed for microarray data collection, data cleansing, and network inference. Our analysis revealed several interesting interactions, functional groups, metabolic pathways, and regulons in S. typhimurium.

59 BASIC BIOLOGICAL SCIENCES↗

Class network routing

Class network routing is implemented in a network such as a computer network comprising a plurality of parallel compute processors at nodes thereof. Class network routing allows a compute processor to broadcast a message to a range (one or more) of other compute processors in the computer network, such as processors in a column or a row. Normally this type of operation requires a separate message to be sent to each processor. With class network routing pursuant to the invention, a single message is sufficient, which generally reduces the total number of messages in the network as well as the latency to do a broadcast. Class network routing is also applied to dense matrix inversion algorithms on distributed memory parallel supercomputers with hardware class function (multicast) capability. This is achieved by exploiting the fact that the communication patterns of dense matrix inversion can be served by hardware class functions, which results in faster execution times.

97 MATHEMATICS AND COMPUTING↗