Search NASA⌕ Search

SEARCH · Search NASA

Results for “network scheduling”

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

Self-Driving Telescopes: Autonomous Scheduling of Astronomical Observation Campaigns with Offline Reinforcement Learning

Modern astronomical experiments are designed to achieve multiple scientific goals, from studies of galaxy evolution to cosmic acceleration. These goals require data of many different classes of night-sky objects, each of which has a particular set of observational needs. These observational needs are typically in strong competition with one another. This poses a challenging multi-objective optimization problem that remains unsolved. The effectiveness of Reinforcement Learning (RL) as a valuable paradigm for training autonomous systems has been well-demonstrated, and it may provide the basis for self-driving telescopes capable of optimizing the scheduling for astronomy campaigns. Simulated datasets containing examples of interactions between a telescope and a discrete set of sky locations on the celestial sphere can be used to train an RL model to sequentially gather data from these several locations to maximize a cumulative reward as a measure of the quality of the data gathered. We use simulated data to test and compare multiple implementations of a Deep Q-Network (DQN) for the task of optimizing the schedule of observations from the Stone Edge Observatory (SEO). We combine multiple improvements on the DQN and adjustments to the dataset, showing that DQNs can achieve an average reward of 87%+-6% of the maximum achievable reward in each state on the test set. This is the first comparison of offline RL algorithms for a particular astronomical challenge and the first open-source framework for performing such a comparison and assessment task.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
NASA NTRS1972

STADAN and data relay satellite simulation (emphasis on the scheduler)

A set of computer programs was developed which can be used to simulate the operation of NASA's Satellite Tracking and Data Acquisition Network (STADAN). The simulation consists of two major modules, a computerized algorithmic satellite scheduler (CASS) and a generalized evaluation model simulator (GEMS). CASS generates in-view time intervals of satellites over ground stations, and using these candidate passes, produces a schedule of service times for specific satellites to be serviced by specific ground stations in an attempt to fulfill certain inputted service requirements. GEMS than examines how well STADAN fulfills this schedule in terms of the availability and dependability of different (inputted) complements of equipment at the ground stations. The simulation was modified to allow for the introduction of one or more tracking and data relay satellites, which can serve as orbital receiving and command stations.

Kerne, B.↗
NASA NTRS2009

Current Status of the International Lunar Network (ILN) Anchor Nodes Mission

NASA's Science Mission Directorate s (SMD) International Lunar Network Anchor Nodes Mission continues its concept development and is scheduled to complete the first formal milestone gate of a Mission Concept Review (MCR) in Autumn 2009. The mission will establish two-four nodes of the International Lunar Network (ILN), a network of lunar geophysical stations envisioned to be emplaced by the many nations collaborating on this joint endeavor. This mission will operate over six years or more and make significant progress in satisfying many of the National Research Council s lunar science objectives, while strategically contributing to the U.S. Vision for Space Exploration Policy's objective for a robust robotic lunar program. This paper will provide a status report on the ILN Anchor Nodes mission and overview of the concept to date, which is being implemented jointly by NASA's Marshall Space Flight Center and The Johns Hopkins University Applied Physics Laboratory.

Cohen, Barbara A.↗
NASA NTRS2014

Dynamic Controllability and Dispatchability Relationships

An important issue for temporal planners is the ability to handle temporal uncertainty. Recent papers have addressed the question of how to tell whether a temporal network is Dynamically Controllable, i.e., whether the temporal requirements are feasible in the light of uncertain durations of some processes. We present a fast algorithm for Dynamic Controllability. We also note a correspondence between the reduction steps in the algorithm and the operations involved in converting the projections to dispatchable form. This has implications for the complexity for sparse networks.

controllability↗
NASA NTRS2015

TTEthernet for Integrated Spacecraft Networks

