Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Networking”

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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Inferring microbial co-occurrence networks from amplicon data: a systematic evaluation

Microbes commonly organize into communities consisting of hundreds of species involved in complex interactions with each other. 16S ribosomal RNA (16S rRNA) amplicon profiling provides snapshots that reveal the phylogenies and abundance profiles of these microbial communities. These snapshots, when collected from multiple samples, can reveal the co-occurrence of microbes, providing a glimpse into the network of associations in these communities. However, the inference of networks from 16S data involves numerous steps, each requiring specific tools and parameter choices. Moreover, the extent to which these steps affect the final network is still unclear. In this study, we perform a meticulous analysis of each step of a pipeline that can convert 16S sequencing data into a network of microbial associations. Through this process, we map how different choices of algorithms and parameters affect the co-occurrence network and identify the steps that contribute substantially to the variance. We further determine the tools and parameters that generate robust co-occurrence networks and develop consensus network algorithms based on benchmarks with mock and synthetic data sets. The Microbial Co-occurrence Network Explorer, or MiCoNE (available at https://github.com/segrelab/MiCoNE) follows these default tools and parameters and can help explore the outcome of these combinations of choices on the inferred networks. We envisage that this pipeline could be used for integrating multiple data sets and generating comparative analyses and consensus networks that can guide our understanding of microbial community assembly in different biomes.

16S rRNA↗
DOE OSTI2021

Integrating deep neural networks with full-waveform inversion: Reparameterization, regularization, and uncertainty quantification

Full-waveform inversion (FWI) is an accurate imaging approach for modeling the velocity structure by minimizing the misfit between recorded and predicted seismic waveforms. However, the strong nonlinearity of FWI resulting from fitting oscillatory waveforms can trap the optimization in local minima. We have adopted a neural-network-based full-waveform inversion (NNFWI) method that integrates deep neural networks with FWI by representing the velocity model with a generative neural network. Neural networks can naturally introduce spatial correlations as regularization to the generated velocity model, which suppresses noise in the gradients and mitigates local minima. Furthermore, the velocity model generated by neural networks is input to the same partial differential equation (PDE) solvers used in conventional FWI. The gradients of the neural networks and PDEs are calculated using automatic differentiation, which back propagates gradients through the acoustic PDEs and neural network layers to update the weights of the generative neural network. Experiments on 1D velocity models, the Marmousi model, and the 2004 BP model determine that NNFWI can mitigate local minima, especially for imaging high-contrast features such as salt bodies, and it significantly improves the inversion in the presence of noise. Adding dropout layers to the neural network model also allows analyzing the uncertainty of the inversion results through Monte Carlo dropout. NNFWI opens a new pathway to combine deep learning and FWI for exploiting the characteristics of deep neural networks and the high accuracy of PDE solvers. Because NNFWI does not require extra training data and optimization loops, it provides an attractive and straightforward alternative to conventional FWI.

58 GEOSCIENCES↗
DOE OSTI2011

A Toolbox Model of Evolution of Metabolic Pathways on Networks of Arbitrary Topology

In prokaryotic genomes the number of transcriptional regulators is known to be proportional to the square of the total number of protein-coding genes. A toolbox model of evolution was recently proposed to explain this empirical scaling for metabolic enzymes and their regulators. According to its rules, the metabolic network of an organism evolves by horizontal transfer of pathways from other species. These pathways are part of a larger ‘‘universal’’ network formed by the union of all species-specific networks. It remained to be understood, however, how the topological properties of this universal network influence the scaling law of functional content of genomes in the toolbox model. Here we answer this question by first analyzing the scaling properties of the toolbox model on arbitrary tree-like universal networks. We prove that critical branching topology, in which the average number of upstream neighbors of a node is equal to one, is both necessary and sufficient for quadratic scaling. We further generalize the rules of the model to incorporate reactions with multiple substrates/products as well as branched and cyclic metabolic pathways. To achieve its metabolic tasks, the new model employs evolutionary optimized pathways with minimal number of reactions. Numerical simulations of this realistic model on the universal network of all reactions in the KEGG database produced approximately quadratic scaling between the number of regulated pathways and the size of the metabolic network. To quantify the geometrical structure of individual pathways, we investigated the relationship between their number of reactions, byproducts, intermediate, and feedback metabolites. Our results validate and explain the ubiquitous appearance of the quadratic scaling for a broad spectrum of topologies of underlying universal metabolic networks. They also demonstrate why, in spite of ‘‘small-world’’ topology, reallife metabolic networks are characterized by a broad distribution of pathway lengths and sizes of metabolic regulons in regulatory networks.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2011

Diagnosing Anomalous Network Performance with Confidence

Variability in network performance is a major obstacle in effectively analyzing the throughput of modern high performance computer systems. High performance interconnec- tion networks offer excellent best-case network latencies; how- ever, highly parallel applications running on parallel machines typically require consistently high levels of performance to adequately leverage the massive amounts of available computing power. Performance analysts have usually quantified network performance using traditional summary statistics that assume the observational data is sampled from a normal distribution. In our examinations of network performance, we have found this method of analysis often provides too little data to under- stand anomalous network performance. Our tool, Confidence, instead uses an empirically derived probability distribution to characterize network performance. In this paper we describe several instances where the Confidence toolkit allowed us to understand and diagnose network performance anomalies that we could not adequately explore with the simple summary statis- tics provided by traditional measurement tools. In particular, we examine a multi-modal performance scenario encountered with an Infiniband interconnection network and we explore the performance repeatability on the custom Cray SeaStar2 interconnection network after a set of software and driver updates.

Settlemyer, Bradley W↗
DOE OSTI2012

Synchronization in Complex Oscillator Networks and Smart Grids

The emergence of synchronization in a network of coupled oscillators is a fascinating topic in various scientific disciplines. A coupled oscillator network is characterized by a population of heterogeneous oscillators and a graph describing the interaction among them. It is known that a strongly coupled and sufficiently homogeneous network synchronizes, but the exact threshold from incoherence to synchrony is unknown. Here we present a novel, concise, and closed-form condition for synchronization of the fully nonlinear, non-equilibrium, and dynamic network. Our synchronization condition can be stated elegantly in terms of the network topology and parameters, or equivalently in terms of an intuitive, linear, and static auxiliary system. Our results significantly improve upon the existing conditions advocated thus far, they are provably exact for various interesting network topologies and parameters, they are statistically correct for almost all networks, and they can be applied equally to synchronization phenomena arising in physics and biology as well as in engineered oscillator networks such as electric power networks. We illustrate the validity, the accuracy, and the practical applicability of our results in complex networks scenarios and in smart grid applications.

36 MATERIALS SCIENCE↗
DOE OSTI2013

RECOVERY ACT - Robust Optimization for Connectivity and Flows in Dynamic Complex Networks

The goal of this project was to study robust connectivity and flow patterns of complex multi-scale systems modeled as networks. Networks provide effective ways to study global, system level properties, as well as local, multi-scale interactions at a component level. Numerous applications from power systems, telecommunication, transportation, biology, social science, and other areas have benefited from novel network-based models and their analysis. Modeling and optimization techniques that employ appropriate measures of risk for identifying robust clusters and resilient network designs in networks subject to uncertain failures were investigated in this collaborative multi-university project. In many practical situations one has to deal with uncertainties associated with possible failures of network components, thereby affecting the overall efficiency and performance of the system (e.g., every node/connection has a probability of partial or complete failure). Some extreme examples include power grid component failures, airline hub failures due to weather, or freeway closures due to emergencies. These are also situations in which people, materials, or other resources need to be managed efficiently. Important practical examples include rerouting flow through power grids, adjusting flight plans, and identifying routes for emergency services and supplies, in the event network elements fail unexpectedly. Solutions that are robust under uncertainty, in addition to being economically efficient, are needed. This project has led to the development of novel models and methodologies that can tackle the optimization problems arising in such situations. A number of new concepts, which have not been previously applied in this setting, were investigated in the framework of the project. The results can potentially help decision-makers to better control and identify robust or risk-averse decisions in such situations. Formulations and optimal solutions of the considered problems need to capture uncertainty and risk using appropriate probabilistic, statistical and optimization concepts. The main difficulty arising in addressing these issues is the dramatic increase in the computational complexity of the resulting optimization problems. This project studied novel models and methodologies for risk-averse network optimization- specifically, network design, network flows and cluster detection problems under uncertainty. The approach taken was to incorporate a quantitative risk measure known as conditional value-at-risk that is widely used in financial applications. This approach presents a viable alternate modeling and optimization framework to chance-constrained optimization and mean-variance optimization, one that also facilitates the detection of risk-averse solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Anomaly Detection in Dynamic Networks

Anomaly detection in dynamic communication networks has many important security applications. These networks can be extremely large and so detecting any changes in their structure can be computationally challenging; hence, computationally fast, parallelisable methods for monitoring the network are paramount. For this reason the methods presented here use independent node and edge based models to detect locally anomalous substructures within communication networks. As a first stage, the aim is to detect changes in the data streams arising from node or edge communications. Throughout the thesis simple, conjugate Bayesian models for counting processes are used to model these data streams. A second stage of analysis can then be performed on a much reduced subset of the network comprising nodes and edges which have been identified as potentially anomalous in the first stage. The first method assumes communications in a network arise from an inhomogeneous Poisson process with piecewise constant intensity. Anomaly detection is then treated as a changepoint problem on the intensities. The changepoint model is extended to incorporate seasonal behavior inherent in communication networks. This seasonal behavior is also viewed as a changepoint problem acting on a piecewise constant Poisson process. In a static time frame, inference is made on this extended model via a Gibbs sampling strategy. In a sequential time frame, where the data arrive as a stream, a novel, fast Sequential Monte Carlo (SMC) algorithm is introduced to sample from the sequence of posterior distributions of the change points over time. A second method is considered for monitoring communications in a large scale computer network. The usage patterns in these types of networks are very bursty in nature and don’t fit a Poisson process model. For tractable inference, discrete time models are considered, where the data are aggregated into discrete time periods and probability models are fitted to the communication counts. In a sequential analysis, anomalous behavior is then identified from outlying behavior with respect to the fitted predictive probability models. Seasonality is again incorporated into the model and is treated as a changepoint model on the transition probabilities of a discrete time Markov process. Second stage analytics are then developed which combine anomalous edges to identify anomalous substructures in the network.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

2022 Peer Review Project Summary: Advanced Protection for Microgrids and DER in Secondary Networks and Meshed Distribution Systems

Although there are increasing numbers of distributed energy resources (DERs) and microgrids being deployed, current IEEE and utility standards generally strictly limit their interconnection inside secondary networks. Secondary networks are low-voltage meshed (non-radial) distribution systems that create redundancy in the path from the main grid source to each load. This redundancy provides a high level of immunity to disruptions in the distribution system, and thus extremely high reliability of electric power service. There are two main types of secondary networks, called grid and spot secondary networks, both of which are used worldwide. In the future, primary networks in distribution systems that might include looped or meshed distribution systems at the primary-voltage (mediumvoltage) level may also become common as a means for improving distribution reliability and resilience. The objective of this multiyear project is to increase the adoption of microgrids in secondary networks and meshed distribution systems by developing novel protection schemes that allow for safe reliable operation of DERs in secondary networks. We will address these challenges by working with the appropriate stakeholders of secondary network operators, protection vendors, and standards committee. The outcomes of this project include: a) development and/or demonstration of candidate methods for enabling protection of secondary networks containing high levels of DER; b) development of modeling and testing tools for protection systems designed for use with secondary networks including DERs; and c) development of new industrial partnerships to facilitate widespread results dissemination and eventual commercialization of results as appropriate.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Game-Theoretic Strategies for Quantum-Conventional Network Infrastructures

