Search NASA⌕ Search

SEARCH · Search NASA

Results for “Networks.”

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 847 records · Page 47

Degree-preserving graph dynamics: a versatile process to construct random networks

Real-world networks evolve over time via the addition or removal of vertices and edges. In current network evolution models, vertex degree varies or grows arbitrarily. A recently introduced degree-preserving network growth (DPG) family of models preserves vertex degree, resulting in structures significantly different from and more diverse than previous models. Despite its degree preserving property, the DPG model is able to replicate the output of several well-known real-world network growth models. Simulations showed that many real-world networks can also be constructed from small seed graphs via the DPG process. Here, we start the development of a rigorous mathematical theory underlying the DPG family of network growth models. We prove that the degree sequence of the output of some of the well-known, real-world network growth models can be reconstructed via the DPG process, using proper parametrization. We also show that the general problem of deciding whether a simple graph can be obtained via the DPG process from a small seed (DPG feasibility) is, however, NP-complete. In conclusion, it is an intriguing open problem to uncover whether there is a structural reason behind the DPG-constructability of real-world networks.

97 MATHEMATICS AND COMPUTING↗

Digital Twin Network (DTN): Concepts, Architecture, and Key Technologies

With the commercial deployment of 5G and the migration of internet from IPv4 to IPv6, the new development of the network technology has highly attracted the attention of the industry. The intelligentization of network is believed as the trend of the new generation of network development. The network provides the foundation for the information transmission in the digital society, and the digitalization of the network itself is the prerequisite for the intelligent development. Facing the goal of the new generation of digital and intelligent network, this paper introduces the new concept of "digital twin network (DTN)", designs the system architecture, and analyzes the key technologies of DTN. By investigating the challenges of DTN, this paper points out the future development direction of digital twin network.

digital twin network↗

Initial Characterization of Optical Communications with Disruption-Tolerant Network Protocols

Disruption-tolerant networks (DTNs) are groups of network assets connected with a suite of communication protocol technologies designed to mitigate the effects of link delay and disruption. Application of DTN protocols to diverse groups of network resources in multiple sub-networks results in an overlay network-of-networks with autonomous data routing capability. In space environments where delay or disruption is expected, performance of this type of architecture (such as an interplanetary internet) can increase with the inclusion of new communications mediums and techniques. Space-based optical communication links are therefore an excellent building block of space DTN architectures. When compared to traditional radio frequency (RF) communications, optical systems can provide extremely power-efficient and high bandwidth links bridging sub-networks. Because optical links are more susceptible to link disruption and experience the same light-speed delays as RF, optical-enabled DTN architectures can lessen potential drawbacks and maintain the benefits of autonomous optical communications over deep space distances. These environment-driven expectations - link delay and interruption, along with asymmetric data rates - are the purpose of the proof-of-concept experiment outlined herein. In recognizing the potential of these two technologies, we report an initial experiment and characterization of the performance of a DTN-enabled space optical link. The experiment design employs a point-to-point free-space optical link configured to have asymmetric bandwidth. This link connects two networked systems running a DTN protocol implementation designed and written at JPL for use on spacecraft, and further configured for higher bandwidth performance. Comparing baseline data transmission metrics with and without periodic optical link interruptions, the experiment confirmed the DTN protocols' ability to handle real-world unexpected link outages while maintaining capability of reliably delivering data at relatively high rates. Finally, performance characterizations from this data suggest performance optimizations to configuration and protocols for future optical-specific DTN space link scenarios.

Space networking↗

On the Current State of Sheaf Theoretic Networking

Advancing the Delay Tolerant Networking (DTN) effort has proven to be a unique and difficult challenge. In the journey to implementing space networking, NASA has considered several strategies. From direct translations of Internet Protocol (IP) to satellite networks to pre-planned routing structures in Contact Graph Routing (CGR), each potential solution for DTN has come with its fair share of setbacks and challenges. Frequently, these challenges can be traced back to specific assumptions made in the development of each protocol that do not carry over from ground networks to space networks. To address these fundamental assumptions, a more general and foundational networking theory is required. In this paper, we survey a novel mathematical foundation for networking using the theory of cellular sheaves. Sheaves form a mathematical tool for modeling local phenomenon that leads to global effects. Sheaves have been introduced a number of times, and our goal here is to summarize the applications and point towards important future work that must be done to build a stronger, cohesive theory for networking.