Aerospace projects have traditionally employed federated avionics architectures, in which each computer system is designed to perform one specific function (e.g. navigation). There are obvious downsides to this approach, including excessive weight (from so much computing hardware), and inefficient processor utilization (since modern processors are capable of performing multiple tasks). There has therefore been a push for integrated modular avionics (IMA), in which common computing platforms can be leveraged for different purposes. This consolidation of multiple vehicle functions to shared computing platforms can significantly reduce spacecraft cost, weight, and design complexity. However, the application of IMA principles introduces significant challenges, as the data network must accommodate traffic of mixed criticality and performance levels - potentially all related to the same shared computer hardware. Because individual network technologies are rarely so competent, the development of truly integrated network architectures often proves unreasonable. Several different types of networks are utilized - each suited to support a specific vehicle function. Critical functions are typically driven by precise timing loops, requiring networks with strict guarantees regarding message latency (i.e. determinism) and fault-tolerance. Alternatively, non-critical systems generally employ data networks prioritizing flexibility and high performance over reliable operation. Switched Ethernet has seen widespread success filling this role in terrestrial applications. Its high speed, flexibility, and the availability of inexpensive commercial off-the-shelf (COTS) components make it desirable for inclusion in spacecraft platforms. Basic Ethernet configurations have been incorporated into several preexisting aerospace projects, including both the Space Shuttle and International Space Station (ISS). However, classical switched Ethernet cannot provide the high level of network determinism required by real-time spacecraft applications. Even with modern advancements, the uncoordinated (i.e. event-driven) nature of Ethernet communication unavoidably leads to message contention within network switches. The arbitration process used to resolve such conflicts introduces variation in the time it takes for messages to be forwarded. TTEthernet1 introduces decentralized clock synchronization to switched Ethernet, enabling message transmission according to a time-triggered (TT) paradigm. A network planning tool is used to allocate each device a finite amount of time in which it may transmit a frame. Each time slot is repeated sequentially to form a periodic communication schedule that is then loaded onto each TTEthernet device (e.g. switches and end systems). Each network participant references the synchronized time in order to dispatch messages at predetermined instances. This schedule guarantees that no contention exists between time-triggered Ethernet frames in the network switches, therefore eliminating the need for arbitration (and the timing variation it causes). Besides time-triggered messaging, TTEthernet networks may provide two additional traffic classes to support communication of different criticality levels. In the rate-constrained (RC) traffic class, the frame payload size and rate of transmission along each communication channel are limited to predetermined maximums. The network switches can therefore be configured to accommodate the known worst-case traffic pattern, and buffer overflows can be eliminated. The best-effort (BE) traffic class behaves akin to classical Ethernet. No guarantees are provided regarding transmission latency or successful message delivery. TTEthernet coordinates transmission of all three traffic classes over the same physical connections, therefore accommodating the full spectrum of traffic criticality levels required in IMA architectures. Common computing platforms (e.g. LRUs) can share networking resources in such a way that failures in non-critical systems (using BE or RC communication modes) cannot impact flight-critical functions (using TT communication). Furthermore, TTEthernet hardware (e.g. switches, cabling) can be shared by both TTEthernet and classical Ethernet traffic.

Loveless, Andrew↗
NASA NTRS1975

Planning air transport network in Appalachia

Main issues to be considered in designing an air transport system are discussed, and a model for the selection of an optimal air network for a region is presented. It was desired to have the ability to consider a dense network of nodes and air routes and variations in schedules on routes, which in combination would represent virtually all conceivable alternatives. Linear and integer programming were chosen as the most promising analysis methodologies. Integer programming was found to be intractable, while linear programming provided efficient solutions. The model was applied to studying the feasibility of a STOL network in West Virginia. Based on allowable paths, an examination of intercity demands, and established growth points, desired levels of service expressed as minimum flights were determined for certain city pairs.

Carter, E. C.↗
NASA NTRS1998

The SGI/Cray T3E: Experiences and Insights

