Search NASA⌕ Search

SEARCH · Search NASA

Results for “Network topology”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
NASA NTRS2011

TPSAS-NF1676L-12321-DND

The operation of some networks, such as air transportation networks, can be complicated by congestion through a small subset of nodes. The congestion may be influenced by the connectivity of the network, or by the presence of constraints restricting the flow through particular nodes. This work investigates the effects of both connectivity and node flow constraints on the operation of a network. We develop the Minimax Node Load Problem (MNLP), a multicommodity flow model which minimizes the worst-case flow through any node in a given input network. The optimal solution to this problem provides us with the minimax node load, which we propose as a measure of network congestion. Keeping the number of nodes fixed, we first increase connectivity in a series of networks, and observe that topologies with more distributed connections result in a reduction in the minimax node load. However, when connectivity is increased further, the reductions diminish and are accompanied by solutions with undesirable qualities such as longer commodity paths. We then perform a second set of experiments over the same network, constraining flow through different subsets of nodes at different magnitudes of flow restriction, finding that (1) more constrained nodes lead to the largest increases in minimax node load and (2) constraints on the most connected nodes have the greatest effect on both congestion and commodity path length.

Douglas W Lee↗
NASA NTRS2011

TPSAS-NF1676L-12264-DND

The operation of some networks, such as air transportation networks, can be complicated by congestion through a small subset of nodes. The congestion may be influenced by the connectivity of the network, or by the presence of constraints restricting the flow through particular nodes. This work investigates the effects of both connectivity and node flow constraints on the operation of a network. We develop the Minimax Node Load Problem (MNLP), a multicommodity flow model which minimizes the worst-case flow through any node in a given input network. The optimal solution to this problem provides us with the minimax node load, which we propose as a measure of network congestion. Keeping the number of nodes fixed, we first increase connectivity in a series of networks, and observe that topologies with more distributed connections result in a reduction in the minimax node load. However, when connectivity is increased further, the reductions diminish and are accompanied by solutions with undesirable qualities such as longer commodity paths. We then perform a second set of experiments over the same network, constraining flow through different subsets of nodes at different magnitudes of flow restriction, finding that (1) more constrained nodes lead to the largest increases in minimax node load and (2) constraints on the most connected nodes have the greatest effect on both congestion and commodity path length.

Douglas Lee↗
NASA NTRS2006

A Robust Scalable Transportation System Concept

This report documents the 2005 Revolutionary System Concept for Aeronautics (RSCA) study entitled "A Robust, Scalable Transportation System Concept". The objective of the study was to generate, at a high-level of abstraction, characteristics of a new concept for the National Airspace System, or the new NAS, under which transportation goals such as increased throughput, delay reduction, and improved robustness could be realized. Since such an objective can be overwhelmingly complex if pursued at the lowest levels of detail, instead a System-of-Systems (SoS) approach was adopted to model alternative air transportation architectures at a high level. The SoS approach allows the consideration of not only the technical aspects of the NAS", but also incorporates policy, socio-economic, and alternative transportation system considerations into one architecture. While the representations of the individual systems are basic, the higher level approach allows for ways to optimize the SoS at the network level, determining the best topology (i.e. configuration of nodes and links). The final product (concept) is a set of rules of behavior and network structure that not only satisfies national transportation goals, but represents the high impact rules that accomplish those goals by getting the agents to "do the right thing" naturally. The novel combination of Agent Based Modeling and Network Theory provides the core analysis methodology in the System-of-Systems approach. Our method of approach is non-deterministic which means, fundamentally, it asks and answers different questions than deterministic models. The nondeterministic method is necessary primarily due to our marriage of human systems with technological ones in a partially unknown set of future worlds. Our goal is to understand and simulate how the SoS, human and technological components combined, evolve.

Hahn, Andrew↗
NASA NTRS2022

A Survey of Mathematical Structures for Lunar Networks