Sheaves↗

Cooperative Clustering Techniques For Space Network Scalability

Routing in the space internet must face many unique challenges - from unplanned disconnections and interruptions to predictable intermittent connectivity due to high network mobility and long propagation delays. NASA’s current approach to such routing is Contact Graph Routing (CGR), using a graph formed of prescheduled communication contacts to compute routes through the network. While this approach manages to tackle issues of connectivity and propagation delays, it is a global approach that requires continuous knowledge of the entire network. In a potential future Solar Space Internet (SSI) such an approach on its own cannot scale to large networks with thousands of members. In this paper we propose clustering as a solution to CGR scalability. Clustering has been used in many networking problems as a way to subdivide the network and allow for localized routing and better scalability. Using techniques from graph theory and game theory, we explore various existing clustering algorithms and adapt them to the Contact Graph Routing setting. We propose a way to combine multiple algorithms to create a Delay Tolerant Clustering Protocol (DTCP). In addition, we explore the underlying networking mechanisms such as multicast, neighbor discovery, and software defined networking that may be used to enable DTCP.

Delay Tolerant Networking↗

A New Approach to Multivariate Network Traffic Analysis

© 2019, Springer Science+Business Media, LLC & Science Press, China. Network traffic analysis is one of the core functions in network monitoring for effective network operations and management. While online traffic analysis has been widely studied, it is still intensively challenging due to several reasons. One of the primary challenges is the heavy volume of traffic to analyze within a finite amount of time due to the increasing network bandwidth. Another important challenge for effective traffic analysis is to support multivariate functions of traffic variables to help administrators identify unexpected network events intuitively. To this end, we propose a new approach with the multivariate analysis that offers a high-level summary of the online network traffic. With this approach, the current state of the network will display patterns compiled from a set of traffic variables, and the detection problems in network monitoring (e.g., change detection and anomaly detection) can be reduced to a pattern identification and classification problem. In this paper, we introduce our preliminary work with clustered patterns for online, multivariate network traffic analysis with the challenges and limitations we observed. We then present a grid-based model that is designed to overcome the limitations of the clustered pattern-based technique. We will discuss the potential of the new model with respect to the technical challenges including streaming-based computation and robustness to outliers.

Kim, Jinoh↗

Architectural Dynamics of CaMKII-Actin Networks

Calcium-calmodulin-dependent kinase II (CaMKII) has an important role in dendritic spine remodeling upon synaptic stimulation. Using fluorescence video microscopy and image analysis, we investigated the architectural dynamics of rhodamine-phalloidin stabilized filamentous actin (F-actin) networks cross-linked by CaMKII. We used automated image analysis to identify F-actin bundles and crossover junctions and developed a dimensionless metric to characterize network architecture. Similar networks were formed by three different CaMKII species with a 10-fold length difference in the linker region between the kinase domain and holoenzyme hub, implying linker length is not a primary determinant of F-actin cross-linking. Electron micrographs showed that at physiological molar ratios, single CaMKII holoenzymes cross-linked multiple F-actin filaments at random, whereas at higher CaMKII/F-actin ratios, filaments bundled. Light microscopy established that the random network architecture resisted macromolecular crowding with polyethylene glycol and blocked ATP-powered compaction by myosin-II miniature filaments. Importantly, the networks disassembled after the addition of calcium-calmodulin and were then spaced within 3 min into compacted foci by myosin motors or more slowly (30 min) aggregated by crowding. Single-molecule total internal reflection fluorescence microscopy showed CaMKII dissociation from surface-immobilized globular actin exhibited a monoexponential dwell-time distribution, whereas CaMKII bound to F-actin networks had a long-lived fraction, trapped at crossover junctions. Release of CaMKII from F-actin, triggered by calcium-calmodulin, was too rapid to measure with flowcell exchange (<20 s). The residual bound fraction was reduced substantially upon addition of an N-methyl-D-aspartate receptor peptide analog but not ATP. These results provide mechanistic insights to CaMKII-actin interactions at the collective network and single-molecule level. Our findings argue that CaMKII-actin networks in dendritic spines maintain spine size against physical stress. Upon synaptic stimulation, CaMKII is disengaged by calcium-calmodulin, triggering network disassembly, expansion, and subsequent compaction by myosin motors with kinetics compatible with the times recorded for the poststimulus changes in spine volume.