The NASA Goddard Space Flight Center is home to the fifth most powerful supercomputer in the world, a 1024 processor SGI/Cray T3E-600. The original 512 processor system was placed at Goddard in March, 1997 as part of a cooperative agreement between the High Performance Computing and Communications Program's Earth and Space Sciences Project (ESS) and SGI/Cray Research. The goal of this system is to facilitate achievement of the Project milestones of 10, 50 and 100 GFLOPS sustained performance on selected Earth and space science application codes. The additional 512 processors were purchased in March, 1998 by the NASA Earth Science Enterprise for the NASA Seasonal to Interannual Prediction Project (NSIPP). These two "halves" still operate as a single system, and must satisfy the unique requirements of both aforementioned groups, as well as guest researchers from the Earth, space, microgravity, manned space flight and aeronautics communities. Few large scalable parallel systems are configured for capability computing, so models are hard to find. This unique environment has created a challenging system administration task, and has yielded some insights into the supercomputing needs of the various NASA Enterprises, as well as insights into the strengths and weaknesses of the T3E architecture and software. The T3E is a distributed memory system in which the processing elements (PE's) are connected by a low latency, high bandwidth bidirectional 3-D torus. Due to the focus on high speed communication between PE's, the T3E requires PE's to be allocated contiguously per job. Further, jobs will only execute on the user specified number of PE's and PE timesharing is possible but impractical. With a highly varied job mix in both size and runtime of jobs, the resulting scenario is PE fragmentation and an inability to achieve near 100% utilization. SGI/Cray has provided several scheduling and configuration tools to minimize the impact of fragmentation. These tools include PScheD (the political scheduler), GRM (the global resource manager) and NQE (the Network Queuing Environment). Features and impact of these tools will be discussed, as will resulting performance and utilization data. As a distributed memory system, the T3E is designed to be programmed through explicit message passing. Consequently, certain assumptions related to code design are made by the operating system (UNICOS/mk) and its scheduling tools. With the exception of HPF, which does run on the T3E, however poorly, alternative programming styles have the potential to impact the T3E in unexpected and undesirable ways. Several examples will be presented (preceeded with the disclaimer, "Don't try this at home! Violators will be prosecuted!")

Bernard, Lisa Hamet↗
NASA NTRS2000

Message Mode Operations for Spacecraft: A Proposal for Operating Spacecraft During Cruise and Mitigating the Network Loading Crunch

The NASA Deep Space Network (DSN) is a world-class spacecraft tracking facility with stations located in Spain, Australia and USA, servicing Deep Space Missions of many space agencies. The current system of scheduling spacecraft during cruise for multiple 8 hour tracking sessions per week currently leads to an overcommitted DSN. Studies indicate that future projected mission demands upon the Network will only make the loading problem worse. Therefore, a more efficient scheduling of DSN resources is necessary in order to support the additional network loading envisioned in the next few years: The number of missions is projected to increase from 25 in 1998 to 34 by 2001. In fact given the challenge of the NASA administrator, Dan Goldin, of launching 12 spacecraft per year, the DSN would be tracking approximately 90 spacecraft by 2010. Currently a large amount of antenna time and network resources are subscribed by a project in order to have their mission supported during the cruise phase. The recently completed Mars Pathfinder mission was tracked 3 times a week (8 hours/day) during the majority of its cruise to Mars. This paper proposes an innovative approach called Message Mode Operations (MMO) for mitigating the Network loading problem while continuing to meet the tracking, reporting, time management, and scheduling requirements of these missions during Cruise while occupying very short tracking times. MMO satisfies these requirements by providing the following services: Spacecraft Health and Welfare Monitoring Service Command Delivery Service Adaptive Spacecraft Scheduling Service Orbit Determination Service Time Calibration Service Utilizing more efficient engineering telemetry summarization and filtering techniques on-board the spacecraft and collapsing the navigation requirements for Doppler and Range into shorter tracks, we believe spacecraft can be adequately serviced using short 10 to 30 minute tracking sessions. This claim assumes that certain changes would have to he made in the way the Network traditionally services missions in Cruise. Furthermore, limiting spacecraft to short sessions will free up larger blocks of time in the tracking schedule to help accommodate future tracking demands soon to be placed upon the Network. This paper describes the key characteristics and benefits of MMO, the operational scenarios for its use, the required changes to the ground system in order to make this approach feasible and the results of two simulations: 1) to determine the effects of MMO on projected mission loading on the DSN and, 2) to determine the effect MMO has on spacecraft orbit determination.

