Search NASA⌕ Search

SEARCH · Search NASA

Results for “Network Time Protocol”

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 55 records · Page 3

Methods for microwave characterization of electro-optic crystals for quantum transduction

Microwave-optic quantum transducers are essential devices to develop distributed quantum networks and implement related quantum communication protocols. Three dimensional high-coherence time microwave cavities embedded with electro-optic nonlinear dielectric materials provide promising platforms to boost the efficiency of the microwave-optic frequency conversion. However, so far, the properties for such dielectric crystals operating at milli-Kelvin cryogenic temperatures have not been well understood. Here, we propose a scheme to precisely measure and benchmark the dielectric constant and analyze the dissipation mechanisms of electro-optic materials, such as Lithium Niobate, at the quantum threshold. We will use Fermilab’s three dimensional superconducting cavities with long coherence time. The proposed method of microwave characterization lays the foundations for engineering quantum transduction devices and quantum sensors with high conversion efficiency and fidelity.

Zorzetti, Silvia↗

Network Models of Active Degradation Mechanisms and Pathways for Service Life Prediction of Indoor and Outdoor PV Modules

ct: PV service lifetime prediction (SLP) enables accurate calculation of levelized cost of energy (LCOE), which is crucial to rationalizing PV investment and installation. However, SLP is challeging since PV reliability in the field is affected by many combined factors, including various environmental stresses and module quality. In order to map out the active degradation mechanisms and pathways that best resemble real world conditions, we introduce the framework of a study protocol and use network models fitted to data, to enable analysis and SLP of complex PV systems with multiple active degradation mechanisms. The study protocol is the experimental design, including module variants and different exposure conditions, selection of evaluation methods, time-series data acquisition and training of network models to these data. We present SLP of minimodules in the lab and PV systems in the field. For lab SLP, minimodules with 8 variants based on manufacturer, architecture, and encapsulation were prepared and aged in modified damp heat with or without full spectrum light exposure. Stepwise I-V and Suns-Voc data acquisition tracks changes in electrical properties including Rs,IV, Isc,IV, Vmp,PIV providing insights into power loss of minimodules. Network structural equation modeling (netSEM) was utilized to construct degradation pathway models that identify active degradation mechanisms and predict power loss over time. For field SLP, datastreams of Pmp values and I-V curve datastreams of two types of modules installed in three distinctly different Köppen-Geiger climate zones for 9 years were acquired. With power loss modes corresponding to uniform current loss (ΔPIsc), recombination (ΔPVoc), series resistance (ΔPRs), and current mismatch (ΔPImis) determined, the performance loss rates (PLR) were determined using PVplr. We show how to establish a study protocol framework to ensure appropriate parametric variations and valid data collection from the variants of your complex systems. Then the data-driven netSEM model fitting provides a comprehensive mapping of multiple active degradation mechanisms, and accurate service life prediction.

network model, degradation, photovoltaic, solar↗

Cyber Resilience in the Cast Timing System

Our task within the DarkNet project was to test the cyber resiliency of the Center for Alternate Synchronization and Timing’s (CAST) framework. We focused our testing on two of the core pieces of CAST’s implementation, a Juniper MX204 router and the Precision Time Protocol (PTP). In this report, we cover the following attempted methods of attack on our targets: ping flood, fork bomb, network protocol fuzzing, ARP poisoning, and IGMP spoofing. We found that delaying certain packets, specifically Delay Request, had a significant impact on the Offset from Master and Observed Drift timing statistics.

97 MATHEMATICS AND COMPUTING↗

Extending molecular simulation time scales: Parallel in time integrations for high-level quantum chemistry and complex force representations