59 BASIC BIOLOGICAL SCIENCES↗

A multi-scale network method for two-phase flow in porous media

Pore-network models of porous media are useful in the study of pore-scale flow in porous media. In order to extract macroscopic properties from flow simulations in pore-networks, it is crucial the networks are large enough to be considered representative elementary volumes. However, existing two-phase network flow solvers are limited to relatively small domains. For this purpose, a multi-scale pore-network (MSPN) method, which takes into account flow-rate effects and can simulate larger domains compared to existing methods, was developed. In our solution algorithm, a large pore network is partitioned into several smaller sub-networks. The algorithm to advance the fluid interfaces within each subnetwork consists of three steps. First, a global pressure problem on the network is solved approximately using the multiscale finite volume (MSFV) method. Next, the fluxes across the subnetworks are computed. Lastly, using fluxes as boundary conditions, a dynamic two-phase flow solver is used to advance the solution in time. Simulation results of drainage scenarios at different capillary numbers and unfavourable viscosity ratios are presented and used to validate the MSPN method against solutions obtained by an existing dynamic network flow solver.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Rupture Orientation and Strain-induced Crystallization of Polymer Chain and Network in Vulcanized Polyisoprene During Uniaxial Deformation by in-situ Electron Spin Resonance(ESR) and Synchrotron X-ray Analysis

Different network structures of vulcanized polyisoprene rubbers were studied by in-situ ESR and synchrotron X-ray during deformation to analyze the rupture, orientation, and strain-induced crystallization of polymer chains and network points. Rupture of network points occur, depending on network structure, and create an un-reversible change in vulcanized rubber. The flexibility of network points affects the possibility of rupture, polymer orientation and strain-induced crystallization. Peroxide vulcanized network is rigid and un-rupturable. Poly-sulfide rich vulcanized network is more flexible and less rupturable than mono-sulfide rich vulcanized network. Chain flexibility and rupturability of network points affect the strain-induced crystallization and stress-strain relation.

36 MATERIALS SCIENCE↗

Topological, functional, and dynamic properties of the protein interaction networks rewired by benzo(a)pyrene

Benzo(a)pyrene is a common environmental and foodborne pollutant that has been identified as a human carcinogen. Although the carcinogenicity of benzo(a)pyrene has been extensively reported, its precise molecular mechanisms and the influence on system-level protein networks are not well understood. To investigate the system-level influence of benzo(a)pyrene on protein interactions and regulatory networks, a benzo(a)pyrene-rewired protein interaction network was constructed based on 769 key proteins derived from more than 500 literature reports. The protein interaction network rewired by benzo(a)pyrene was a scale-free, highly-connected biological system. Ten modules were identified, and 25 signaling pathways were enriched, most of which belong to the human diseases category, especially cancer and infectious disease. In addition, two lung-specific and two liver-specific pathways were identified. Three pathways were specific in short and medium-term networks (< 48 h), and five pathways were enriched only in the medium-term network (6 h–48 h). Finally, the expression of linker genes in the network was validated by Western blotting. These findings establish the overall, tissue- and time-specific benzo(a)pyrene-rewired protein interaction networks and provide insights into the biological effects and molecular mechanisms of action of benzo(a)pyrene. - Highlights: • Benzo(a)pyrene induced scale-free, highly-connected protein interaction networks. • 25 signaling pathways were enriched through modular analysis. • Tissue- and time-specific pathways were identified.

