Search NASA⌕ Search

SEARCH · Search NASA

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.

At least 595 records · Page 33

SuperCDMS Event Reconstruction Using Convolutional Neural Networks [Thesis]

The SuperCDMS experiment uses cryogenic silicon and germanium detectors to search for dark matter candidates such as WIMPs (Weakly Interacting Massive Particles) streaming through the Earth. Collisions in the silicon and germanium crystals are expected to produce phonons whose thermal signatures can be measured. This thesis first describes the integration of a new Signal Distribution Unit (SDU) to the SuperCDMS data acquisition system, which allows for synchronization of multiple detectors and electronic/mechanical noise characterization via accelerometer, antenna, and AC phase measurements. From SuperCDMS detector data it is necessary to reconstruct the energies of the particle events. This thesis explores the use of Convolutional Neural Networks (CNNs) to perform this reconstruction and finds that, although they perform well, changing the noise model breaks the model and requires the neural network to be retrained. In order to mitigate this issue, a new CNN model is proposed which includes the noise Power Spectral Density (PSD) of the data as an additional input to the CNN. While it proves to be effective as a denoising algorithm, it still fails for data with a different noise model. However, including data from multiple PSDs in the neural network training sample allows it to handle data with different types of noise while still maintaining the quality of the reconstruction. Nevertheless, neural networks trained even on multiple PSDs do not robustly handle data taken with PSDs dissimilar to those in the training sample, suggesting that CNNs may need to be retrained whenever the noise environment changes in a significant way.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Reconstructing the Hopfield network as an inverse Ising problem

We test four fast mean-field-type algorithms on Hopfield networks as an inverse Ising problem. The equilibrium behavior of Hopfield networks is simulated through Glauber dynamics. In the low-temperature regime, the simulated annealing technique is adopted. Although performances of these network reconstruction algorithms on the simulated network of spiking neurons are extensively studied recently, the analysis of Hopfield networks is lacking so far. For the Hopfield network, we found that, in the retrieval phase favored when the network wants to memory one of stored patterns, all the reconstruction algorithms fail to extract interactions within a desired accuracy, and the same failure occurs in the spin-glass phase where spurious minima show up, while in the paramagnetic phase, albeit unfavored during the retrieval dynamics, the algorithms work well to reconstruct the network itself. This implies that, as an inverse problem, the paramagnetic phase is conversely useful for reconstructing the network while the retrieval phase loses all the information about interactions in the network except for the case where only one pattern is stored. The performances of algorithms are studied with respect to the system size, memory load, and temperature; sample-to-sample fluctuations are also considered.

36 MATERIALS SCIENCE↗

Software defined network inference with evolutionary optimal observation matrices

A key requirement for network management is the accurate and reliable monitoring of relevant network characteristics. In today's large-scale networks, this is a challenging task due to the scarcity of network measurement resources and the hard constraints that this imposes. Here, this paper proposes a new framework, called SNIPER, which leverages the flexibility provided by Software-Defined Networking (SDN) to design the optimal observation or measurement matrix that can lead to the best achievable estimation accuracy using Matrix Completion (MC) techniques. To cope with the complexity of designing large-scale optimal observation matrices, we use the Evolutionary Optimization Algorithms (EOA) which directly target the ultimate estimation accuracy as the optimization objective function. We evaluate the performance of SNIPER using both synthetic and real network measurement traces from different network topologies and by considering two main applications for per-flow size and delay estimations. Our results show that SNIPER can be applied to a variety of network performance measurements under hard resource constraints. For example, by measuring only 8.8% of all per-flow path delays in Harvard network [1], congested paths can be detected with probability of 0.94. Finally, to demonstrate the feasibility of our framework, we also have implemented a prototype of SNIPER in Mininet.

97 MATHEMATICS AND COMPUTING↗

Toward higher-radix switches with co-packaged optics for improved network locality in data center and HPC networks [Invited]