Parallel in time simulation algorithms are presented and applied to conventional molecular dynamics (MD) and ab initio molecular dynamics (AIMD) models of realistic complexity. Assuming that a forward time integrator, f (e.g., Verlet algorithm), is available to propagate the system from time t{sub i} (trajectory positions and velocities x{sub i} = (r{sub i}, v{sub i})) to time t{sub i+1} (x{sub i+1}) by x{sub i+1} = f{sub i}(x{sub i}), the dynamics problem spanning an interval from t{sub 0}…t{sub M} can be transformed into a root finding problem, F(X) = [x{sub i} − f(x{sub (i−1})]{sub i} {sub =1,M} = 0, for the trajectory variables. The root finding problem is solved using a variety of root finding techniques, including quasi-Newton and preconditioned quasi-Newton schemes that are all unconditionally convergent. The algorithms are parallelized by assigning a processor to each time-step entry in the columns of F(X). The relation of this approach to other recently proposed parallel in time methods is discussed, and the effectiveness of various approaches to solving the root finding problem is tested. We demonstrate that more efficient dynamical models based on simplified interactions or coarsening time-steps provide preconditioners for the root finding problem. However, for MD and AIMD simulations, such preconditioners are not required to obtain reasonable convergence and their cost must be considered in the performance of the algorithm. The parallel in time algorithms developed are tested by applying them to MD and AIMD simulations of size and complexity similar to those encountered in present day applications. These include a 1000 Si atom MD simulation using Stillinger-Weber potentials, and a HCl + 4H{sub 2}O AIMD simulation at the MP2 level. The maximum speedup ((serial execution time)/(parallel execution time) ) obtained by parallelizing the Stillinger-Weber MD simulation was nearly 3.0. For the AIMD MP2 simulations, the algorithms achieved speedups of up to 14.3. The parallel in time algorithms can be implemented in a distributed computing environment using very slow transmission control protocol/Internet protocol networks. Scripts written in Python that make calls to a precompiled quantum chemistry package (NWChem) are demonstrated to provide an actual speedup of 8.2 for a 2.5 ps AIMD simulation of HCl + 4H{sub 2}O at the MP2/6-31G* level. Implemented in this way these algorithms can be used for long time high-level AIMD simulations at a modest cost using machines connected by very slow networks such as WiFi, or in different time zones connected by the Internet. The algorithms can also be used with programs that are already parallel. Using these algorithms, we are able to reduce the cost of a MP2/6-311++G(2d,2p) simulation that had reached its maximum possible speedup in the parallelization of the electronic structure calculation from 32 s/time step to 6.9 s/time step.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Wireless Sensor Node Power Profiling Based on IEEE 802.11 and IEEE 802.15.4 Communication Protocols. Modeling and Simulation

Most wireless sensor network (comprising of thousands of WSNs) applications require operation over extended periods of time beginning with their deployment. Network lifetime is extremely critical for most applications and is one of the limiting factors for energy-constrained networks. Based on applications, there are wide ranges of different energy sources suitable for powering WSNs. A battery is traditionally used to power WSNs. The deployed WSN is required to last for long time. Due to finite amount of energy present in batteries, it is not feasible to replace batteries. Recently there has been a new surge in the area of energy harvesting were ambient energy in the environment can be utilized to prolong the lifetime of WSNs. Some of the sources of ambient energies are solar power, thermal gradient, human motion and body heat, vibrations, and ambient RF energy. The design and development of TEGs to power WSNs that would remain active for a long period of time requires comprehensive understanding of WSN operational. This motivates the research in modeling the lifetime, i.e., power consumption, of a WSN by taking into consideration various node and network level activities. A WSN must perform three essential tasks: sense events, perform quick local information processing of sensed events, and wirelessly exchange locally processed data with the base station or with other WSNs in the network. Each task has a power cost per unit tine and an additional cost when switching between tasks. There are number of other considerations that must also be taken into account when computing the power consumption associated with each task. The considerations includes: number of events occurring in a fixed active time period and the duration of each event, event-information processing time, total communication time, number of retransmission, etc. Additionally, at the network level the communication of information data packets between WSNs involves collisions, latency, and retransmission, which result in unanticipated power losses. This report focuses rigorous stochastic modeling of power demand for a schedule-driven WSN utilizing Institute of Electrical and Electronics Engineers 802.11 and 802.15.4 communication protocols. The model captures the generic operation of a schedule-driven WSN when an external event occurs, i.e., sensing, following by processing, and followed by communication. The report will present development of an expression to compute the expected energy consumption per operational cycle of a schedule-driven WSN by taking into consideration the node level activities, i.e., sensing and processing, and the network level activities, i.e., channel access, packet collision, retransmission attempts, and transmission of a data packet.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Quantum Networks for Resilient Power Grids: Theory and Simulated Evaluation

Quantum networks are considered the future of secure communication in the coming quantum era. Yet there lack significant efforts on developing practical quantum networks for power grids. Here, in this paper, we establish a quantum network-based power grid (QNetGrid) framework and develops a real-time, reliable, flexible, programmable, and cost-effective QNetGrid software testbed containing repeater-based quantum communication, quantum routing, real software-defined networking (SDN) switches, and real-time networked microgrids (NMs) operations. It makes the following contributions: 1) a repeater and routing based quantum network simulator (QNSim) is developed, 2) repeaters with and without quantum memories are respectively simulated in QNSim, 3) different routing scenarios in QNetGrid are investigated, 4) a real-time QNetGrid software testbed is built in RTDS incorporating QNSim and real SDN switches, and 5) various test cases are designed, and experimental results produced with the QNetGrid testbed provide valuable insights for building quantum networks in power grids.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Rephasing spectral diffusion in time-bin spin-spin entanglement protocols