Greenberg, Ed↗
NASA NTRS2003

Scale-free Graphs for General Aviation Flight Schedules

In the late 1990s a number of researchers noticed that networks in biology, sociology, and telecommunications exhibited similar characteristics unlike standard random networks. In particular, they found that the cummulative degree distributions of these graphs followed a power law rather than a binomial distribution and that their clustering coefficients tended to a nonzero constant as the number of nodes, n, became large rather than O(1/n). Moreover, these networks shared an important property with traditional random graphs as n becomes large the average shortest path length scales with log n. This latter property has been coined the small-world property. When taken together these three properties small-world, power law, and constant clustering coefficient describe what are now most commonly referred to as scale-free networks. Since 1997 at least six books and over 400 articles have been written about scale-free networks. In this manuscript an overview of the salient characteristics of scale-free networks. Computational experience will be provided for two mechanisms that grow (dynamic) scale-free graphs. Additional computational experience will be given for constructing (static) scale-free graphs via a tabu search optimization approach. Finally, a discussion of potential applications to general aviation networks is given.

Alexandov, Natalia M.↗
NASA NTRS1993

Population-based learning of load balancing policies for a distributed computer system

Effective load-balancing policies use dynamic resource information to schedule tasks in a distributed computer system. We present a novel method for automatically learning such policies. At each site in our system, we use a comparator neural network to predict the relative speedup of an incoming task using only the resource-utilization patterns obtained prior to the task's arrival. Outputs of these comparator networks are broadcast periodically over the distributed system, and the resource schedulers at each site use these values to determine the best site for executing an incoming task. The delays incurred in propagating workload information and tasks from one site to another, as well as the dynamic and unpredictable nature of workloads in multiprogrammed multiprocessors, may cause the workload pattern at the time of execution to differ from patterns prevailing at the times of load-index computation and decision making. Our load-balancing policy accommodates this uncertainty by using certain tunable parameters. We present a population-based machine-learning algorithm that adjusts these parameters in order to achieve high average speedups with respect to local execution. Our results show that our load-balancing policy, when combined with the comparator neural network for workload characterization, is effective in exploiting idle resources in a distributed computer system.

Mehra, Pankaj↗
DOE OSTI2020

Models and Strategies for Optimal Demand Side Management in the Chemical Industries

Deregulation and the increase of renewable electricity generation from wind and solar photovoltaics have transformed the U.S. electricity market. Economic and environmental benefits notwithstanding, the presence of renewables has increased variability and uncertainty on the supply side of the grid. Managing demand, rather than generation – a strategy referred to as “demand response (DR)” – is an attractive approach for mitigating this imbalance. DR efforts aim to reduce electricity usage during peak demand times, lessening stress on the grid. Industrial users are particularly attractive entities for DR participation since they present large, localized loads that can provide significant relief on grid demand and –unlike other large loads, such as buildings – are minimally dependent on human needs and preferences. In this project, we accomplished three main objectives. (1) We developed data-driven low-order DR scheduling-relevant dynamic models of chemical processes. Concurrently, we studied the formulation and solution of the associated optimal DR production scheduling problems. (a) A prototype air separation unit (ASU) model was used to generate simulated operating data for initial modeling efforts, which enabled the later use of industrial data for data-driven modeling. (b) We utilized Hammerstein-Wiener (HW) and Finite Step Response (FSR) models to represent nonlinear plant dynamics. (c) The HW models were linearized using exact linearization so they could potentially be embedded in power system models, which are formulated as mixed integer linear programs (MILPs). (d) We solved DR optimization problems under uncertainty and found that even naïve predictions of electricity price and product demand led to significant cost savings benefits. (2) Our DR scheduling optimization problem formulations are amenable to real-time solution. (a) We utilized Lagrangian Relaxation (LR) to efficiently solve the optimization problem by decoupling subproblems linked by complicating constraints. (b) We have achieved computation times for the 3-day DR scheduling problem of an ASU as low as 1.88 minutes. (3) Our representations of the DR behavior of chemical process as grid-level batteries were embedded in power system models. (a) For a small-scale grid, we found that incorporating the dynamics of the chemical plant in the optimal power flow calculations resulted in better resource management leading to up to 15% and 46% cost reduction for the grid and chemical plant operations, respectively, during periods of power line congestion. We have published several works dedicated to modeling and solving DR optimization problems from the user side. These were published in top peer-reviewed journals and are summarized in this report. The most recent work (and papers in preparation) considers DR scheduling from the grid side. Future efforts will consider networked plants (e.g., air separation units operating on a common pipeline) for DR participation, which is expected to amplify the capabilities of industrial DR participants to perform load-shifting. Our consideration of uncertainty in DR has inspired future directions in this area as well: we plan to develop multistage methods to fully account for the effects of uncertainty in DR scheduling.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Modeling the AC Power Flow Equations with Optimally Compact Neural Networks: Application to Unit Commitment