In this work, we study the network locality improvements that can be achieved by using co-packaged optics in data center and high-performance computing (HPC) networks. The increased escape bandwidth offered by co-packaged optics can enable switches with speeds of 51.2 Tb/s and beyond. From a network architecture perspective, the key advantages of introducing co-packaged optics at the switch points include the implementation of large-scale topologies of >12,000 end points with 4× higher bisection bandwidth and the reduction of the required number of switches by >40% compared with state-of-the-art approaches. From a network operation perspective, improved network locality and faster operation can be achieved since the higher-radix switches can mitigate the impact of network contention. Placing applications under fewer leaf switches reduces the number of packets that cross the spine switches in a leaf-spine topology. The proposed scheme is evaluated via discrete-event simulations: we initially evaluate the network locality properties of the system by using virtual-machine traces from a production data center, and we subsequently quantify the performance improvements by simulating an all-to-all pattern for a variety of message sizes over a number of nodes. The results suggest that co-packaged optics form a promising solution for keeping up with bandwidth scaling in future networks. The virtual-machine analysis shows that large-scale applications can be placed under up to 50% fewer first-level switches, while the network analysis shows speedups of up to 7.1, which translates to execution time reductions of up to 26% and 42.7% for applications with communication ratios of 0.3 and 0.5, respectively.

99 GENERAL AND MISCELLANEOUS↗

A collaborative network middleware project by Lambda Station, TeraPaths, and Phoebus

The TeraPaths, Lambda Station, and Phoebus projects, funded by the US Department of Energy, have successfully developed network middleware services that establish on-demand and manage true end-to-end, Quality-of-Service (QoS) aware, virtual network paths across multiple administrative network domains, select network paths and gracefully reroute traffic over these dynamic paths, and streamline traffic between packet and circuit networks using transparent gateways. These services improve network QoS and performance for applications, playing a critical role in the effective use of emerging dynamic circuit network services. They provide interfaces to applications, such as dCache SRM, translate network service requests into network device configurations, and coordinate with each other to setup up end-to-end network paths. The End Site Control Plane Subsystem (ESCPS) builds upon the success of the three projects by combining their individual capabilities into the next generation of network middleware. ESCPS addresses challenges such as cross-domain control plane signalling and interoperability, authentication and authorization in a Grid environment, topology discovery, and dynamic status tracking. The new network middleware will take full advantage of the perfSONAR monitoring infrastructure and the Inter-Domain Control plane efforts and will be deployed and fully vetted in the Large Hadron Collider data movement environment.

99 GENERAL AND MISCELLANEOUS↗

JEDI-net: a jet identification algorithm based on interaction networks

Abstract We investigate the performance of a jet identification algorithm based on interaction networks (JEDI-net) to identify all-hadronic decays of high-momentum heavy particles produced at the LHC and distinguish them from ordinary jets originating from the hadronization of quarks and gluons. The jet dynamics are described as a set of one-to-one interactions between the jet constituents. Based on a representation learned from these interactions, the jet is associated to one of the considered categories. Unlike other architectures, the JEDI-net models achieve their performance without special handling of the sparse input jet representation, extensive pre-processing, particle ordering, or specific assumptions regarding the underlying detector geometry. The presented models give better results with less model parameters, offering interesting prospects for LHC applications.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Regulating Gas Transport in Molecularly Engineered Polymer Membranes (Final Technical Report)

Energy-efficient separation processes are essential for a wide range of applications ranging from clean fuels (e.g., hydrogen purification) and petroleum refining (e.g., natural gas processing) to water purification and carbon capture. Membrane-mediated separations have shown tremendous promise in providing high productivity and high separation efficiency at significantly lower energy consumption, e.g., up to 90% less energy cost than traditional thermally driven processes such as distillation. Polymeric membranes–the dominant separation membrane materials–have yet to reach their full potential due to their limitations in long-term durability (e.g., productivity loss over the period of their lifetime due to physical aging) or insufficient stability under harsh conditions (e.g., high temperature, chemically complex feeds). This research seeks to establish a new paradigm in polymer membrane material design by harnessing crosslinked model networks with well-defined yet finely tailorable microstructure to facilitate fast and selective gas transport and simultaneously enhance membrane stability. Unlike traditional randomly crosslinked polymers, which suffer from structural inconsistencies and consequently suboptimal gas separation performance, crosslinked model network membranes prepared via a precisely controlled end-linking process enables the creation of previously unattainable microstructure tunability, which, in turn, results in versatile crosslinked membranes with high separation performance that meet the needs of various challenging gas separations. Using model network framework as a fundamental tool by applying this concept in diverse polymer categories, this work has led to the development of various innovative crosslinked membrane structures such as unimodal, bimodal and clustered model networks. These advanced crosslinked polymer membranes not only demonstrate exceptional gas separation performance that significantly outperform existing randomly crosslinked membranes, but also possess excellent long-term durability and robust stability under complex operating conditions. From a fundamental perspective, results from this research provide critical mechanistic insights into gas separation in crosslinked polymer membranes, addressing key knowledge gaps and opening new avenues for membrane design to meet various separation needs. The new membrane materials produced from this research enable the use of polymeric membranes for high temperature gas separations, offering substantial energy and cost savings by eliminating the need for repeated cooling-heating cycles in industrial processes.

