SEARCH · Search NASA
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.
This software is an extension to OTM (Open Traffic Models), which is an open-source traffic simulator maintained at the Institute of Transportation Studies at U.C. Berkeley. OTM-MPI provides functionality for running OTM simulations in distributed computing environments. Its functionality includes min-cut division of traffic networks (using METIS), deployment of sub-networks on multiple compute nodes, and inter-node MPI communications.
Through a series of Continuous Improvement Workshops in 2019, network stakeholders identified opportunities for improved coordination, training, procedures and communication across all levels of the Weatherization Assistance Program. Actionable ideas generated through the Continuous Improvement Workshops were synthesized by the National Renewable Energy Laboratory and are presented in this report for DOE's consideration.
If the United States (U.S.) government allows cyberattacks to continue on their current trajectory of increased frequency and effect, the bonds holding our society together will be jeopardized, potentially impacting the survival of our society as we know it. Actions must be taken not only to defend against, but also to deter future cyberattacks. To achieve a credible and actionable U.S. Cyber Deterrence Strategy, the following three lines of effort are recommended for implementation by the White House: 1. Add a sixth priority to the Obama Administration's current cyberspace priorities to state: "Advance our cyber response policies and capabilities to further protect the country's national interests by deterring attacks within cyberspace." 2. Adopt the proposed Cyber Deterrence Analytic Framework as a guide for policy makers to use when determining the appropriate response to a cyberattack. 3. Implement the proposed Presidential Policy Directive outlining the United States' deterrence policy for cyber. These recommendations for establishing a U.S. Cyber Deterrence Strategy address the following key findings: As the U.S. private sector owns and operates over 90% of all of the networks and infrastructure of cyberspace, an effective policy must be communicated clearly across the government, business enterprise, and most importantly, to the people; More so than any time in our nation's history, individuals, companies, and organizations depend on cyberspace for uses ranging from social interactions to sustaining democracy; Threats existing within the cyber domain have grown both in attack vector complexity and societal impact; and, The current Presidential Executive Orders and Policy Directives related to cyber deterrence do not include a strategy for deterring attacks. The concepts presented in this paper were derived from interviews with experts in subjects ranging from deterrence philosophy, nuclear weapons implementation, U.S. cyber operations, and U.S. cyber policy. In addition, theories on deterrence strategies are explored, ranging from the 1960s to present to develop a deterrence strategy unique to cyber. Lastly, recent examples of cyberattacks are examined to provide evidence for the need to establish consequences for those individuals or countries that continue to behave nefariously within cyberspace. To form a strong foundation for a U.S. Cyber Deterrence Strategy, the U.S. must establish and clearly articulate the consequences for nations or individuals if they choose to initiate a cyberattack on the U.S. or its national interests.
Recent efforts at Sandia such as DataSEA are creating search engines that enable analysts to query the institution’s massive archive of simulation and experiment data. The benefit of this work is that analysts will be able to retrieve all historical information about a system component that the institution has amassed over the years and make better-informed decisions in current work. As DataSEA gains momentum, it faces multiple technical challenges relating to capacity storage. From a raw capacity perspective, data producers will rapidly overwhelm the system with massive amounts of data. From an accessibility perspective, analysts will expect to be able to retrieve any portion of the bulk data, from any system on the enterprise network. Sandia’s Institutional Computing is mitigating storage problems at the enterprise level by procuring new capacity storage systems that can be accessed from anywhere on the enterprise network. These systems use the simple storage service, or S3, API for data transfers. While S3 uses objects instead of files, users can access it from their desktops or Sandia’s high-performance computing (HPC) platforms. S3 is particularly well suited for bulk storage in DataSEA, as datasets can be decomposed into object that can be referenced and retrieved individually, as needed by an analyst. In this report we describe our experiences working with S3 storage and provide information about how developers can leverage Sandia’s current systems. We present performance results from two sets of experiments. First, we measure S3 throughput when exchanging data between four different HPC platforms and two different enterprise S3 storage systems on the Sandia Restricted Network (SRN). Second, we measure the performance of S3 when communicating with a custom-built Ceph storage system that was constructed from HPC components. Overall, while S3 storage is significantly slower than traditional HPC storage, it provides significant accessibility benefits that will be valuable for archiving and exploiting historical data. There are multiple opportunities that arise from this work, including enhancing DataSEA to leverage S3 for bulk storage and adding native S3 support to Sandia’s IOSS library.
Techniques are provided for computing data and metadata layout prior to storage in a storage system using a processing platform. An exemplary processing platform comprises one or more of a compute node and a burst buffer appliance. The processing platform communicates with a plurality of the compute nodes over a network, wherein a plurality of applications executing on the plurality of compute nodes generate a plurality of data objects; computes erasure metadata for one or more of the data objects on at least one of the compute nodes; and provides the erasure metadata with the corresponding one or more data objects to a storage system. The processing platform optionally determines a full set of the data objects to be stored and queries the storage system to determine an anticipated layout of the full set of the data objects to be stored. The anticipated layout allows special handling, for example, for small files and large files that are identified based on predefined criteria.
A communication system is provided that include one or more processors that are configured to instruct computing devices that communicate messages with each other via a time-sensitive network to securely exchange the messages using secret information, ad direct the computing devices to exchange the secret information via a dedicated quantum channel in the time-sensitive network. The one or more processors are also configured to determine a quantum channel synchronization time associated with the secret information exchanged via the dedicated quantum channel, and modify a local classical oscillator based on the quantum channel synchronization time, the local classical oscillator configured to provide a current time.
This disclosure presents distributed and decentralized synchronization for wireless transceivers. The disclosed system, device, and method achieve sub-nanosecond synchronization using low-cost commercial off the shelf software defined radios. By providing a decentralized mechanism that does not rely on a hierarchical master-slave structure, networks constructed as disclosed are robust to sensor drop-out in contested or harsh environments. Such networks may be used to create phased array radars and communication systems without requiring wired connections to distribute a common clock or local oscillator reference.
The North American electric grid relies on a complex communications infrastructure that extends beyond facility perimeters traditionally covered by NERC Critical Infrastructure Protection (CIP) standards. While CIP requirements have significantly strengthened cybersecurity within Electronic Security Perimeters, many operational communications—such as those between control centers, substations, and third-party networks—fall outside current regulatory scope. As grid modernization introduces new technologies and connectivity models, these external pathways present evolving security challenges. This brief explores the nature of these challenges, including emerging attack vectors and supply chain considerations, and highlights how ongoing grid transformation increases exposure to sophisticated threats. It outlines practical strategies and policy options to complement existing standards, such as expanding secure communications practices, enhancing supply chain transparency, and fostering collaboration among federal, state, and industry stakeholders. Near-term actions like encryption, authentication, and contractual safeguards can help reduce risk while longer-term frameworks are developed to ensure resilient and secure grid operations.
Here, we propose a feedback control approach for solving optimal power flow (OPF) problems in power distribution networks (DNs) based on a projected gradient scheme, where the cost is given by the sum of functions of local power injections. This approach does not require detailed knowledge of the grid model and enables real-time tracking of the optimal generation configuration. Moreover, the communication burden is minimal: only a broadcast from a central entity, called the Network Supervisor (NS), to the agents in the network is needed. Hence, agents do not have to share local information that can be sensitive, e.g., their power injections or the value of the local costs. Our approach is then used to solve a particular OPF problem targeting DNs with high penetration of distributed energy resources (DERs) in which the energy cost is given by the remuneration that the DERs owners receive for the service they provide.
An islanded microgrid can be used to serve critcal load as a resiliency source when a severe outage occurs. In an islanded mode, control of a microgrid relies on the communication system significantly. Hence, microgrids are cyberphysical systems and, therefore, the cyber system plays a crucial role in the performance of the cyber-power system. A microgrid control scheme is proposed for power dispatch and regulation based on the droop and proportional-integral (PI) feedback control. The proposed control strategy is validated for transient stability following dynamic events. To evaluate the impact of a networked control system on control performance, a cyber model is developed to represent data acquisition periods and communication delays. An analytical method is proposed to determine the critical values for the data reporting periods and communication delays. The analytical method based on a state space model of a networked control system is applicable for large-scale systems. A 2-dimensional stability region of a microgrid in the space of cyber parameters can be obtained by the proposed method, and the critical values of cyber parameters are determined based on the stability region. Simulation results validate that the design of a microgrid as a cyber-physical system needs to be guided by critical values for the data reporting period and communication delay to prevent system instability.
Urban environmental monitoring networks frequently encounter significant data gaps due to sensor malfunctions, environmental disturbances, and communication failures. Reliable approaches to address these gaps are essential for ensuring the continuity and quality of environmental data streams. In this study, we developed a gated attention bidirectional long short-term memory (GA-BiLSTM) model to impute missing data in a dense urban monitoring network. Using observations from the CROCUS network in Chicago, we evaluated GA-BiLSTM against widely used approaches (XGBoost and K-nearest neighbors) under scenarios of both short-term intermittent gaps and prolonged outages. GA-BiLSTM consistently outperformed comparative methods, particularly during extended outages of up to ten days, demonstrating its ability to capture spatiotemporal dependencies across sensor nodes. Beyond performance metrics, feature importance and spatial network analyses highlighted the unexpected but critical predictive role of peripheral rural nodes, underlining their strategic value for maintaining robust urban monitoring systems. These results emphasize that advanced imputation methods can substantially improve the reliability of environmental monitoring networks and support more resilient data infrastructures for urban sustainability.
Interference between independently generated photons is a key step towards distributing entanglement over long distances, but it requires synchronization between the distantly-located photon sources. Synchronizing the clocks of such photon sources using coexisting two-way classical optical communications over the same fiber that transports the quantum photonic signals is a promising approach for achieving photon-photon interference over long distances, enabling entanglement distribution for quantum networking using the deployed fiber infrastructure. Here, we demonstrate photon-photon interference by observing the Hong-Ou-Mandel dip between two distantly-located sources: a weak coherent-state source obtained by attenuating the output of a laser and a heralded single-photon source. We achieve a maximum dip visibility of 0.58 +/- 0.04 when the two sources are connected via 4.3 km of deployed fiber. Dip visibilities > 0.5 are nonclassical and a first step towards achieving teleportation over the deployed fiber infrastructure. In our experiment, the classical optical communication is achieved with - 21 dBm of optical signal launch power, which is used to synchronize the clocks in the two independent, distantly-located photon sources. The impact of spontaneous Raman scattering from the classical optical signals is mitigated by appropriate choice of the quantum- and classical-channel wavelengths. All equipment used in our experiment (the photon sources and the synchronization setup) is commercially available. Finally, our experiment represents a scalable approach to enabling practical quantum networking with commercial equipment and coexistence with classical communications in optical fiber.
We demonstrate the realization of quantum key distribution (QKD) when combined with classical optical communication, and synchronous signals within a single optical fiber. In the experiment, the classical communication sources use Fabry-Pérot (FP) lasers, which are implemented extensively in optical access networks. To perform QKD, multistage band-stop filtering techniques are developed, and a wavelength-division multiplexing scheme is designed for the multi-longitudinal-mode FP lasers. We have managed to maintain sufficient isolation among the quantum channel, the synchronous channel and the classical channels to guarantee good QKD performance. Finally, the quantum bit error rate remains below a level of 2% across the entire practical application range. The proposed multiplexing scheme can ensure low classical light loss, and enables QKD over fiber lengths of up to 45 km simultaneously when the fibers are populated with bidirectional FP laser communications. Our demonstration paves the way for application of QKD to current optical access networks, where FP lasers are widely used by the end users.
Active distribution system resources have the potential to support the bulk power system (BPS) during abnormal conditions, increasing reliability and resilience of power systems and end-use customers. This paper investigates for the first time the BPS voltage support provided by networked microgrids at the feeder level. A peer-to-peer (P2P) communication control framework is introduced to enable the coordination of multiple microgrids in a mixed ownership environment. This allows the microgrids to run a consensus algorithm (CA) to distributedly determine their own reactive power injections. Thus, the reactive power injection contribution is realized in a fair manner by having the same ratio of reactive power injection to the reactive power headroom for all microgrids. The CA implementation and performance within the P2P network framework are demonstrated on the IEEE 39-bus testcase system with 10 microgrids part of the distribution feeder assumed to be connected to one of the BPS buses.
Scientific computations are expected to be increasingly distributed across wide-area networks, and Message Passing Interface (MPI) has been shown to scale to support their communications over long distances. Application-level measurements of MPI operations reflect the connection Round-Trip Time (RTT) and loss rate, and machine learning methods have been previously developed to estimate them under deterministic periodic losses. In this paper, we consider more complex, random losses with unform, Poisson and Gaussian distributions. We study five disparate machine leaning methods, with linear and non-linear, and smooth and non-smooth properties, to estimate RTT and loss rate over 10Gbps connections with 0-366ms RTT. The diversity and complexity of these estimators combined with the randomness of losses and TCP’s non-linear response together rule out the selection of a single best among them; instead, we fuse them to retain their design diversity. Overall, the results show that accurate estimates can be generated at low loss rates but become inaccurate at loss rates 10% and higher, thereby illustrating both their strengths and limitations.
We present a framework to provide privacy preserving (PP) federating learning (FL) across multiple computational and experimental facilities. This work joins the compute capabilities of National Energy Research Scientific Computing Center (NERSC) and Oak Ridge National Laboratory Research Cloud (ORC) with simulated experimental data, such as those produced at the SLAC National Accelerator Laboratory and Spallation Neutron Source (SNS). We describe the software infrastructure developed to provide privacy for computational and experimental networks. We developed algorithmic privacy across the federated system by embedding database security, computation, and communication into the federation architecture, utilizing scientific tools developed by the experimental community.
We study synchronization of coupled linear systems over networks with weak connectivity and time-varying delays. We focus on the case that the internal dynamics are time-varying but non-expansive. Both uniformly connected and infinitely connected communication topologies are considered. A new concept of P-synchronization is introduced and we first show that global asymptotic P-synchronization can be achieved over directed networks with uniform joint connectivity and arbitrarily bounded delays. We then study the case of the infinitely jointly connected communication topology. In particular, for the undirected communication topologies, it turns out that the existence of a uniform time interval for the communication topology is not necessary and P-synchronization can be achieved when the time varying delays are arbitrarily bounded. Simulations are given to validate the theoretical results.
Exascale systems are predicted to have approximately 1 billion cores, assuming gigahertz cores. Limitations on affordable network topologies for distributed memory systems of such massive scale bring new challenges to the currently dominant parallel programing model. Currently, there are many efforts to evaluate the hardware and software bottlenecks of exascale designs. It is therefore of interest to model application performance and to understand what changes need to be made to ensure extrapolated scalability. The fast multipole method (FMM) was originally developed for accelerating N-body problems in astrophysics and molecular dynamics but has recently been extended to a wider range of problems. Its high arithmetic intensity combined with its linear complexity and asynchronous communication patterns make it a promising algorithm for exascale systems. In this paper, we discuss the challenges for FMM on current parallel computers and future exascale architectures, with a focus on internode communication. We focus on the communication part only; the efficiency of the computational kernels are beyond the scope of the present study. We develop a performance model that considers the communication patterns of the FMM and observe a good match between our model and the actual communication time on four high-performance computing (HPC) systems, when latency, bandwidth, network topology, and multicore penalties are all taken into account. To our knowledge, this is the first formal characterization of internode communication in FMM that validates the model against actual measurements of communication time. The ultimate communication model is predictive in an absolute sense; however, on complex systems, this objective is often out of reach or of a difficulty out of proportion to its benefit when there exists a simpler model that is inexpensive and sufficient to guide coding decisions leading to improved scaling. The current model provides such guidance.