Nonlinear power flow constraints render a variety of power system optimization problems computationally intractable. Emerging research shows, however, that the nonlinear AC power flow equations can be successfully modeled using neural networks. These neural networks can be exactly transformed into mixed integer linear programs and embedded inside challenging optimization problems, thus replacing nonlinearities that are intractable for many applications with tractable piecewise linear approximations. Such approaches, though, suffer from an explosion of the number of binary variables needed to represent the neural network. Accordingly, this paper develops a technique for training an "optimally compact'' neural network, i.e., one that can represent the power flow equations with a sufficiently high degree of accuracy while still maintaining a tractable number of binary variables. We demonstrate the use of this neural network as an approximator of the nonlinear power flow equations by embedding it in the AC unit commitment problem, transforming the problem from a mixed integer nonlinear program into a more manageable mixed integer linear program. We use the 14-, 57-, and 89-bus networks as test cases and compare the AC-feasibility of commitment decisions resulting from the neural network, DC, and linearized power flow approximations. Our results show that the neural network model outperforms both the DC and linearized power flow approximations when embedded in the unit commitment problem. The neural network formulation most often selects a feasible unit commitment schedule, and furthermore, it only s

AC power flow↗
NASA NTRSDate not supplied

Traffic Flow Analysis for Package Delivery Drones using a Queueing Model

A key component of the small unmanned aircraft systems traffic management ecosystem is the design of scalable algorithms for strategic deconfliction of drones prior to takeoff. In this work, we focus on efficient flow management of drones on a network of intersecting edges subject to two kinds of spacing constraints: 1) between any two adjacent vehicles on an edge and 2) between any two vehicles on two different edges arriving one after the other at an intersection. The spacing is designed to enable non-intersection of operational volumes corresponding to two different vehicles thereby properly separating the vehicles inside each volume. For simplicity, we assume a constant ground speed for the drones and fixed dimensions for the operational volume blocks. The deconfliction is managed by adjusting the takeoff time of the drones, thereby regulating their arrival time at various crossing waypoints in the network. This framework allows us to study the maximum flow (throughput) of vehicles on a network of edges connecting depots to drop off sites subject to the temporal spacing constraints. The departure scheduling of individual drones results in a combinatorial optimization problem. To alleviate this, we solve a max-flow formulation and use queueing theory to simplify the analysis and provide upper bounds to the underlying optimization problem for individual drone departure scheduling. Our results indicate that throughput drops rapidly after the density of drones in the network passes the max-flow limits.

Alexey A Munishkin↗
DOE OSTI2023

Control coordination in inverter‐based microgrids using AoI‐based 5G schedulers