02 PETROLEUM↗

Understanding and Improving Energy Efficiency of Regional Mobility Systems Leveraging System-Level Data

Increased congestion required urban Americans to travel 6.8 billion hours more and purchase 3.1 billion gallons of fuel for a congestion cost of $\$$153 billion, according to the 2019 Urban Mobility Report. How to effectively manage the regional mobility system and improve the energy efficiency presents a big challenge to public agencies. Recent years have witnessed massive multi-jurisdictional multi-modal system-level data from various sources, which provides an unprecedented opportunity to improve the mobility system and its energy efficiency. However, implications of system-level data for mobility and energy efficiency are unclear. Those system-level data sets are siloed, spatially and temporally sparse, biased, not unified, and lacking of insights for system management. Consequently, there is a real need to acquire, fuse, mine and learn from multi-source system-level data to prepare public agencies to deal more effectively with large-scale energy efficiency modeling, management and planning. This project proposes to intensively review inexpensive, replicable and openly-accessible data from multi-modal systems, develop a data-driven system-level modeling framework enabled and validated by data, identify the energy inefficiencies of mobility systems from infrastructure, vehicles, passenger systems, and quantify the benefits of system-level strategies to improve mobility/energy efficiency. In addition, this research develops models to effectively estimate energy consumption and emissions from various types of vehicles on the roadway networks, with high granularity and high fidelity. Traditional models often heavily rely on aggregated infrastructure or vehicle/passenger data, for example, the census survey, land-use, and traffic counts of one or several classes, which may lead to research gaps considering the emerging vehicle technologies. Those models do not contain individual vehicular information. We propose an integrated data-driven method that combines multiple network modeling components, featuring the utilization of state-wide vehicle registration data. The additional vehicle registration data improve the model performance, and produce high-resolution vehicle-specific estimates of emissions and network performance metrics. Two case studies on the Pittsburgh and Philadelphia regional network show that the proposed method can efficiently and effectively estimate the emissions of a large-scale network, and provide valuable information for evaluating common management strategies.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

On the use of neural networks for energy reconstruction in high-granularity calorimeters

We contrasted the performance of deep neural networks — Convolutional Neural Network (CNN) and Graph Neural Network (GNN) — to current state of the art energy regression methods in a finely 3D-segmented calorimeter simulated by GEANT4. This comparative benchmark gives us some insight to assess the particular latent signals neural network methods exploit to achieve superior resolution. A CNN trained solely on a pure sample of pions achieved substantial improvement in the energy resolution for both single pions and jets over the conventional approaches. It maintained good performance for electron and photon reconstruction. We also used the Graph Neural Network (GNN) with edge convolution to assess the importance of timing information in the shower development for improved energy reconstruction. We implement a simple simulation based correction to the energy sum derived from the fraction of energy deposited in the electromagnetic shower component. This serves as an approximate dual-readout analogue for our benchmark comparison. Although this study does not include the simulation of detector effects, such as electronic noise, the margin of improvement seems robust enough to suggest these benefits will endure in real-world application. We also find reason to infer that the CNN/GNN methods leverage latent features that concur with our current understanding of the physics of calorimeter measurement.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Deep material network via a quilting strategy: visualization for explainability and recursive training for improved accuracy

