Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Network topologies”

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 181 records · Page 10

Low earth orbit satellite/terrestrial mobile service compatibility

Digital cellular mobile 'second generation' systems are now gradually being introduced into service; one such example is GSM, which will provide a digital voice and data service throughout Europe. Total coverage is not expected to be achieved until the mid '90's, which has resulted in several proposals for the integration of GSM with a geostationary satellite service. Unfortunately, because terrestrial and space systems have been designed to optimize their performance for their particular environment, integration between a satellite and terrestrial system is unlikely to develop further than the satellite providing a back-up service. This lack of system compatibility is now being addressed by system designers of third generation systems. The next generation of mobile systems, referred to as FPLMTS (future public land mobile telecommunication systems) by CCIR and UMTS (universal mobile telecommunication system) in European research programs, are intended to provide inexpensive, hand-held terminals that can operate in either satellite, cellular, or cordless environments. This poses several challenges for system designers, not least in terms of the choice of multiple access technique and power requirements. Satellite mobile services have been dominated by the geostationary orbital type. Recently, however, a number of low earth orbit configurations have been proposed, for example Iridium. These systems are likely to be fully operational by the turn of the century, in time for the implementation of FPLMTS. The developments in LEO mobile satellite service technology were recognized at WARC-92 with the allocation of specific frequency bands for 'big' LEO's, as well as a frequency allocation for FPLMTS which included a specific satellite allocation. When considering integrating a space service into the terrestrial network, LEO's certainly appear to have their attractions: they can provide global coverage, the round trip delay is of the order of tens of milliseconds, and good visibility to the satellite is usually possible. This has resulted in their detailed investigation in the European COST 227 program and in the work program of the European Telecommunications Standards Institute (ETSI). This paper will consider the system implications of integrating a LEO mobile service with a terrestrial service. Results will be presented from simulation software to show how a particular orbital configuration affects the performance of the system in terms of area coverage and visibility to a terminal for various locations and minimum elevation angle. Possible network topologies are then proposed for an integrated satellite/terrestrial network.

Sheriff, R. E.↗

Enabling Situational Awareness in Operational Technology Environments through Software Defined Networking

Network situational awareness has long been associated with the task of aggregating system logs to determine activity and events ongoing in the network. This current method of obtaining situational awareness however does not clearly address the mission of a facility or organization, the key customers at stake, and the real-time statuses of the critical infrastructures. Software-defined networking provides the capability of allowing the collection of system information of deployed network elements and enabling a global view of the network topology, with near-real-time knowledge of network activities, allowing for key points of the network to be identified and secured appropriately. KEYWORDS: Software Defined Networking, Situational Awareness, Network Security, Cyber Security, Operational Technology

Chang, Laurence H.↗

Optimization of Distribution Feeder Topology: A Differential Programming Learning Approach

This paper presents a gradient based method for optimizing distribution feeder network topology under load un- certainty. We recast the optimal network reconfiguration problem as a learning problem where edge weights of a graph are learned to produce an optimized spanning tree for a distribution network. Using recent methods published on differentiable programming, we provide a data driven method for learning these weights. We test our method on 100 variations of an IEEE 15-bus test system. Our results show that our method outperforms more traditional mathematical programming-based approaches.

differentiable programming↗

Damage spreading in spatial and small-world random boolean networks

Random Boolean Networks (RBNs) are often used as generic models for certain dynamics of complex systems, ranging from social networks, neural networks, to gene or protein interaction networks. Traditionally, RBNs are interconnected randomly and without considering any spatial arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, small-world, or other non-random connections. Here we explore the RBN network topology between extreme local connections, random small-world, and random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the relevant component at very low connectivities ({bar K} << 1) and that the critical connectivity of stability K{sub s} changes compared to random networks. At higher {bar K}, this scaling remains unchanged. We also show that the relevant component of spatially local networks scales with a power-law as the system size N increases, but with a different exponent for local and small-world networks. The scaling behaviors are obtained by finite-size scaling. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key trade-offs between damage spreading (robustness), the network wiring cost, and the network's communication characteristics.

42 ENGINEERING↗

A likelihood ratio anomaly detector for identifying within-perimeter computer network attacks