Fundamentally and practically, quantum networks and conventional networks are inextricably tied, since the basic quantum protocols such as teleportation require both networks and the conventional network fiber is also used for the quantum network. A Recursive System of Systems (RSOS) model is developed for quantum-conventional (QC) networks by modeling the correlations at various levels based on the failure and attack modes of quantum, conventional and hybrid components and the propagative effects across QC boundaries. A game-theoretic formulation is developed to capture the cost-benefit trade-offs of the provider in defending against component attacks, using sum-form utility functions. By applying the Nash Equilibrium results, the conditions and sensitivity functions of the survivalprobabilities of a QC network at different levels are derived using the strong dependencies between quantum and conventional infrastructures. The results provide insights into the dependenciesbetween conventional and quantum networks, including cross QC boundary effects in terms of disruption impact of conventional networks on quantum networks, and vice versa.

Rao, Nageswara↗
DOE OSTI2017

Photometric Properties of Network and Faculae Derived from HMI Data Compensated for Scattered Light

We report on the photometric properties of faculae and network, as observed in full-disk, scattered-light-corrected images from the Helioseismic Magnetic Imager. We use a Lucy–Richardson deconvolution routine that corrects an image in less than one second. Faculae are distinguished from network through proximity to active regions. This is the first report that full-disk observations, including center-to-limb variations, reproduce the photometric properties of faculae and network observed previously only in sub-arcsecond-resolution; small field-of-view studies, i.e. that network, as defined by distance from active regions, exhibit higher photometric contrasts. Specifically, for magnetic flux values larger than approximately 300 G, the network is brighter than faculae and the contrast differences increase toward the limb, where the network contrast is about twice the facular one. For lower magnetic flux values, network appear darker than faculae. Contrary to reports from previous full-disk observations, we also found that network exhibits a higher center-to-limb variation. Our results are in agreement with reports from simulations that indicate magnetic flux alone is a poor proxy of the photometric properties of magnetic features. We estimate that the contribution of faculae and network to Total Solar Irradiance variability of the current Cycle 24 is overestimated by at least 11%, due to the photometric properties of network and faculae not being recognized as different. This estimate is specific to the method employed in this study to reconstruct irradiance variations, so caution should be paid when extending it to other techniques.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Representativeness assessment of the pan-Arctic eddy covariance site network and optimized future enhancements

