Search NASA⌕ Search

SEARCH · Search NASA

Results for “Network Simulation”

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 NTRS2006

Simulation of Lunar Surface Communications Network Exploration Scenarios

Simulations and modeling of surface-based communications networks provides a rapid and cost effective means of requirement analysis, protocol assessments, and tradeoff studies. Robust testing in especially important for exploration systems, where the cost of deployment is high and systems cannot be easily replaced or repaired. However, simulation of the envisioned exploration networks cannot be achieved using commercial off the shelf network simulation software. Models for the nonstandard, non-COTS protocols used aboard space systems are not readily available. This paper will address the simulation of realistic scenarios representative of the activities which will take place on the surface of the Moon, including selection of candidate network architectures, and the development of an integrated simulation tool using OPNET modeler capable of faithfully modeling those communications scenarios in the variable delay, dynamic surface environments. Scenarios for exploration missions, OPNET development, limitations, and simulations results will be provided and discussed.

Linsky, Thomas W.↗
DOE OSTI2014

Incorporating social impact on new product adoption in choice modeing: A case study in green vehicles

While discrete choice analysis is prevalent in capturing consumer preferences and describing their choice behaviors in product design, the traditional choice modeling approach assumes that each individual makes independent decisions, without considering the social impact. However, empirical studies show that choice is social - influenced by many factors beyond engineering performance of a product and consumer attributes. To alleviate this limitation, we propose a new choice modeling framework to capture the dynamic influence from social networks on consumer adoption of new products. By introducing social influence attributes into a choice utility function, social network simulation is integrated with the traditional discrete choice analysis in a three-stage process. Our study shows the need for considering social impact in forecasting new product adoption. Using hybrid electric vehicles as an example, our work illustrates the procedure of social network construction, social influence evaluation, and choice model estimation based on data from the National Household Travel Survey. Our study also demonstrates several interesting findings on the dynamic nature of new technology adoption and how social networks may influence hybrid electric vehicle adoption. (C) 2014 Elsevier Ltd. All rights reserved

Discrete choice analysis↗
NASA NTRS1987

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.↗
NASA NTRS1988

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.↗
NASA NTRS1999

Advances Made in the Next Generation of Satellite Networks

Because of the unique networking characteristics of communications satellites, global satellite networks are moving to the forefront in enhancing national and global information infrastructures. Simultaneously, broadband data services, which are emerging as the major market driver for future satellite and terrestrial networks, are being widely acknowledged as the foundation for an efficient global information infrastructure. In the past 2 years, various task forces and working groups around the globe have identified pivotal topics and key issues to address if we are to realize such networks in a timely fashion. In response, industry, government, and academia undertook efforts to address these topics and issues. A workshop was organized to provide a forum to assess the current state-of-the-art, identify key issues, and highlight the emerging trends in the next-generation architectures, data protocol development, communication interoperability, and applications. The Satellite Networks: Architectures, Applications, and Technologies Workshop was hosted by the Space Communication Program at the NASA Lewis Research Center in Cleveland, Ohio. Nearly 300 executives and technical experts from academia, industry, and government, representing the United States and eight other countries, attended the event (June 2 to 4, 1998). The program included seven panels and invited sessions and nine breakout sessions in which 42 speakers presented on technical topics. The proceedings covers a wide range of topics: access technology and protocols, architectures and network simulations, asynchronous transfer mode (ATM) over satellite networks, Internet over satellite networks, interoperability experiments and applications, multicasting, NASA interoperability experiment programs, NASA mission applications, and Transmission Control Protocol/Internet Protocol (TCP/IP) over satellite: issues, relevance, and experience.

Bhasin, Kul B.↗
DOE OSTI2025

Simulators for quantum network modeling: A comprehensive review

Quantum network research is exploring new networking protocols, physics-based hardware and novel experiments to demonstrate how quantum distribution will work over large distances. Current work explores much of these concepts in simulations, that are developed to understand how quantum networking will be set up and researchers can experiment virtually. Exposing flaws in network designs, like unsustainable topologies, or develop protocols that efficiently utilize network resources, simulators can also help assess whether workloads are balanced across virtual machines in the network. However, much of these simulation models come without reliable verification methods, for testing performance in real deployments. Here, in this paper, we present a review of, to the best of our knowledge, currently used toolkits for modeling quantum networks. With these toolkits and standardized validation techniques, we can lay down the foundations for more accurate and reliable quantum network simulators.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1990

Rate-based congestion control in networks with smart links, revision