Recent developments integrating micromechanics and neural networks offer promising paths for rapid predictions of the response of heterogeneous materials with similar accuracy as direct numerical simulations. The deep material network is one such approaches, featuring a multi-layer network and micromechanics building blocks trained on anisotropic linear elastic properties. Once trained, the network acts as a reduced-order model, which can extrapolate the material’s behavior to more general constitutive laws, including nonlinear behaviors, without the need to be retrained. However, current training methods initialize network parameters randomly, incurring inevitable training and calibration errors. Here, we introduce a way to visualize the network parameters as an analogous unit cell and use this visualization to “quilt” patches of shallower networks to initialize deeper networks for a recursive training strategy. The result is an improvement in the accuracy and calibration performance of the network and an intuitive visual representation of the network for better explainability.

97 MATHEMATICS AND COMPUTING↗

UCX: An Open Source Framework for HPC Network APIs and Beyond, In: 2015 IEEE 23rd Annual Symposium on High-Performance Interconnects

This paper presents Unified Communication X (UCX), a set of network APIs and their implementations for high throughput computing. UCX comes from the combined effort of national laboratories, industry, and academia to design and implement a high-performing and highly-scalable network stack for next generation applications and systems. UCX design provides the ability to tailor its APIs and network functionality to suit a wide variety of application domains and hardware. We envision these APIs to satisfy the networking needs of many programming models such as Message Passing Interface (MPI), OpenSHMEM, Partitioned Global Address Space (PGAS) languages, task-based paradigms and I/O bound applications. To evaluate the design we implement the APIs and protocols, and measure the performance of overhead-critical network primitives fundamental for implementing many parallel programming models and system libraries. Our results show that the latency, bandwidth, and message rate achieved by the portable UCX prototype is very close to that of the underlying driver. With UCX, we achieved a message exchange latency of 0.89 us, a bandwidth of 6138.5 MB/s, and a message rate of 14 million messages per second. As far as we know, this is the highest bandwidth and message rate achieved by any network stack (publicly known) on this hardware.

Computer Science↗

Method for detecting sophisticated cyber attacks

A method of analyzing computer intrusion detection information that looks beyond known attacks and abnormal access patterns to the critical information that an intruder may want to access. Unique target identifiers and type of work performed by the networked targets is added to audit log records. Analysis using vector space modeling, dissimilarity matrix comparison, and clustering of the event records is then performed.

97 MATHEMATICS AND COMPUTING↗

Quantifiable and objective approach to organizational performance enhancement.

This report describes a new methodology, social language network analysis (SLNA), that combines tools from social language processing and network analysis to identify socially situated relationships between individuals which, though subtle, are highly influential. Specifically, SLNA aims to identify and characterize the nature of working relationships by processing artifacts generated with computer-mediated communication systems, such as instant message texts or emails. Because social language processing is able to identify psychological, social, and emotional processes that individuals are not able to fully mask, social language network analysis can clarify and highlight complex interdependencies between group members, even when these relationships are latent or unrecognized. This report outlines the philosophical antecedents of SLNA, the mechanics of preprocessing, processing, and post-processing stages, and some example results obtained by applying this approach to a 15-month corporate discussion archive.

99 GENERAL AND MISCELLANEOUS↗

Stardust Network Measurement Components (esnet-stardust-components) v1

This software contains a set of components that allow us to measure and analyze the use and performance of computer networks using existing off the shelf Open Source components organized into a scalable and extensible system. The components were developed for and used within ESnet's Stardust Measurement Environment. The components are used to collect, process and display network measurement data in an architecture that employs a combination of Elasticsearch, Logstash and Grafana. The advantage of this approach is we can tailor system behavior to our analytical needs and expand its capability with new types of network measurement without waiting for a commercial vendor to support our fairly niche use cases. Additionally we have existing collaborations within our community that came about from prior research efforts that will benefit from the release of this software so that others can also contribute features.

Balas, Edward↗

QC-GN 2 oMS 2 : a Graph Neural Net for High Resolution Mass Spectra Prediction