The rapid detection of attackers within firewalls of enterprise computer networks is of paramount importance. Anomaly detectors address this problem by quantifying deviations from baseline statistical models of normal network behavior and signaling an intrusion when the observed data deviates significantly from the baseline model. But, many anomaly detectors do not take into account plausible attacker behavior. As a result, anomaly detectors are prone to a large number of false positives due to unusual but benign activity. Our paper first introduces a stochastic model of attacker behavior which is motivated by real world attacker traversal. Then, we develop a likelihood ratio detector that compares the probability of observed network behavior under normal conditions against the case when an attacker has possibly compromised a subset of hosts within the network. Since the likelihood ratio detector requires integrating over the time each host becomes compromised, we illustrate how to use Monte Carlo methods to compute the requisite integral. We then present Receiver Operating Characteristic (ROC) curves for various network parameterizations that show for any rate of true positives, the rate of false positives for the likelihood ratio detector is no higher than that of a simple anomaly detector and is often lower. Finally, we demonstrate the superiority of the proposed likelihood ratio detector when the network topologies and parameterizations are extracted from real-world networks.

97 MATHEMATICS AND COMPUTING↗

Telecommunications network optimization

Analysis discusses STACOM (state criminal justic communication) network topology program used to design and evaluate digital telecommunications networks STACOM employs ESAU-WILLIAMS technique to search for direct links between system terminations and regional switching center. Inputs include traffic data, terminal locations, and functional requirements.

Lee, J.↗

Switch-connected HyperX network

A network system includes a plurality of sub-network planes and global switches. The sub-network planes have a same network topology as each other. Each of the sub-network planes includes edge switches. Each of the edge switches has N ports. Each of the global switches is configured to connect a group of edge switches at a same location in the sub-network planes. In each of the sub-network planes, some of the N ports of each of the edge switches are connected to end nodes, and others of the N ports are connected to other edge switches in the same sub-network plane, other of the N ports are connected to at least one of the global switches.

42 ENGINEERING↗

Diversity of coordination modes in the polymers based on 3,3',4,4'-biphenylcarboxylate ligand