The author uses a network simulator to explore rate-based congestion control in networks with smart links that can feed back information to tell senders to adjust their transmission rates. This method differs in a very important way from congestion control in which a congested network component just drops packets - the most commonly used method. It is clearly advantageous for the links in the network to communicate with the end users about the network capacity, rather than the users unilaterally picking a transmission rate. The components in the middle of the network, not the end users, have information about the capacity and traffic in the network. The author experiments with three different algorithms for calculating the control rate to feed back to the users. All of the algorithms exhibit problems in the form of large queues when simulated with a configuration modeling the dynamics of a packet-voice system. However, the problems are not with the algorithms themselves, but with the fact that feedback takes time. If the network steady-state utilization is low enough that it can absorb transients in the traffic through it, then the large queues disappear. If the users are modified to start sending slowly, to allow the network to adapt to a new flow without causing congestion, a greater portion of the network's bandwidth can be used.

Heybey, Andrew Tyrrell↗
DOE OSTI2019

Matrix Diffusion in Fractured Media: New Insights Into Power Law Scaling of Breakthrough Curves

Here, we develop a theoretical model for power law tailing behavior of transport in fractured rock based on the relative dominance of the decay rate of the advective travel time distribution, modeled using a Pareto distribution (with tail decaying as ~ time -(1+α) ), versus matrix diffusion, modeled using a Lévy distribution. The theory predicts that when the advective travel time distribution decays sufficiently slowly (α<1), the late-time decay rate of the breakthrough curve is -(1+α/2) rather than the classical -3/2. Yet, if α>1, the -3/2 decay rate is recovered. For weak matrix diffusion or short advective first breakthrough times, we identify an early-time regime where the breakthrough curve follows the Pareto distribution, before transitioning to the late-time decay rate. The theoretical predictions are validated against particle tracking simulations in the three-dimensional discrete fracture network simulator dfnWorks, where matrix diffusion is incorporated using a time domain random walk.

58 GEOSCIENCES↗
DOE OSTI2023

Simulating lossy Gaussian boson sampling with matrix-product operators

Gaussian boson sampling, a computational model that is widely believed to admit quantum supremacy, has already been experimentally demonstrated and is claimed to surpass the classical simulation capabilities of even the most powerful supercomputers today. However, whether the current approach limited by photon loss and noise in such experiments prescribes a scalable path to quantum advantage is an open question. Here, to understand the effect of photon loss on the scalability of Gaussian boson sampling, we analytically derive the asymptotic operator entanglement entropy scaling, which relates to the simulation complexity. As a result, we observe that efficient tensor network simulations are likely possible under the N out ∝ √N scaling of the number of surviving photons N out in the number of input photons N. We numerically verify this result using a tensor network algorithm with U⁡(1) symmetry, and we overcome previous challenges due to the large local Hilbert-space dimensions in Gaussian boson sampling with hardware acceleration. Additionally, we observe that increasing the photon number through larger squeezing does not increase the entanglement entropy significantly. Finally, we numerically find the bond dimension necessary for fixed accuracy simulations, providing more direct evidence for the complexity of tensor networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Development of HELICS-Based High-Performance Cyber-Physical Co-Simulation Framework for Distributed Energy Resources Applications

The rapid growth of distributed energy resources (DERs) has prompted increasing interest in the monitoring and control of DERs through hybrid smart grid communications resulting in the typical smart grid cyber-physical system. To fully understand the interdependency between them, we propose to integrate the Network Simulator 3 (NS3) into the High Engine for Large-Scale Infrastructure Co-Simulation (HELICS), a new open-source, cyber-physical-energy co-simulation platform. This paper aims to the development and case study of the HELICS-based high performance distribution-communication co-simulation framework for the DER coordination. The novel co-simulation framework for the NS3 integrating into the HELICS is developed. The DER monitoring application about hybrid smart grid communication network design is simulated and validated on this proposed HELICS-based cyber-physical co-simulation platform.

41 EE - Solar Energy Technologies Office (EE-4S)↗
NASA NTRS1983

ADA and multi-microprocessor real-time simulation

The selection of a high-order programming language for a real-time distributed network simulation is described. The additional problem of implementing a language on a possibly changing network is addressed. The recently designed language ADA (trademarked by DoD) was chosen since it provides the best model of the underlying application to be simulated.

Feyock, S.↗
NASA NTRS1989

Implementation issues in source coding

An edge preserving image coding scheme which can be operated in both a lossy and a lossless manner was developed. The technique is an extension of the lossless encoding algorithm developed for the Mars observer spectral data. It can also be viewed as a modification of the DPCM algorithm. A packet video simulator was also developed from an existing modified packet network simulator. The coding scheme for this system is a modification of the mixture block coding (MBC) scheme described in the last report. Coding algorithms for packet video were also investigated.