60 APPLIED LIFE SCIENCES↗

Advancing reversible shape memory by tuning the polymer network architecture

Because of counteraction of a chemical network and a crystalline scaffold, semicrystalline polymer networks exhibit a peculiar behavior—reversible shape memory (RSM), which occurs naturally without applying any external force and particular structural design. There are three RSM properties: (i) range of reversible strain, (ii) rate of strain recovery, and (iii) decay of reversibility with time, which can be improved by tuning the architecture of the polymer network. Different types of poly(octylene adipate) networks were synthesized, allowing for control of cross-link density and network topology, including randomly cross-linked network by free-radical polymerization, thiol–ene clicked network with enhanced mesh uniformity, and loose network with deliberately incorporated dangling chains. It is shown that the RSM properties are controlled by average cross-link density and crystal size, whereas topology of a network greatly affects its extensibility. In conclusion, we have achieved 80% maximum reversible range, 15% minimal decrease in reversibility, and fast strain recovery rate up to 0.05 K –1 , i.e., ca. 5% per 10 s at a cooling rate of 5 K/min.

36 MATERIALS SCIENCE↗

Static and Dynamic Thermomechanical Properties of Phase-Separated Epoxy Networks with Tuned Microstructures

Here, polymerization-induced phase separation is a useful method for the construction of heterogeneous epoxy networks with properties exceeding their homogeneous counterparts. In this work, we examine the static and dynamic thermomechanical properties of phase-separated epoxy networks salient to their application as encapsulants. Three heterogeneous epoxy-amine networks with nano-, meso-, and macro-phase-separated morphologies comprised of hard and soft domains are compared to a rigid, unstructured network. The glass transition profiles of the heterogeneous networks are complex, spanning many decades in the frequency domain. The nanophase-separated morphology leads to higher coefficient of thermal expansion, yet surprisingly is characterized by reduced residual stress. Under both quasi-static and dynamic compression (strain rates of order 10 –3 and 10 3 s –1 , respectively), the nanophase-separated network also exhibits higher modulus and strength. In split-Hopkinson bar experiments, the energy dissipation characteristics of the epoxy networks were nearly identical. Curiously, however, the Hugoniot response of the macro-phase-separated network determined by ballistic shockwave analysis indicates a remarkable ability of this material to mitigate shockwave propagation in comparison to many homogeneous and heterogeneous polymer materials. Collectively, this work reveals several previously unreported phenomena with respect to structure–property relationships in phase-separated epoxy networks, illustrating the potential value of systematically tuned microstructures for optimization of application-specific physical properties.

36 MATERIALS SCIENCE↗

The role of trace gas flux networks in biogeosciences

Vast networks of meteorological sensors ring the globe, providing continuous measurements of an array of atmospheric state variables such as temperature, humidity, rainfall, and the concentration of carbon dioxide [New etal., 1999; Tans etal., 1996]. These measurements provide input to weather and climate models and are key to detecting trends in climate, greenhouse gases, and air pollution. Yet to understand how and why these atmospheric state variables vary in time and space, biogeoscientists need to know where, when, and at what rates important gases are flowing between the land and the atmosphere. Tracking trace gas fluxes provides information on plant or microbial metabolism and climate-ecosystem interactions. The existence of trace gas flux networks is a relatively new phenomenon, dating back to research in 1984. The first gas flux measurement networks were regional in scope and were designed to track pollutant gases such as sulfur dioxide, ozone, nitric acid, and nitrogen dioxide. Atmospheric observations and model simulations were used to infer the depositional rates of these hazardous chemicals [Fowler etal., 2009; Meyers etal., 1991]. In the late 1990s, two additional trace gas flux measurement networks emerged. One, the United States Trace Gas Network (TRAGNET), was a short-lived effort that measured trace gas emissions from the soil and plants with chambers distributed throughout the country [Ojima etal., 2000]. The other, FLUXNET, was an international endeavor that brought many regional networks together to measure the fluxes of carbon dioxide, water vapor, and sensible heat exchange with the eddy covariance technique [Baldocchi etal., 2001]. FLUXNET, which remains active today, currently includes more than 400 tower sites, dispersed across most of the world's climatic zones and biomes, with sites in North and South America, Europe, Asia, Africa, and Australia. More recently, several specialized networks have emerged, including networks dedicated to urban areas (Urban Fluxnet), nitrogen compounds in Europe (NitroEurope), and methane (MethaneNet). Technical Aspects of Flux Networks Eddy covariance flux measurements are the preferred method by which biogeoscientists measure trace gas exchange between ecosystems and the atmosphere [Baldocchi, 2003].