Four new compounds [Ni{sub 2}(4,4'-bpy)(3,4-bptc)(H{sub 2}O){sub 4}]{sub n} (1), [Ni(4,4'-bpy)(3,4-H{sub 2}bptc)(H{sub 2}O){sub 3}]{sub n} (2), [Mn{sub 2}(2,2'-bpy){sub 4}(3,4-H{sub 2}bptc){sub 2}] (3) and {l_brace}[Mn(1,10-phen){sub 2}(3,4-H{sub 2}bptc)].4H{sub 2}O{r_brace}{sub n} (4) (3,4-H{sub 4}bptc=3,3',4,4'-biphenyltetracarboxylic acid, 4,4'-bpy=4,4'-bipyridine, 2,2'-bpy=2,2'-bipyridine, 1, 10-phen=1, 10-phenanthroline), have been prepared and structurally characterized. In all compounds, the derivative ligands of 3,4-H{sub 4}bptc (3,4-bptc{sup 4-} and 3,4-H{sub 2}bptc{sup 2-}) exhibit different coordination modes and lead to the formation of various architectures. Compounds 1 and 2 display the three-dimensional (3D) framework: 1 shows a 3,4-connected topological network with (8{sup 3})(8{sup 5}.10) topology symbol based on the coordination bonds while in 2, the hydrogen-bonding interactions are observed to connect the 1D linear chain generating a final 3D framework. 3 exhibits the 2D layer constructed from the hydrogen-bonding interactions between the dinuclear manganese units. Complex 4 shows the double layers motif through connecting the 1D zigzag chains with hydrogen-bonded rings. The thermal stability of 1-4 and magnetic property of 1 were also reported. - Graphical abstract: Four coordination compounds exhibiting four coordination modes of the 3,3',4,4'-biphenylcarboxylate ligand, with three of new in this system, are obtained showing diversified architectures.

36 MATERIALS SCIENCE↗

An Evaluation of the Effect of Network Cost Optimization for Leadership Class Supercomputers

Dragonfly-based networks are an extensively deployed network topology in large-scale high-performance computing due to their cost-effectiveness and efficiency. The US will soon have three Exascale supercomputers for leadership class workloads deployed using dragonfly networks. Compared to indirect networks of similar scale, the dragonfly network has considerably reduced cable lengths, cable counts, and switch counts, resulting in significant network cost savings for a given system size, however, these cost reductions result in reduced global minimal paths and more challenging routing. Additionally, large scale dragonfly networks often require a taper at the global link level, resulting in less bisection bandwidth than is achievable in other traditional non-blocking topologies of equivalent scale. While dragonfly networks have been extensively studied, they have yet to be fully evaluated in an extreme scale (i.e., exascale) system that targets capability workloads. In this paper, we present the results of the first large scale evaluation of a dragonfly network on an exascale system (Frontier) and compare its behavior to a similar scale fat-tree network on a previous generation TOP500 system (Summit). This evaluation aims to determine the effect of network cost optimizations by measuring a tapered topology’s impact on capability workloads. Our evaluation is based on a collection of synthetic microbenchmarks, mini-apps, and full scale applications. It compares the scaling efficiencies of each benchmark between the dragonfly-based Frontier and the fat-tree-based Summit systems. Our results show that a dragonfly network is $\sim \mathbf{3 0 \%}$ more cost efficient than a fat-tree topology, which amortizes to $\sim 3 \%$ of an exascale system cost. Furthermore, while tapered dragonfly networks impose significant tradeoffs, the impacts are not as broad as initially thought and are mostly seen in applications with global communication patterns, particularly all-to-all (e.g., FFT-based algorithms), but also local communication patterns (e.g., nearest-neighbor algorithms) that are sensitive to network performance variability.

Khan, Awais↗

High speed all optical networks

An inherent problem of conventional point-to-point wide area network (WAN) architectures is that they cannot translate optical transmission bandwidth into comparable user available throughput due to the limiting electronic processing speed of the switching nodes. The first solution to wavelength division multiplexing (WDM) based WAN networks that overcomes this limitation is presented. The proposed Lightnet architecture takes into account the idiosyncrasies of WDM switching/transmission leading to an efficient and pragmatic solution. The Lightnet architecture trades the ample WDM bandwidth for a reduction in the number of processing stages and a simplification of each switching stage, leading to drastically increased effective network throughputs. The principle of the Lightnet architecture is the construction and use of virtual topology networks, embedded in the original network in the wavelength domain. For this construction Lightnets utilize the new concept of lightpaths which constitute the links of the virtual topology. Lightpaths are all-optical, multihop, paths in the network that allow data to be switched through intermediate nodes using high throughput passive optical switches. The use of the virtual topologies and the associated switching design introduce a number of new ideas, which are discussed in detail.

Chlamtac, Imrich↗

A Two-Dimensional Coordination Polymer Based on 1,1':4',1''-Terphenyl-2',4,4'',5'-tetracarboxylate

The coordination polymer, [MnL{sub 0.5}(H{sub 2}O)(phen)]{sub n} (H{sub 4}L = 1,1':4',1''-terphenyl-2',4,4'',5'-tetracarboxylic acid, phen = 1,10-phenanthroline), has been solvothermal synthesized and structurally characterized by single-crystal X-ray diffraction. Complex crystallizes in triclinic sp. gr.P1̄ with Z = 2. Two carboxylate oxygen atoms in the central phenyl rings from two μu{sub 6{sup −}}L{sup 4–} ligands doubly-bridge two Mn(II) ions to form the dinuclear Mn{sub 2}(O{sub COO{sup −}}){sub 2} unit. Each dinuclear Mn{sub 2}(O{sub COO{sup −}}){sub 2} unit links four L{sup 4–} ligands and each L{sup 4–}ligand bridges four dinuclear Mn{sub 2}(O{sub COO{sup −}}){sub 2} units to generate a 2D coordination network, which can be rationalized as a binodal (4,4) topological network by considering the dinuclear Mn{sub 2}(O{sub COO{sup −}}){sub 2} units and L{sup 4–} ligands as 4-connected nodes.

36 MATERIALS SCIENCE↗

RuralAI in Tomato Farming: Integrated Sensor System, Distributed Computing, and Hierarchical Federated Learning for Crop Health Monitoring

Precision horticulture is evolving due to scalable sensor deployment and machine learning (ML) integration. These advancements boost the operational efficiency of individual farms, balancing the benefits of analytics with autonomy requirements. However, given concerns that affect wide geographic regions (e.g., climate change), there is a need to apply models that span farms. Federated learning (FL) has emerged as a potential solution. FL enables decentralized ML across different farms without sharing private data. Traditional FL assumes simple two-tier network topologies and, thus, falls short of operating on more complex networks found in real-world agricultural scenarios. Networks vary across crops and farms and encompass various sensor data modes, extending across jurisdictions. New hierarchical FL (HFL) approaches are needed for more efficient and context-sensitive model sharing, accommodating regulations across multiple jurisdictions. Here, we present the RuralAI architecture deployment for tomato crop monitoring, featuring sensor field units for soil, crop, and weather data collection. HFL with personalization is used to offer localized and adaptive insights. Model management, aggregation, and transfers are facilitated via a flexible approach, enabling seamless communication between local devices, edge nodes, and the cloud.

60 APPLIED LIFE SCIENCES↗

Parallel discrete event simulation: A shared memory approach

With traditional event list techniques, evaluating a detailed discrete event simulation model can often require hours or even days of computation time. Parallel simulation mimics the interacting servers and queues of a real system by assigning each simulated entity to a processor. By eliminating the event list and maintaining only sufficient synchronization to insure causality, parallel simulation can potentially provide speedups that are linear in the number of processors. A set of shared memory experiments is presented using the Chandy-Misra distributed simulation algorithm to simulate networks of queues. Parameters include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential simulation of most queueing network models.

Reed, Daniel A.↗

Parallel discrete event simulation using shared memory

With traditional event-list techniques, evaluating a detailed discrete-event simulation-model can often require hours or even days of computation time. By eliminating the event list and maintaining only sufficient synchronization to ensure causality, parallel simulation can potentially provide speedups that are linear in the numbers of processors. A set of shared-memory experiments, using the Chandy-Misra distributed-simulation algorithm, to simulate networks of queues is presented. Parameters of the study include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential-simulation of most queueing network models.

Reed, Daniel A.↗

Impact of artificial topological changes on flow and transport through fractured media due to mesh resolution

Abstract We performed a set of numerical simulations to characterize the interplay of fracture network topology, upscaling, and mesh refinement on flow and transport properties in fractured porous media. We generated a set of generic three-dimensional discrete fracture networks at various densities, where the radii of the fractures were sampled from a truncated power-law distribution, and whose parameters were loosely based on field site characterizations. We also considered five network densities, which were defined using a dimensionless version of density based on percolation theory. Once the networks were generated, we upscaled them into a single continuum model using the upscaled discrete fracture matrix model presented by Sweeney et al. (2019). We considered steady, isothermal pressure-driven flow through each domain and then simulated conservative, decaying, and adsorbing tracers using a pulse injection into the domain. For each simulation, we calculated the effective permeability and solute breakthrough curves as quantities of interest to compare between network realizations. We found that selecting a mesh resolution such that the global topology of the upscaled mesh matches the fracture network is essential. If the upscaled mesh has a connected pathway of fracture (higher permeability) cells but the fracture network does not, then the estimates for effective permeability and solute breakthrough will be incorrect. False connections cannot be eliminated entirely, but they can be managed by choosing appropriate mesh resolution and refinement for a given network. Adopting octree meshing to obtain sufficient levels of refinement leads to fewer computational cells (up to a 90% reduction in overall cell count) when compared to using a uniform resolution grid and can result in a more accurate continuum representation of the true fracture network.

58 GEOSCIENCES↗

Functional network inference of the suprachiasmatic nucleus

In the mammalian suprachiasmatic nucleus (SCN), noisy cellular oscillators communicate within a neuronal network to generate precise system-wide circadian rhythms. Although the intracellular genetic oscillator and intercellular biochemical coupling mechanisms have been examined previously, the network topology driving synchronization of the SCN has not been elucidated. This network has been particularly challenging to probe, due to its oscillatory components and slow coupling timescale. In this work, we investigated the SCN network at a single-cell resolution through a chemically induced desynchronization. We then inferred functional connections in the SCN by applying the maximal information coefficient statistic to bioluminescence reporter data from individual neurons while they resynchronized their circadian cycling. Our results demonstrate that the functional network of circadian cells associated with resynchronization has small-world characteristics, with a node degree distribution that is exponential. We show that hubs of this small-world network are preferentially located in the central SCN, with sparsely connected shells surrounding these cores. Lastly, we used two computational models of circadian neurons to validate our predictions of network structure.

97 MATHEMATICS AND COMPUTING↗

Topology_Generator

The ns-3 topology generator provides a quick and easy way to create a network topology, and generate C++ simulation code for ns-3.

Young, JeffreyM.↗

Size reduction of complex networks preserving modularity

The ubiquity of modular structure in real-world complex networks is being the focus of attention in many trials to understand the interplay between network topology and functionality. The best approaches to the identification of modular structure are based on the optimization of a quality function known as modularity. However this optimization is a hard task provided that the computational complexity of the problem is in the NP-hard class. Here we propose an exact method for reducing the size of weighted (directed and undirected) complex networks while maintaining invariant its modularity. This size reduction allows the heuristic algorithms that optimize modularity for a better exploration of the modularity landscape. We compare the modularity obtained in several real complex-networks by using the Extremal Optimization algorithm, before and after the size reduction, showing the improvement obtained. We speculate that the proposed analytical size reduction could be extended to an exact coarse graining of the network in the scope of real-space renormalization.

97 MATHEMATICS AND COMPUTING↗