Sayood, Khalid↗
NASA NTRS1989

A large scale software system for simulation and design optimization of mechanical systems

The concept of an advanced integrated, networked simulation and design system is outlined. Such an advanced system can be developed utilizing existing codes without compromising the integrity and functionality of the system. An example has been used to demonstrate the applicability of the concept of the integrated system outlined here. The development of an integrated system can be done incrementally. Initial capabilities can be developed and implemented without having a detailed design of the global system. Only a conceptual global system must exist. For a fully integrated, user friendly design system, further research is needed in the areas of engineering data bases, distributed data bases, and advanced user interface design.

Dopker, Bernhard↗
DOE OSTI2015

On the rejection-based algorithm for simulation and analysis of large-scale reaction networks

Stochastic simulation for in silico studies of large biochemical networks requires a great amount of computational time. We recently proposed a new exact simulation algorithm, called the rejection-based stochastic simulation algorithm (RSSA) [Thanh et al., J. Chem. Phys. 141(13), 134116 (2014)], to improve simulation performance by postponing and collapsing as much as possible the propensity updates. In this paper, we analyze the performance of this algorithm in detail, and improve it for simulating large-scale biochemical reaction networks. We also present a new algorithm, called simultaneous RSSA (SRSSA), which generates many independent trajectories simultaneously for the analysis of the biochemical behavior. SRSSA improves simulation performance by utilizing a single data structure across simulations to select reaction firings and forming trajectories. The memory requirement for building and storing the data structure is thus independent of the number of trajectories. The updating of the data structure when needed is performed collectively in a single operation across the simulations. The trajectories generated by SRSSA are exact and independent of each other by exploiting the rejection-based mechanism. We test our new improvement on real biological systems with a wide range of reaction networks to demonstrate its applicability and efficiency.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

CP‐SyNet: A tool for generating customised cyber‐power synthetic network for distribution systems with distributed energy resources

Abstract The integration of distributed energy resources and advancement in information technology has enabled the transition of traditional power distribution systems to active cyber‐physical distribution systems. A growing amount of research has been done on the modelling, analysis, and optimisation of power distribution system behaviour. However, existing publicly available distribution test feeders are limited in numbers and have minimal features. Furthermore, these test feeders do not include cyber models and are not customisable. To bridge this gap, we propose and develop Cyber‐physical synthetic distribution system network (CP‐SyNet), a tool for generating customisable cyber‐physical synthetic distribution test feeders. CP‐SyNet generates three‐phase unbalanced test feeders according to users' requirements, while simultaneously considering both the cyber side and the physical side of the network for cyber‐physical analysis. The physical test network is developed using a graph‐theoretical approach that employs information from existing test feeders. The cyber side considers an equivalent communication network by transforming the physical topology into possible and feasible simulated network. Two examples are presented to demonstrate the feasibility of the proposed framework to generate cyber‐physical test feeders.

Wang, Lusha↗
DOE OSTI2022

Quantum Networks for Resilient Power Grids: Theory and Simulated Evaluation

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

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS2011

The Global Geodetic Observing System: Space Geodesy Networks for the Future

Ground-based networks of co-located space geodetic techniques (VLBI, SLR, GNSS. and DORIS) are the basis for the development and maintenance of the International Terrestrial Reference frame (ITRF), which is our metric of reference for measurements of global change, The Global Geodetic Observing System (GGOS) of the International Association of Geodesy (IAG) has established a task to develop a strategy to design, integrate and maintain the fundamental geodetic network and supporting infrastructure in a sustainable way to satisfy the long-term requirements for the reference frame. The GGOS goal is an origin definition at 1 mm or better and a temporal stability on the order of 0.1 mm/y, with similar numbers for the scale and orientation components. These goals are based on scientific requirements to address sea level rise with confidence, but other applications are not far behind. Recent studies including one by the US National Research Council has strongly stated the need and the urgency for the fundamental space geodesy network. Simulations are underway to examining accuracies for origin, scale and orientation of the resulting ITRF based on various network designs and system performance to determine the optimal global network to achieve this goal. To date these simulations indicate that 24 - 32 co-located stations are adequate to define the reference frame and a more dense GNSS and DORIS network will be required to distribute the reference frame to users anywhere on Earth. Stations in the new global network will require geologically stable sites with good weather, established infrastructure, and local support and personnel. GGOS wil seek groups that are interested in participation. GGOS intends to issues a Call for Participation of groups that would like to contribute in the network implementation and operation. Some examples of integrated stations currently in operation or under development will be presented. We will examine necessary conditions and challenges in designing a co-location station.

Pearlman, Michael↗