Abstract. Large changes in the Arctic carbon balance are expected as warming linked to climate change threatens to destabilize ancient permafrost carbon stocks. The eddy covariance (EC) method is an established technique to quantify net losses and gains of carbon between the biosphere and atmosphere at high spatiotemporal resolution. Over the past decades, a growing network of terrestrial EC tower sites has been established across the Arctic, but a comprehensive assessment of the network's representativeness within the heterogeneous Arctic region is still lacking. This creates additional uncertainties when integrating flux data across sites, for example when upscaling fluxes to constrain pan-Arctic carbon budgets and changes therein. This study provides an inventory of Arctic (here > = 60∘ N) EC sites, which has also been made available online (https://cosima.nceas.ucsb.edu/carbon-flux-sites/, last access: 25 January 2022). Our database currently comprises 120 EC sites, but only 83 are listed as active, and just 25 of these active sites remain operational throughout the winter. To map the representativeness of this EC network, we evaluated the similarity between environmental conditions observed at the tower locations and those within the larger Arctic study domain based on 18 bioclimatic and edaphic variables. This allows us to assess a general level of similarity between ecosystem conditions within the domain, while not necessarily reflecting changes in greenhouse gas flux rates directly. We define two metrics based on this representativeness score: one that measures whether a location is represented by an EC tower with similar characteristics (ER1) and a second for which we assess if a minimum level of representation for statistically rigorous extrapolation is met (ER4). We find that while half of the domain is represented by at least one tower, only a third has enough towers in similar locations to allow reliable extrapolation. When we consider methane measurements or year-round (including wintertime) measurements, the values drop to about 1/5 and 1/10 of the domain, respectively. With the majority of sites located in Fennoscandia and Alaska, these regions were assigned the highest level of network representativeness, while large parts of Siberia and patches of Canada were classified as underrepresented. Across the Arctic, mountainous regions were particularly poorly represented by the current EC observation network. We tested three different strategies to identify new site locations or upgrades of existing sites that optimally enhance the representativeness of the current EC network. While 15 new sites can improve the representativeness of the pan-Arctic network by 20 %, upgrading as few as 10 existing sites to capture methane fluxes or remain active during wintertime can improve their respective ER1 network coverage by 28 % to 33 %. This targeted network improvement could be shown to be clearly superior to an unguided selection of new sites, therefore leading to substantial improvements in network coverage based on relatively small investments.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2011