Abstract A coordinated set point automatic adjustment with correction enabled (C‐SPAACE) framework that uses 5G communication for real‐time control coordination between inverter‐based resources (IBR) in microgrids is proposed. Utilising slicing capability, 5G offers low‐latency communication to C‐SPAACE under normal conditions. However, given the multitude of power grid use cases, a certain 5G slice for C‐SPAACE may have access only to limited radio spectrum resources, which if not managed well, greatly undermines the communication needs of C‐SPAACE framework. Thus, optimally scheduling the available spectrum resources among IBRs in a sliced 5G network‐based C‐SPAACE framework becomes a critical problem. To address this issue, the authors utilise a novel age of information (AoI) metric and designs an AoI‐based 5G scheduler to provide low‐latency communication to C‐SPAACE. Following this, a co‐simulation environment is designed using PSCAD/EMTDC and Python to simulate a microgrid supported by 5G communication. Time‐domain simulation case studies are performed using the proposed co‐simulation environment to evaluate the performance of C‐SPAACE using 5G with both AoI‐based and other baseline (non‐AoI) schedulers.

Choudhury, Biplav↗
DOE OSTI2020

Scalable and Actionable Performance Measures for Traffic Signal Systems using Probe Vehicle Trajectory Data

Scalable and actionable performance measures for traffic signal systems provide opportunities for practitioners to measure and improve the transportation network. Historically, traffic signal improvements have relied on scheduled signal retiming based on limited data collection, or on the public to call and alert engineers of an issue. This inefficient method of improving signal timing led to the creation of automated traffic signal performance measures (ATSPMs). These metrics rely on expensive infrastructure, including detection and communications, which has produced barriers for numerous agencies to fully adopt. Recently, third-party data providers have begun to release vehicle trajectory data, which allows for enhanced signal metrics with no investment in physical equipment. The purpose of this study is to demonstrate the use of these data and summarize the scalability of the created metrics. This work builds on previous efforts to quantify signal performance on nine intersections in Michigan, U.S. Ten signalized corridors in Columbus, Ohio, were chosen to scale a performance assessment using crowdsourced trajectory data. A total of 136 intersections were assessed in 2-h intervals using data from all weekdays in 2017. High-level corridor summary metrics including average percent of vehicles stopping (18%–32%), average delay (9.4–20.5 s), and level of travel time reliability (1.23–2.73) were calculated for each corridor direction. Intersection-level metrics were also introduced, which can be used by practitioners to identify problems, improve signal timings, and prioritize future infrastructure investments.

99 GENERAL AND MISCELLANEOUS↗
NASA NTRS1977

PERT TIME III

System utilizing time oriented network structure is automated aid for monitoring and scheduling various activities within particular project. Program provides management with means to evaluate accurately status of project and helps control time, cost, and manpower.

Source record↗
NASA NTRS1981

Columbia's first flight shakes down space transportation system

The first space shuttle mission is described. Topics include launch preparations, flight profile, trajectory, and landing operations. The spaceflight tracking and data network is discussed and the photography and television schedules are included.

Garrett, D.↗
NASA NTRS2009

Service Management Database for DSN Equipment

This data- and event-driven persistent storage system leverages the use of commercial software provided by Oracle for portability, ease of maintenance, scalability, and ease of integration with embedded, client-server, and multi-tiered applications. In this role, the Service Management Database (SMDB) is a key component of the overall end-to-end process involved in the scheduling, preparation, and configuration of the Deep Space Network (DSN) equipment needed to perform the various telecommunication services the DSN provides to its customers worldwide. SMDB makes efficient use of triggers, stored procedures, queuing functions, e-mail capabilities, data management, and Java integration features provided by the Oracle relational database management system. SMDB uses a third normal form schema design that allows for simple data maintenance procedures and thin layers of integration with client applications. The software provides an integrated event logging system with ability to publish events to a JMS messaging system for synchronous and asynchronous delivery to subscribed applications. It provides a structured classification of events and application-level messages stored in database tables that are accessible by monitoring applications for real-time monitoring or for troubleshooting and analysis over historical archives.

Zendejas, Silvino↗