Predicting the mass spectrum of a molecular ion is often accomplished via three generalized approaches: rules-based methods for bond breaking, deep learning, or quantum chemical (QC) modeling. Rules-based approaches are often limited by the conditions for different chemical subspaces and perform poorly under chemical regimes with few defined rules. QC modeling is theoretically robust but requires significant amounts of computational time to produce a spectrum for a given target. Among deep learning techniques, graph neural networks (GNNs) have performed better than previous work with fingerprint-based neural networks in mass spectra prediction. To explore this technique further, we investigate the effects of including quantum chemically derived information as edge features in the GNN to increase predictive accuracy. The models we investigated include categorical bond order, bond force constants derived from extended tight-binding (xTB) quantum chemistry, and acyclic bond dissociation energies. Throughout this work, we evaluated these models against a control GNN with no edge features in the input graphs. Bond dissociation enthalpies yielded the best improvement with a cosine similarity score of 0.462 relative to the baseline model (0.437). In this work we also apply dynamic graph attention which improves performance on benchmark problems and supports the inclusion of edge features. Between implementations, we investigate the nature of the molecular embedding for spectra prediction and discuss the recognition of fragment topographies in distinct chemistries for further development in tandem mass spectrometry prediction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Extraction of the muon signals recorded with the surface detector of the Pierre Auger Observatory using recurrent neural networks

The Pierre Auger Observatory, at present the largest cosmic-ray observatory ever built, is instrumented with a ground array of 1600 water-Cherenkov detectors, known as the Surface Detector (SD). The SD samples the secondary particle content (mostly photons, electrons, positrons and muons) of extensive air showers initiated by cosmic rays with energies ranging from 1017eV up to more than 1020eV. Measuring the independent contribution of the muon component to the total registered signal is crucial to enhance the capability of the Observatory to estimate the mass of the cosmic rays on an event-by-event basis. However, with the current design of the SD, it is difficult to straightforwardly separate the contributions of muons to the SD time traces from those of photons, electrons and positrons. In this paper, we present a method aimed at extracting the muon component of the time traces registered with each individual detector of the SD using Recurrent Neural Networks. We derive the performances of the method by training the neural network on simulations, in which the muon and the electromagnetic components of the traces are known. We conclude this work showing the performance of this method on experimental data of the Pierre Auger Observatory. We find that our predictions agree with the parameterizations obtained by the AGASA collaboration to describe the lateral distributions of the electromagnetic and muonic components of extensive air showers.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Learning to Unknot

We introduce natural language processing into the study of knot theory, as made natural by the braid word representation of knots. We study the UNKNOT problem of determining whether or not a given knot is the unknot. After describing an algorithm to randomly generate N-crossing braids and their knot closures and discussing the induced prior on the distribution of knots, we apply binary classification to the UNKNOT decision problem. We find that the Reformer and shared-QK Transformer network architectures outperform fully-connected networks, though all perform at 95% accuracy. Perhaps surprisingly, we find that accuracy increases with the length of the braid word, and that the networks learn a direct correlation between the confidence of their predictions and the degree of the Jones polynomial. Finally, we utilize reinforcement learning (RL) to find sequences of Markov moves and braid relations that simplify knots and can identify unknots by explicitly giving the sequence of unknotting actions. Trust region policy optimization (TRPO) performs consistently well, reducing 80% of the unknots with up to 96 crossings we tested to the empty braid word, and thoroughly outperformed other RL algorithms and random walkers. Studying these actions, we find that braid relations are more useful in simplifying to the unknot than one of the Markov moves.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hybrid PDES Simulation of HPC Networks Using Zombie Packets

Although high-fidelity network simulations have proven to be reliable and cost-effective tools to peer into architectural questions for high-performance computing (HPC) networks, they incur a high resource cost. The time spent in simulating a single millisecond of network traffic in the highest detail can take hours, even for static, well-behaved traffic patterns such as uniform random. Surrogate models offer a significant reduction in runtime, yet they cannot serve as complete replacements and should only be used when appropriate. Thus, there is a need for hybrid modeling, where high-fidelity simulation and surrogates run side-by-side. Here, we present a surrogate model for HPC networks in which: packets bypass the network, while the network state is left untouched, i.e., suspended. To bypass the network, we use historical data to estimate the arrival time at which every packet should be scheduled at; to suspend the network, all in-flight packets are scheduled to arrive at their destinations, and are kept in the system to awaken as zombies when switching back to high-fidelity. Speedup for a hybrid model is relative to the proportion of surrogate to high-fidelity. This light-weight surrogate obtained up to 76× speedup. Keeping the zombies in the network showed an increase in the accuracy of the high-fidelity simulation on restart when compared to restarting the network from an empty state.

HPC networks↗