Generating high-fidelity spin-spin entanglement is an essential task of quantum repeater networks for the distribution of quantum information across long distances. Solid-state-based spin-photon interfaces are promising candidates to realize nodes of a quantum network, but are often limited by spectral diffusion of the optical transition, which results in phase errors on the entangled states. Here, we introduce a method to correct phase errors from quasi-static frequency fluctuations after the entangled state is generated, by shelving the emitters in the excited state to refocus the unknown phase. For quasi-static frequency fluctuations, the fidelity is determined only by the lifetime of the excited state used for shelving, making it particularly suitable for systems with a long-lived shelving state with correlated spectral diffusion. Such a shelving state may be found in Kramers doublet systems such as rare-earth emitters and color centers in Si or SiC interfaced with nanophotonic cavities with a strongly frequency-dependent Purcell enhancement. Furthermore, the protocol can be used to generate high-fidelity entangled spin pairs without reducing the rate of entanglement generation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Real-Sim Interface: Enabling Multi-resolution Simulation and X-in-the-Loop Development for Connected and Automated Vehicles

We report connected and automated vehicles (CAVs) can bring safety, mobility, and energy benefits to transportation systems. Ideally, CAV applications would be fully evaluated and validated prior to real-world implementation. However, many technical challenges in both software and hardware hinder the process. To comprehensively evaluate all aspects of CAV applications, an integrated evaluation environment is needed with various simulation tools from different domains. In the current literature, there lacks a well-developed interface to enable multi-resolution simulation of vehicle, traffic, virtual environment, and hardware-in-the-loop (HIL) simulation. In this work, a modular and flexible interface is developed to enable multi-resolution vehicle and traffic co-simulation for CAV applications. This interface is built upon Oak Ridge National Laboratory’s (ORNL’s) Real-Sim approach, can support various simulation tools and real-time X-in-the-loop (XIL) simulations, and is based on network communication protocols. The network communication delays are analyzed for simultaneous connection of up to 20 simulators. Then, two example applications are studied to demonstrate the potential usage of the Real-Sim interface: (1) a centralized merging scenario where the dynamics of two ego vehicles are emulated with detailed vehicle and powertrain dynamics models and (2) a signal-controller-in-the-loop (SCIL) evaluation where one intersection of the simulated traffic scenario is controlled by a physical signal controller. This Real-Sim interface is a tool that allows researchers to bring real, tangible hardware and software into simulated environments to comprehensively evaluate and support a wide variety of CAV applications.

33 ADVANCED PROPULSION SYSTEMS↗

TDD LoRa and Delta Encoding in Low-Power Networks of Environmental Sensor Arrays for Temperature and Deformation Monitoring