A Toolbox Model of Evolution of Metabolic Pathways on Networks of Arbitrary Topology

In prokaryotic genomes the number of transcriptional regulators is known to be proportional to the square of the total number of protein-coding genes. A toolbox model of evolution was recently proposed to explain this empirical scaling for metabolic enzymes and their regulators. According to its rules, the metabolic network of an organism evolves by horizontal transfer of pathways from other species. These pathways are part of a larger 'universal' network formed by the union of all species-specific networks. It remained to be understood, however, how the topological properties of this universal network influence the scaling law of functional content of genomes in the toolbox model. Here we answer this question by first analyzing the scaling properties of the toolbox model on arbitrary tree-like universal networks. We prove that critical branching topology, in which the average number of upstream neighbors of a node is equal to one, is both necessary and sufficient for quadratic scaling. We further generalize the rules of the model to incorporate reactions with multiple substrates/products as well as branched and cyclic metabolic pathways. To achieve its metabolic tasks, the new model employs evolutionary optimized pathways with minimal number of reactions. Numerical simulations of this realistic model on the universal network of all reactions in the KEGG database produced approximately quadratic scaling between the number of regulated pathways and the size of the metabolic network. To quantify the geometrical structure of individual pathways, we investigated the relationship between their number of reactions, byproducts, intermediate, and feedback metabolites. Our results validate and explain the ubiquitous appearance of the quadratic scaling for a broad spectrum of topologies of underlying universal metabolic networks. They also demonstrate why, in spite of 'small-world' topology, real-life metabolic networks are characterized by a broad distribution of pathway lengths and sizes of metabolic regulons in regulatory networks.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2016