54 ENVIRONMENTAL SCIENCES↗

From Points to Planes: A Workflow for Converting Three‐Dimensional Point Cloud Data Into Discrete Fracture Network Flow and Transport Models

We present the Point cLoud Algorithm for NEtwork Extraction of Discrete Fracture Networks (PLANE-DFN), a point cloud–based algorithm for automatic fracture network extraction designed to support discrete fracture network (DFN) modeling workflows. PLANE-DFN segments three-dimensional fracture planes from raw point cloud data using RANdom SAmple Consensus coupled with statistical outlier removal and density-based clustering to isolate individual fracture features. Each candidate plane is constrained against site-specific structural constraints based on strike and dip. After segmentation, each fracture is converted into a 2-D convex polygon suitable for meshing and simulation. The PLANE-DFN algorithm is validated by comparing geometric and flow and transport data against data from dfnWorks simulations with ensembles of plane-fit networks. We find that the flow and transport in plane-fit networks are comparable to dfnWorks-generated networks when realistic network geometry is maintained. The PLANE-DFN algorithm provides an automated and streamlined workflow to transform point clouds of data into DFN network geometry.

54 ENVIRONMENTAL SCIENCES↗

Systems level analysis of the Chlamydomonas reinhardtii metabolic network reveals variability in evolutionary co-conservation

Metabolic networks, which are mathematical representations of organismal metabolism, are reconstructed to provide computational platforms to guide metabolic engineering experiments and explore fundamental questions on metabolism. Systems level analyses, such as interrogation of phylogenetic relationships within the network, can provide further guidance on the modification of metabolic circuitries. Chlamydomonas reinhardtii , a biofuel relevant green alga that has retained key genes with plant, animal, and protist affinities, serves as an ideal model organism to investigate the interplay between gene function and phylogenetic affinities at multiple organizational levels. Here, using detailed topological and functional analyses, coupled with transcriptomics studies on a metabolic network that we have reconstructed for C. reinhardtii , we show that network connectivity has a significant concordance with the co-conservation of genes; however, a distinction between topological and functional relationships is observable within the network. Dynamic and static modes of co-conservation were defined and observed in a subset of gene-pairs across the network topologically. In contrast, genes with predicted synthetic interactions, or genes involved in coupled reactions, show significant enrichment for both shorter and longer phylogenetic distances. Based on our results, we propose that the metabolic network of C. reinhardtii is assembled with an architecture to minimize phylogenetic profile distances topologically, while it includes an expansion of such distances for functionally interacting genes. This arrangement may increase the robustness of C. reinhardtii 's network in dealing with varied environmental challenges that the species may face. As a result, the defined evolutionary constraints within the network, which identify important pairings of genes in metabolism, may offer guidance on synthetic biology approaches to optimize the production of desirable metabolites.

54 ENVIRONMENTAL SCIENCES↗

Automated Network Services for Exascale Data Movement