Abstract Densely distributed sensor networks can revolutionize environmental observations by providing real-time data with an unprecedented spatiotemporal resolution. However, field deployments often pose unique challenges in terms of power provisions and wireless connectivity. We present a framework for wirelessly connected distributed sensor arrays for near-surface temperature and/or deformation monitoring. Our research focuses on a novel time division duplex implementation of the LoRa protocol, enabling battery powered base stations and avoiding collisions within the network. In order to minimize transmissions and improve battery life throughout the network, we propose a dedicated delta encoding algorithm that utilizes the spatial and temporal similarity in the acquired data sets. We implemented the developed technologies in a AA battery powered hardware platform that can be used as a wireless data logger or base station, and we conducted an assessment of the power consumption. Without data compression, the projected battery life for a data logger is 4.74 years, and a wireless base stations can last several weeks or months depending on the amount of network traffic. The delta encoding algorithm can further improve this battery life with a factor of up to 3.50. Our results demonstrate the viability of the proposed methods for low-power environmental wireless sensor networks.

54 ENVIRONMENTAL SCIENCES↗

High Performance Computing with Harness over InfiniBand

Harness is an adaptable and plug-in-based middleware framework able to support distributed parallel computing. By now, it is based on the Ethernet protocol which cannot guarantee high performance throughput and real time (determinism) performance. During last years, both, the research and industry environments have developed new network architectures (InfiniBand, Myrinet, iWARP, etc.) to avoid those limits. This paper concerns the integration between Harness and InfiniBand focusing on two solutions: IP over InfiniBand (IPoIB) and Socket Direct Protocol (SDP) technology. They allow the Harness middleware to take advantage of the enhanced features provided by the InfiniBand Architecture.

97 MATHEMATICS AND COMPUTING↗

AmeriFlux Measurement Network: Science Team Research

Research involves analysis and field direction of AmeriFlux operations, and the PI provides scientific leadership of the AmeriFlux network. Activities include the coordination and quality assurance of measurements across AmeriFlux network sites, synthesis of results across the network, organizing and supporting the annual Science Team Meeting, and communicating AmeriFlux results to the scientific community and other users. Objectives of measurement research include (i) coordination of flux and biometric measurement protocols (ii) timely data delivery to the Carbon Dioxide Information and Analysis Center (CDIAC); and (iii) assurance of data quality of flux and ecosystem measurements contributed by AmeriFlux sites. Objectives of integration and synthesis activities include (i) integration of site data into network-wide synthesis products; and (ii) participation in the analysis, modeling and interpretation of network data products. Communications objectives include (i) organizing an annual meeting of AmeriFlux investigators for reporting annual flux measurements and exchanging scientific information on ecosystem carbon budgets; (ii) developing focused topics for analysis and publication; and (iii) developing data reporting protocols in support of AmeriFlux network goals.

54 ENVIRONMENTAL SCIENCES↗

SpaceWire model development technology for satellite architecture.

Packet switched data communications networks that use distributed processing architectures have the potential to simplify the design and development of new, increasingly more sophisticated satellite payloads. In addition, the use of reconfigurable logic may reduce the amount of redundant hardware required in space-based applications without sacrificing reliability. These concepts were studied using software modeling and simulation, and the results are presented in this report. Models of the commercially available, packet switched data interconnect SpaceWire protocol were developed and used to create network simulations of data networks containing reconfigurable logic with traffic flows for timing system distribution.

33 ADVANCED PROPULSION SYSTEMS↗

Time Synchronization in Hierarchical TESLA Wireless Sensor Networks

Time synchronization and event time correlation are important in wireless sensor networks. In particular, time is used to create a sequence events or time line to answer questions of cause and effect. Time is also used as a basis for determining the freshness of received packets and the validity of cryptographic certificates. This paper presents secure method of time synchronization and event time correlation for TESLA-based hierarchical wireless sensor networks. The method demonstrates that events in a TESLA network can be accurately timestamped by adding only a few pieces of data to the existing protocol.

97 MATHEMATICS AND COMPUTING↗

Deep Packet/Flow Analysis using GPUs