Reliable Communication Models in Interdependent Critical Infrastructure Networks

Modern critical infrastructure networks are becoming increasingly interdependent where the failures in one network may cascade to other dependent networks, causing severe widespread national-scale failures. A number of previous efforts have been made to analyze the resiliency and robustness of interdependent networks based on different models. However, communication network, which plays an important role in today's infrastructures to detect and handle failures, has attracted little attention in the interdependency studies, and no previous models have captured enough practical features in the critical infrastructure networks. In this paper, we study the interdependencies between communication network and other kinds of critical infrastructure networks with an aim to identify vulnerable components and design resilient communication networks. We propose several interdependency models that systematically capture various features and dynamics of failures spreading in critical infrastructure networks. We also discuss several research challenges in building reliable communication solutions to handle failures in these models.

Lee, Sangkeun↗
DOE OSTI2023

Combustion control using spiking neural networks

A system that controls a combustion engine stores network vectors in a memory that represent diverse and distinct spiking neural networks. The system decodes the network vectors and trains and evaluates the spiking neural networks. The system duplicates selected network vectors and crosses-over the duplicated network vectors that represent modified spiking neural networks. The system mutates the crossed-over duplicated network vectors by randomly modifying one or more portions of the crossing-over duplicated network vectors. The system meter exhaust gas into an intake manifold when an engine temperature exceeds a threshold, an engine load exceeds a threshold, an engine's rotation-per-minute rate exceeds a threshold, and a fuel flow exceeds a threshold. The system modifies fuel flow into an engine's combustion chamber on a cycle-to-cycle basis by the trained spiking neural network.

Puente, Brian P. Maldonado↗
DOE OSTI2023

A Data Processing Pipeline for Adversarial Socio-Technical Network Analysis

With the rapid adoption of emerging technologies, there is a need to catalog and model sociotechnical interdependencies that have been historically used to influence the operation of Critical Infrastructure networks including the impacts of mergers and acquisitions, hostile takeovers, and foreign investment. Our research intends to address this need with two primary contributions. First, we have developed a data curation and processing pipeline to generate sociotechnical networks extracted from a variety of data sources including SEC filings and infrastructure asset databases. The pipeline, implemented in Apache Airflow, extracts and normalizes the representation of entities and relations, specified within ontologies. Our intent is to provide an extensible, machine-actionable approach to quickly communicate such models, reproduce previous results, and adapt them to new, unanticipated situations. Second, networks produced by our pipeline enable the development of graph-theoretic metrics that consider the properties of network components in addition to its topology. Metadata associated with network components---whether semantic, temporal, or geospatial---affects the alignment of generated networks with assumptions underlying complexity metrics. Validation of generated networks relative to component types defined by an ontology, may allow the research community to adapt metrics to the semantics of the domains being studied. Generated networks may be processed as knowledge, dynamic, or spatial graphs and enables a variety of analyses including automated reasoning and measures of network complexity. Automated reasoning views extracted entities and relations as a knowledge graph; this enables application of inference rules that represent historically-attested adversarial business methods and applies that behavior to a specific geographic context. Measures of network complexity, including degree distribution, reachability analyses, temporal analysis, and community detection can be adapted to indicate adversarial organizational influence.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Distributed and Secure Spectrum Sharing for 5G and 6G Networks