To sustain the current and increasing accessibility of space, a scalable communications infrastructure (i.e. the Solar System Internet, SSI) is necessary. The goal of this paper is to begin the discovery of the fundamental underlying mathematical structure of space networks to help the research community harness these structures for algorithm development and optimization. To ensure the applicability of the research, the approaches are considered through the lens of simulated scenarios inspired by the Artemis Back-to-the-Moon mission set for 2024. We note that any approach to an SSI must fit under the umbrella of Delay Tolerant Networking (DTN), due to celestial mobility, high link latencies, high variance in link latencies, disconnections, lack of end-to-end paths, and so on. These difficulties are exacerbated by the fact that the underlying structure of a space network is a time-evolving network and may experience multiple discontinuities in its topology. In this paper we propose several novel approaches to a mathematical foundation for Delay Tolerant Networking Theory that fall outside the traditional scope of temporal network theory. These techniques include methods from Topological Data Analysis, Dynamic Graph Analysis, Applied Algebraic Geometry, Probability Theory, and Game Theory. Some of these methods include tools adapted to the study of dynamic metric spaces, such as zigzag persistent homology and their higher parameter analogs. We find that several of these methods target desired engineering outcomes such as discovery and automatic sub-netting. While each approach is theoretical, they are also algorithmic in nature and offer immediate practical applications. The paper concludes with comparisons of the various methods along with suggestions for future work.

Delay tolerant networking↗
NASA NTRS2003

Modeling beta-adrenergic control of cardiac myocyte contractility in silico

The beta-adrenergic signaling pathway regulates cardiac myocyte contractility through a combination of feedforward and feedback mechanisms. We used systems analysis to investigate how the components and topology of this signaling network permit neurohormonal control of excitation-contraction coupling in the rat ventricular myocyte. A kinetic model integrating beta-adrenergic signaling with excitation-contraction coupling was formulated, and each subsystem was validated with independent biochemical and physiological measurements. Model analysis was used to investigate quantitatively the effects of specific molecular perturbations. 3-Fold overexpression of adenylyl cyclase in the model allowed an 85% higher rate of cyclic AMP synthesis than an equivalent overexpression of beta 1-adrenergic receptor, and manipulating the affinity of Gs alpha for adenylyl cyclase was a more potent regulator of cyclic AMP production. The model predicted that less than 40% of adenylyl cyclase molecules may be stimulated under maximal receptor activation, and an experimental protocol is suggested for validating this prediction. The model also predicted that the endogenous heat-stable protein kinase inhibitor may enhance basal cyclic AMP buffering by 68% and increasing the apparent Hill coefficient of protein kinase A activation from 1.0 to 2.0. Finally, phosphorylation of the L-type calcium channel and phospholamban were found sufficient to predict the dominant changes in myocyte contractility, including a 2.6x increase in systolic calcium (inotropy) and a 28% decrease in calcium half-relaxation time (lusitropy). By performing systems analysis, the consequences of molecular perturbations in the beta-adrenergic signaling network may be understood within the context of integrative cellular physiology.

Non-NASA Center↗
NASA NTRS2006

Parallel Estimation and Control Architectures for Deep-Space Formation Flying Spacecraft

The formation flying of precisely controlled spacecraft in deep space can be used to implement optical instruments capable of imaging planets in other solar systems. The distance of the formation from Earth necessitates a significant level of autonomy and each spacecraft must base its actions on its estimates of the location and velocity of the other spacecraft. Precise coordination and control is the key requirement in such missions and the flow of information between spacecraft must be carefully designed. Doing this in an efficient and optimal manner requires novel techniques for the design of the on-board estimators. The use of standard Kalman filter-based designs can lead to unanticipated dynamics--which we refer to as disagreement dynamics--in the estimators' errors. We show how communication amongst the spacecraft can be designed in order to control all of the dynamics within the formation. We present several results relating the topology of the communication network to the resulting closed-loop control dynamics of the formation. The consequences for the design of the control, communication and coordination are discussed.

distributed control↗
NASA NTRS2008

Communication Needs Assessment for Distributed Turbine Engine Control