Deep packet inspection (DPI) faces severe performance challenges in high-speed networks (40/100 GE) as it requires a large amount of raw computing power and high I/O throughputs. Recently, researchers have tentatively used GPUs to address the above issues and boost the performance of DPI. Typically, DPI applications involve highly complex operations in both per-packet and per-flow data level, often in real-time. The parallel architecture of GPUs fits exceptionally well for per-packet network traffic processing. However, for stateful network protocols such as TCP, their data stream need to be reconstructed in a per-flow level to deliver a consistent content analysis. Since the flow-centric operations are naturally antiparallel and often require large memory space for buffering out-of-sequence packets, they can be problematic for GPUs, whose memory is normally limited to several gigabytes. In this work, we present a highly efficient GPU-based deep packet/flow analysis framework. The proposed design includes a purely GPU-implemented flow tracking and TCP stream reassembly. Instead of buffering and waiting for TCP packets to become in sequence, our framework process the packets in batch and uses a deterministic finite automaton (DFA) with prefix-/suffix- tree method to detect patterns across out-of-sequence packets that happen to be located in different batches. In conclusion, evaluation shows that our code can reassemble and forward tens of millions of packets per second and conduct a stateful signature-based deep packet inspection at 55 Gbit/s using an NVIDIA K40 GPU.

97 MATHEMATICS AND COMPUTING↗

Deep Packet/Flow Analysis using GPUs

aDeep packet inspection (DPI) faces severe performance challenges in high-speed networks (40/100 GE) as it requires a large amount of raw computing power and high I/O throughputs. Recently, researchers have tentatively used GPUs to address the above issues and boost the performance of DPI. Typically, DPI applications involve highly complex operations in both per-packet and per-flow data level, often in real-time. The parallel architecture of GPUs fits exceptionally well for per-packet network traffic processing. However, for stateful network protocols such as TCP, their data stream need to be reconstructed in a per-flow level to deliver a consistent content analysis. Since the flow-centric operations are naturally anti-parallel and often require large memory space for buffering out-of-sequence packets, they can be problematic for GPUs, whose memory is normally limited to several gigabytes. In this work, we present a highly efficient GPU-based deep packet/flow analysi s framework. The proposed design includes a purely GPU-implemented flow tracking and TCP stream reassembly. Instead of buffering and waiting for TCP packets to become in sequence, our framework process the packets in batch and uses a deterministic finite automaton (DFA) with prefix-/suffix- tree method to detect patterns across out-of-sequence packets that happen to be located in different batches. Evaluation shows that our code can reassemble and forward tens of millions of packets per second and conduct a stateful signature-based deep packet inspection at 55 Gbit/s using an NVIDIA K40 GPU.

Gong, Qian↗

Mooring Load Monitoring of a Wave Energy Converter Using a Self-Synchronizing Underwater Acoustic Network

A self-synchronizing underwater acoustic network, designed for remote monitoring of mooring loads in Wave Energy Converters (WEC), has been developed and tested. This network uses Time Division Multiple Access and operates self-contained with the ability for users to remotely transmit commands to the network as needed. Each node is a self-contained unit, consisting of a protocol adaptor board, an underwater acoustic modem and a battery pack. A node can be connected to a load cell, to a topside user or to the WEC. Every node is swapable. The protocol adaptor board, named Protocol Adaptor for Digital LOad Cell (PADLOC) supports a variety of digital load cell message formats (CAN, MODBUS, custom ASCII) and underwater acoustic modem serial formats. PADLOC enables topside users to connect to separate load cells through a user-specific command.

acoustic↗

Formal Approach For Resilient Reachability based on End-System Route Agility

The deterministic nature of existing routing protocols has resulted into an ossified Internet with static and predictable network routes. This gives persistent attackers (e.g. eavesdroppers and DDoS attackers) plenty of time to study the network and identify the vulnerable links (critical) to plan a devastating and stealthy attack. Recently, route mutation approaches have been proposed to address such issues. However, these approaches incur significantly high overhead and depend upon the availability of disjoint routes in the network, which inherently limit their use for mission critical services. To cope with these issues, we extend the current routing architecture to consider end-hosts as routing elements, and present a formal method based agile defense mechanism to increase resiliency of the existing cyber infrastructure. The major contributions of this paper include: (1) formalization of efficient and resilient End to End (E2E) reachability problem as a constraint satisfaction problem, which identifies the potential end-hosts to reach a destination while satisfying resilience and QoS constraints, (2) design and implementation of a novel decentralized End Point Route Mutation (EPRM) protocol, and (3) design and implementation of planning algorithm to minimize the overlap between multiple flows, for the sake of maximizing the agility in the system. Our implementation and evaluation validates the correctness, effectiveness and scalability of the proposed approach.

Rauf, Usman↗