Secure spectrum sharing or spectrum co-existence of multiple 5G networks and future 6G networks is a powerful enabler technology. The National Spectrum Strategy (NSS) published by the White House in November, 2023, and the subsequent NSS implementation plan led by the National Telecommunication and Information Administration (NTIA) is the driver of a national effort to enable co-existence of government incumbents and commercial networks in selected spectrum bands. Cellular networks such as 5G & 6G and non-cellular Wi-Fi 6E & 7 are the prominent wireless technologies considered for co-existence with incumbent wireless links. Security of the spectrum sharing solutions is a must to make this transformation of spectrum use possible, specially for mission critical communications. However, current spectrum sharing solutions rely on centralized data bases with inherent vulnerabilities. This paper focuses on secure spectrum sharing among multiple 5G networks using unlicensed and shared frequency bands. It presents an innovative AI/ML based distributed spectrum sharing approach that can be autonomously used by multiple networks. Each sharing network uses its own observation of the Radio Frequency (RF) environment, which consists of RF measurements reported from the 5G User Equipment (UE), to adjust the transmission power levels for secure co-existence. Data is presented to illustrate the superior performance of this solution compared to other spectrum sharing solutions where each network can utilize usage data of the other networks. Finally it discusses how this efficient spectrum sharing solution can evolve in the future for the 6G networks.

5G↗
DOE OSTI2022

Learning high-dimensional parametric maps via reduced basis adaptive residual networks

We propose a scalable framework for the learning of high-dimensional parametric maps via adaptively constructed residual network (ResNet) maps between reduced bases of the inputs and outputs. When just few training data are available, it is beneficial to have a compact parametrization in order to ameliorate the ill-posedness of the neural network training problem. By linearly restricting high-dimensional maps to informed reduced bases of the inputs, one can compress high-dimensional maps in a constructive way that can be used to detect appropriate basis ranks, equipped with rigorous error estimates. A scalable neural network learning framework is thus to learn the nonlinear compressed reduced basis mapping. Unlike the reduced basis construction, however, neural network constructions are not guaranteed to reduce errors by adding representation power, making it difficult to achieve good practical performance. Inspired by recent approximation theory that connects ResNets to sequential minimizing flows, we present an adaptive ResNet construction algorithm. This algorithm allows for depth-wise enrichment of the neural network approximation, in a manner that can achieve good practical performance by first training a shallow network and then adapting. We prove universal approximation of the associated neural network class for $L^2_v$ functions on compact sets. Our overall framework allows for constructive means to detect appropriate breadth and depth, and related compact parametrizations of neural networks, significantly reducing the need for architectural hyperparameter tuning. Numerical experiments for parametric PDE problems and a 3D CFD wing design optimization parametric map demonstrate that the proposed methodology can achieve remarkably high accuracy for limited training data, and outperformed other neural network strategies we compared against.

42 ENGINEERING↗
DOE OSTI2019

The Transactive Network Template Metamodel

While transactive energy—an allocation of electricity based on dynamically discovered values or prices—has been extensively studied, its uptake and use has been slow. This report describes a tool, the transactive network template, which should hasten the creation and uptake of transactive energy networks. The transactive network template is a metamodel meant to guide implementers as they configure their own transactive agent within a network of such agents. The transactive network template’s object–oriented design approach provides implementers basic code object types, which may be used and extended to represent each of the assets in the implementer’s circuit region. These objects further facilitate the transactive agent’s necessary computations, which are divided among responsibilities to schedule assets’ power usage, to balance electric supply and demand, and to coordinate the exchange of electricity with the other transactive agents. This report addresses the conceptual transactive network template design. Implementers are directed to more formal design documents and reference implementations. A Python™-based [Python 2018] reference implementation of the transactive network template has been coded, and three implementations have been configured to represent a national laboratory and two university campuses. In the future, the author wishes to make the transactive network template more generally applicable to networks that require more accurate power flow and those employing alternative transactive coordination mechanisms.

24 POWER TRANSMISSION AND DISTRIBUTION↗