Control system architecture is a major contributor to future propulsion engine performance enhancement and life cycle cost reduction. The control system architecture can be a means to effect net weight reduction in future engine systems, provide a streamlined approach to system design and implementation, and enable new opportunities for performance optimization and increased awareness about system health. The transition from a centralized, point-to-point analog control topology to a modular, networked, distributed system is paramount to extracting these system improvements. However, distributed engine control systems are only possible through the successful design and implementation of a suitable communication system. In a networked system, understanding the data flow between control elements is a fundamental requirement for specifying the communication architecture which, itself, is dependent on the functional capability of electronics in the engine environment. This paper presents an assessment of the communication needs for distributed control using strawman designs and relates how system design decisions relate to overall goals as we progress from the baseline centralized architecture, through partially distributed and fully distributed control systems.

Culley, Dennis E.↗
NASA NTRS2011

Attitude Estimation in Fractionated Spacecraft Cluster Systems

An attitude estimation was examined in fractioned free-flying spacecraft. Instead of a single, monolithic spacecraft, a fractionated free-flying spacecraft uses multiple spacecraft modules. These modules are connected only through wireless communication links and, potentially, wireless power links. The key advantage of this concept is the ability to respond to uncertainty. For example, if a single spacecraft module in the cluster fails, a new one can be launched at a lower cost and risk than would be incurred with onorbit servicing or replacement of the monolithic spacecraft. In order to create such a system, however, it is essential to know what the navigation capabilities of the fractionated system are as a function of the capabilities of the individual modules, and to have an algorithm that can perform estimation of the attitudes and relative positions of the modules with fractionated sensing capabilities. Looking specifically at fractionated attitude estimation with startrackers and optical relative attitude sensors, a set of mathematical tools has been developed that specify the set of sensors necessary to ensure that the attitude of the entire cluster ( cluster attitude ) can be observed. Also developed was a navigation filter that can estimate the cluster attitude if these conditions are satisfied. Each module in the cluster may have either a startracker, a relative attitude sensor, or both. An extended Kalman filter can be used to estimate the attitude of all modules. A range of estimation performances can be achieved depending on the sensors used and the topology of the sensing network.

Hadaegh, Fred Y.↗
NASA NTRS1972

Computer analysis of general linear networks using digraphs.

Investigation of the application of digraphs in analyzing general electronic networks, and development of a computer program based on a particular digraph method developed by Chen. The Chen digraph method is a topological method for solution of networks and serves as a shortcut when hand calculations are required. The advantage offered by this method of analysis is that the results are in symbolic form. It is limited, however, by the size of network that may be handled. Usually hand calculations become too tedious for networks larger than about five nodes, depending on how many elements the network contains. Direct determinant expansion for a five-node network is a very tedious process also.

Mcclenahan, J. O.↗
NASA NTRS2004

Transformations in Air Transportation Systems For the 21st Century

Globally, our transportation systems face increasingly discomforting realities: certain of the legacy air and ground infrastructures of the 20th century will not satisfy our 21st century mobility needs. The consequence of inaction is diminished quality of life and economic opportunity for those nations unable to transform from the 20th to 21st century systems. Clearly, new thinking is required regarding business models that cater to consumers value of time, airspace architectures that enable those new business models, and technology strategies for innovating at the system-of-networks level. This lecture proposes a structured way of thinking about transformation from the legacy systems of the 20th century toward new systems for the 21st century. The comparison and contrast between the legacy systems of the 20th century and the transformed systems of the 21st century provides insights into the structure of transformation of air transportation. Where the legacy systems tend to be analog (versus digital), centralized (versus distributed), and scheduled (versus on-demand) for example, transformed 21st century systems become capable of scalability through technological, business, and policy innovations. Where air mobility in our legacy systems of the 20th century brought economic opportunity and quality of life to large service markets, transformed air mobility of the 21st century becomes more equitable available to ever-thinner and widely distributed populations. Several technological developments in the traditional aircraft disciplines as well as in communication, navigation, surveillance and information systems create new foundations for 21st thinking about air transportation. One of the technological developments of importance arises from complexity science and modern network theory. Scale-free (i.e., scalable) networks represent a promising concept space for modeling airspace system architectures, and for assessing network performance in terms of robustness, resilience, and other metrics. The lecture offers an air transportation system topology and a scale-free network linkage graphic as framework for transportation system innovation. Successful outcomes of innovation in air transportation could lay the foundations for new paradigms for aircraft and their operating capabilities, air transportation system topologies, and airspace architectures and procedural concepts. These new paradigms could support scalable alternatives for the expansion of future air mobility to more consumers in more parts of the world.