The Large Hadron Collider (LHC) experiments distribute data by leveraging a diverse array of National Research and Education Networks (NRENs), where experiment data management systems treat networks as a “blackbox” resource. After the High Luminosity upgrade, the Compact Muon Solenoid (CMS) experiment alone will produce roughly 0.5 exabytes of data per year. NREN Networks are a critical part of the success of CMS and other LHC experiments. However, during data movement, NRENs are unaware of data priorities, importance, or need for quality of service, and this poses a challenge for operators to coordinate the movement of data and have predictable data flows across multi-domain networks. The overarching goal of SENSE (The Software-defined network for End-to-end Networked Science at Exascale) is to enable National Labs and universities to request and provision end-to-end intelligent network services for their application workflows leveraging SDN (Software-Defined Networking) capabilities. This work aims to allow LHC Experiments and Rucio, the data management software used by CMS Experiment, to allocate and prioritize certain data transfers over the wide area network. In this paper, we will present the current progress of the integration of SENSE, Multi-domain end-to-end SDN Orchestration with QoS (Quality of Service) capabilities, with Rucio, the data management software used by CMS Experiment.

Balcas, Justas↗

Automatic Lane-Level Road Network Extraction from Aerial Imagery for Transportation Digital Twins

Accurate road networks are essential for credible traffic microsimulation and transportation digital twins, yet high-definition maps are often difficult to obtain due to limited availability, high cost, or proprietary restrictions. Some build networks from crowdsourced data, such as OpenStreetMap, but these sources often contain geometric and semantic inconsistencies. Others create networks manually, a process that is labor-intensive and difficult to scale. To address these limitations, this work presents an end-to-end pipeline that automatically extracts georeferenced, lane-level road networks from publicly available high-resolution satellite imagery and converts them into simulation-ready assets. The developed end-to-end pipeline has three primary modules: (1) A computer-vision-based module first detects directed lane geometries and intersection layouts. (2) A heuristic-based topology construction module then identifies approach and exit legs and establishes conflict-free lane-to-lane connections. (3) Finally, an automatic simulation-building module converts the extracted network into standard formats, e.g., OpenDRIVE, and generates routable SUMO networks. The framework supports both complete network construction from scratch and local-scale refinement of existing networks through lane-count correction, transition recovery, and geometric regularization. The proposed pipeline provides a practical pathway to generate traffic simulation networks from satellite imagery, significantly reducing manual reconstruction effort and enabling scalable, continuously updated transportation digital twins.

Guo, Hetian [University of Georgia, Athens] (ORCID↗

A Look Inside the Black Box: Using graph-theoretical descriptors to interpret a Continuous-Filter Convolutional Neural Network (CF-CNN) trained on the global and local minimum energy structures of neutral water clusters

A Continuous Filter Convolutional Neural Network (CF-CNN) was trained to predict the potential energy of water cluster networks \ce{(H2O)_{\textit{N}}}, \textit{N}=10--30, corresponding to local minima lying within 5 kcal/mol from the putative minima taken from a newly published database containing over 5 million unique networks. The chemical sampling space of the database was characterized using chemical descriptors derived from graph theory, which led to the identification of important trends in the topology, connectivity, polygon structures associated with the various networks as a function of cluster size. The resulting graphs are available alongside the original database at \url{https://sites.uw.edu/wdbase/}. The CF-CNN trained on a subset of 500,000 networks for (\textit{N}=10, 30) yielded a mean absolute error of 0.002$\pm$0.002 kcal/mol per water molecule, giving the trained CF-CNN the highest accuracy of any neural network-based surrogate model to date. In addition, clusters of sizes not included in the training set exhibited errors of the same magnitude, indicating that the CF-CNN ptotocol is general enough to accurately predict energies of networks for both smaller and larger sizes than those used during training. The graph-theoretical descriptors were developed in order to analyze the properties of the full database and interpret the predictive power of the CF-CNN. Using topology measures, such as the Wiener index and the average shortest path length along with two similarity measures, we showed that all networks from the test set were within the range of the ones from the training set, suggesting that the training set covered the chemical space of interest quite well. Our graph analysis suggests that the mean degree and number of polygons for networks with larger errors tend to lie further from the mean than those with lower errors. The generality of the used CF-CNN was thus demonstrated, while the use of the graph-theoretical descriptors assisted in interpreting the predicted results.

Bilbrey, Jenna A.↗