Holmes, Bruce J.↗
NASA NTRS1994

Micro-Sensor Networks

The concept of an all-fiber, IC-based sensor network is presented. Fundamental issues including topology tradeoffs, power budget, and power distribution subsystem are analyzed. Some potential applications of such sensor networks are discussed.

networks↗
NASA NTRSDate not supplied

Gateway Command and Data Handling Network Implementation and Validation

As initial Lunar Gateway modules approach design maturity, the Artemis Network Validation and Integration Lab (ANVIL) has begun demonstrations to validate avionics network dataflows. The flight architecture design includes utilizing Time-Triggered Ethernet (TTE) and layer-3 switching capabilities to enable greater automation and flexibility of critical and best effort traffic. Critical traffic is considered as Time-Triggered (TT), Rate Constrained (RC) and prioritized Best Effort (BE) traffic classes. End systems, such as mission computers, power control, and robotics, use three planes and all traffic classes while other devices interface via Best Effort. Typical best effort devices include video, laptops, wireless access points, and payloads. Other devices have a various hybrid approach of interfaces including alarms, telemetry/logging, and communication units. In the paper, we will present an update of the Gateway network architecture and how the system will operate nominally and during a stack topology reconfiguration. We will also discuss the network risks, and trade-offs of performance, flexibility, and redundancy. Finally, we will show the process for validation, demonstration, and verification approaches to the vehicle network.

Gateway↗
NASA NTRS1985

Advanced local area network concepts

Development of a good model of the data traffic requirements for Local Area Networks (LANs) onboard the Space Station is the driving problem in this work. A parameterized workload model is under development. An analysis contract has been started specifically to capture the distributed processing requirements for the Space Station and then to develop a top level model to simulate how various processing scenarios can handle the workload and what data communication patterns result. A summary of the Local Area Network Extendsible Simulator 2 Requirements Specification and excerpts from a grant report on the topological design of fiber optic local area networks with application to Expressnet are given.

Grant, Terry↗
NASA NTRS1989

Hyperswitch Network For Hypercube Computer

Data-driven dynamic switching enables high speed data transfer. Proposed hyperswitch network based on mixed static and dynamic topologies. Routing header modified in response to congestion or faults encountered as path established. Static topology meets requirement if nodes have switching elements that perform necessary routing header revisions dynamically. Hypercube topology now being implemented with switching element in each computer node aimed at designing very-richly-interconnected multicomputer system. Interconnection network connects great number of small computer nodes, using fixed hypercube topology, characterized by point-to-point links between nodes.

Chow, Edward↗
NASA NTRS2004

Adaptive Bio-Inspired Wireless Network Routing for Planetary Surface Exploration

Wireless mobile networks suffer connectivity loss when used in a terrain that has hills, and valleys when line of sight is interrupted or range is exceeded. To resolve this problem and achieve acceptable network performance, we have designed an adaptive, configurable, hybrid system to automatically route network packets along the best path between multiple geographically dispersed modules. This is very useful in planetary surface exploration, especially for ad-hoc mobile networks, where computational devices take an active part in creating a network infrastructure, and can actually be used to route data dynamically and even store data for later transmission between networks. Using inspiration from biological systems, this research proposes to use ant trail algorithms with multi-layered information maps (topographic maps, RF coverage maps) to determine the best route through ad-hoc network at real time. The determination of best route is a complex one, and requires research into the appropriate metrics, best method to identify the best path, optimizing traffic capacity, network performance, reliability, processing capabilities and cost. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing through the use of pheromones. They are also able to adapt to changes in the environment using subtle clues. To use ant trail algorithms, we need to define the probability function. The artificial ant is, in this case, a software agent that moves from node to node on a network graph. The function to calculate the fitness (evaluate the better path) includes: length of the network edge, the coverage index, topology graph index, and pheromone trail left behind by other ant agents. Each agent modifies the environment in two different ways: 1) Local trail updating: As the ant moves between nodes it updates the amount of pheromone on the edge; and 2) Global trail updating: When all ants have completed a tour the ant that found the shortest route updates the edges in its path.

Alena, Richard I.↗