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 703 records · Page 39

High performance techniques for space mission scheduling

In this paper, we summarize current research at Carnegie Mellon University aimed at development of high performance techniques and tools for space mission scheduling. Similar to prior research in opportunistic scheduling, our approach assumes the use of dynamic analysis of problem constraints as a basis for heuristic focusing of problem solving search. This methodology, however, is grounded in representational assumptions more akin to those adopted in recent temporal planning research, and in a problem solving framework which similarly emphasizes constraint posting in an explicitly maintained solution constraint network. These more general representational assumptions are necessitated by the predominance of state-dependent constraints in space mission planning domains, and the consequent need to integrate resource allocation and plan synthesis processes. First, we review the space mission problems we have considered to date and indicate the results obtained in these application domains. Next, we summarize recent work in constraint posting scheduling procedures, which offer the promise of better future solutions to this class of problems.

Smith, Stephen F.↗

An MILP-Based Distributed Energy Management for Coordination of Networked Microgrids

An MILP-based distributed energy management for the coordination of networked microgrids is proposed in this paper. Multiple microgrids and the utility grid are coordinated through iteratively adjusted price signals. Based on the price signals received, the microgrid controllers (MCs) and distribution management system (DMS) update their schedules separately. Then, the price signals are updated according to the generation–load mismatch and distributed to MCs and DMS for the next iteration. The iteration continues until the generation–load mismatch is small enough, i.e., the generation and load are balanced under agreed price signals. Through the proposed distributed energy management, various microgrids and the utility grid with different economic, resilient, emission and socio-economic objectives are coordinated with generation–load balance guaranteed and the microgrid customers’ privacy preserved. In particular, a piecewise linearization technique is employed to approximate the augmented Lagrange term in the alternating direction method of multipliers (ADMM) algorithm. Thus, the subproblems are transformed into mixed integer linear programming (MILP) problems and efficiently solved by open-source MILP solvers, which would accelerate the adoption and deployment of microgrids and promote clean energy. The proposed MILP-based distributed energy management is demonstrated through various case studies on a networked microgrids test system with three microgrids.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Varicella infection modeling.

Infectious diseases can spread rapidly through healthcare facilities, resulting in widespread illness among vulnerable patients. Computational models of disease spread are useful for evaluating mitigation strategies under different scenarios. This report describes two infectious disease models built for the US Department of Veteran Affairs (VA) motivated by a Varicella outbreak in a VA facility. The first model simulates disease spread within a notional contact network representing staff and patients. Several interventions, along with initial infection counts and intervention delay, were evaluated for effectiveness at preventing disease spread. The second model adds staff categories, location, scheduling, and variable contact rates to improve resolution. This model achieved more accurate infection counts and enabled a more rigorous evaluation of comparative effectiveness of interventions.

Jones, Katherine A.↗

Orbit Determination Processes for the Navigation of the Cassini-Huygens Mission

Deep space navigation, particularly the Orbit Determination (OD) operations of Cassini at Saturn, cannot easily be automated due to the complex dynamical environment in which the spacecraft flies; however several sub-processes are automated. The Cassini OD operations are often faced with unique challenges that require more than routine procedures. The OD Team is staffed appropriately to meet the demanding schedules and allow some level of flexibility. This paper will discuss how the OD processes are developed and the seven-member OD team is scheduled to support efficient and accurate Cassini navigation operations. Also discussed will be the requirements of the radio-metric Doppler and range tracking data acquired via the Deep Space Network and the optical navigation images of the satellites to support the daily OD operations. Furthermore, the reliability of the OD solutions, which is ensured within the framework of the OD processes, will be explained.

Antreasian, P.G.↗

On Expected Value Strong Controllability

The Probabilistic Simple Temporal Network (PSTN) generalizes Simple Temporal Networks with Uncertainty (STNUs) by introducing probability distributions over the timing of uncontrollable timepoints. PSTNs are controllable if there is a strategy to execute the controllable timepoints while bounding the risk of violating any constraint to a small value. If this risk bound can't be satisfied, PSTNs are not considered controllable. We introduce the Expected Value Probabilistic SimpleTemporal Network (EPSTN), which extends PSTNs by including a benefit to the satisfaction of temporal constraints. We study the problem of Expected Value Strong Controllability (EvSC) of EPSTNs, which seeks a schedule maximizing the expected value of satisfied constraints. We solve the EvSC problem by extending a previously developed linear program, combined with search over constraints to violate at execution time. We describe conditions under which the solution to this linear program is the maximum expected value schedule. We then show how to search for constraints to discard, using the linear program at the core of the search. While the general problem is shown to be exponential, we conclude by providing several methods to bound the complexity of search.

Planning↗

Network endpoint congestion management

A congestion management protocol that can be used for small messages in which the last-hop switch determines the congestion of the end point. The last-hop switch drops messages when the end point is congested and schedules a retransmission. A second congestion management protocol transmits small messages in a speculative mode to avoid the overhead caused by reservation handshakes.

97 MATHEMATICS AND COMPUTING↗

Prediction of Tensile Strength of Friction Stir Weld Joints with Adaptive Neuro-Fuzzy Inference System (ANFIS) and Neural Network

Friction-stir-welding (FSW) is a solid-state joining process where joint properties are dependent on welding process parameters. In the current study three critical process parameters including spindle speed (𝑁), plunge force (𝐹𝑧), and welding speed (𝑉) are considered key factors in the determination of ultimate tensile strength (UTS) of welded aluminum alloy joints. A total of 73 weld schedules were welded and tensile properties were subsequently obtained experimentally. It is observed that all three process parameters have direct influence on UTS of the welded joints. Utilizing experimental data, an optimized adaptive neuro-fuzzy inference system (ANFIS) model has been developed to predict UTS of FSW joints. A total of 1200 models were developed by varying the number of membership functions (MFs), type of MFs, and combination of four input variables (𝑁,𝑉,𝐹𝑧,𝐸𝐹𝐼) utilizing a MATLAB platform. Note EFI denotes an empirical force index derived from the three process parameters. For comparison, optimized artificial neural network (ANN) models were also developed to predict UTS from FSW process parameters. By comparing ANFIS and ANN predicted results, it was found that optimized ANFIS models provide better results than ANN. This newly developed best ANFIS model could be utilized for prediction of UTS of FSW joints.

Mohammad W Dewan↗

Advanced Intelligent System Application to Load Forecasting and Control for Hybrid Electric Bus

The primary motivation for this research emanates from providing a decision support system to the electric bus operators in the municipal and urban localities which will guide the operators to maintain an optimal compromise among the noise level, pollution level, fuel usage etc. This study is backed up by our previous studies on study of battery characteristics, permanent magnet DC motor studies and electric traction motor size studies completed in the first year. The operator of the Hybrid Electric Car must determine optimal power management schedule to meet a given load demand for different weather and road conditions. The decision support system for the bus operator comprises three sub-tasks viz. forecast of the electrical load for the route to be traversed divided into specified time periods (few minutes); deriving an optimal 'plan' or 'preschedule' based on the load forecast for the entire time-horizon (i.e., for all time periods) ahead of time; and finally employing corrective control action to monitor and modify the optimal plan in real-time. A fully connected artificial neural network (ANN) model is developed for forecasting the kW requirement for hybrid electric bus based on inputs like climatic conditions, passenger load, road inclination, etc. The ANN model is trained using back-propagation algorithm employing improved optimization techniques like projected Lagrangian technique. The pre-scheduler is based on a Goal-Programming (GP) optimization model with noise, pollution and fuel usage as the three objectives. GP has the capability of analyzing the trade-off among the conflicting objectives and arriving at the optimal activity levels, e.g., throttle settings. The corrective control action or the third sub-task is formulated as an optimal control model with inputs from the real-time data base as well as the GP model to minimize the error (or deviation) from the optimal plan. These three activities linked with the ANN forecaster proving the output to the GP model which in turn produces the pre-schedule of the optimal control model. Some preliminary results based on a hypothetical test case will be presented for the load forecasting module. The computer codes for the three modules will be made available fe adoption by bus operating agencies. Sample results will be provided using these models. The software will be a useful tool for supporting the control systems for the Electric Bus project of NASA.

Momoh, James↗

Hanford River Protection Project Life cycle Cost Modeling Tool to Enhance Mission Planning - 13396

The Life cycle Cost Model (LCM) Tool is an overall systems model that incorporates budget, and schedule impacts for the entire life cycle of the River Protection Project (RPP) mission, and is replacing the Hanford Tank Waste Operations Simulator (HTWOS) model as the foundation of the RPP system planning process. Currently, the DOE frequently requests HTWOS simulations of alternative technical and programmatic strategies for completing the RPP mission. Analysis of technical and programmatic changes can be performed with HTWOS; however, life cycle costs and schedules were previously generated by manual transfer of time-based data from HTWOS to Primavera P6. The LCM Tool automates the preparation of life cycle costs and schedules and is needed to provide timely turnaround capability for RPP mission alternative analyses. LCM is the simulation component of the LCM Tool. The simulation component is a replacement of the HTWOS model with new capability to support life cycle cost modeling. It is currently deployed in G22, but has been designed to work in any full object-oriented language with an extensive feature set focused on networking and cross-platform compatibility. The LCM retains existing HTWOS functionality needed to support system planning and alternatives studies going forward. In addition, it incorporates new functionality, coding improvements that streamline programming and model maintenance, and capability to input/export data to/from the LCM using the LCM Database (LCMDB). The LCM Cost/Schedule (LCMCS) contains cost and schedule data and logic. The LCMCS is used to generate life cycle costs and schedules for waste retrieval and processing scenarios. It uses time-based output data from the LCM to produce the logic ties in Primavera P6 necessary for shifting activities. The LCM Tool is evolving to address the needs of decision makers who want to understand the broad spectrum of risks facing complex organizations like DOE-RPP to understand how near-term programmatic decisions affect life cycle costs and commitments. (authors)

54 ENVIRONMENTAL SCIENCES↗

SATCOP mission planning software package

As the CDSLR Network grows into the 1990's, it is undergoing many changes in both its capabilities and requirements. On the one hand, great progress has been made in terms of increasing the SLR systems' performance. Upgrades to the onsite computer and improved laser ranging hardware have greatly increased the number of satellite passes which can be acquired during an operating shift by reducing the amount of time needed for operations other than actual ranging. On the other hand, more requirements have been placed on the systems. Many more satellites have become available, with more scheduled for launch, thus, increasing the likelihood of simultaneous satellite visibility. In addition, the possible scenarios required for ranging these many satellites are changing frequently, with conflicting priorities and needs. It became apparent that some tools needed to be developed to assist the planners in determining Network ranging priorities. Such tools have been developed at Bendix under the direction of NASA's Dynamics of the Solid Earth Project (DOSE) for both long range planning and routine operations to maximize the amount of data collected. This paper reviews some of these tools and describe their uses.

Bucey, Steve↗

High-Rate Delay Tolerant Networking (HDTN) User Guide Version 1.0

Delay Tolerant Networking (DTN) has been identified as a key technology to enable and facilitate the development and growth of future space networks. Classically, space communications networks are collections of disparate links that are manually managed either point-to-point or use space relays. The accelerating accessibility of space enables a new scaling of space nodes, yet both the manual management of configurations and scheduling and the lack of structure connecting links precisely prohibit scaling. This challenge gives rise to newer and larger classes of communications needs that are met by DTN, which must overcome the disconnection, disruption, latency, and mobility featured in space communications systems. DTN joins the underlying links as an overlay, and can be made to communicate over any protocol stack. The core actions of DTN are store, carry, and forward, where data are stored instead of dropped if there is no immediately available outduct. It does this by taking the DTN unit of data, bundles, and providing necessary layers to adapt these bundles to the underlying transport protocols of choice; these are called convergence layers. DTN's Bundle Protocol (BP) can then be used on top of terrestrial protocol stacks, such as TCP/IP, as well as protocols for space, such as LTP/AOS, all in the same network. For emphasis it is noted that bundles can be of essentially any size, and hence this convergence to lower layers of choice is necessary. Existing DTN implementations have operated in constrained environments with limited resources, resulting in low data speeds. However, as various technologies have advanced, data transfer rates and efficiency have advanced, which has pushed the need for a DTN implementation for ground systems and for spacecraft that is performance-oriented in order to not impose an unnecessary bottleneck. High-rate Delay Tolerant Networking (HDTN) takes advantage of modern hardware platforms to substantially reduce latency and improve throughput compared to today’s DTN operations. The HDTN implementation maintains interoperability with existing deployments of DTN that conform to IETF RFCs 4838, 5050, and 9171. At the same time, HDTN defines a new data format better suited to higher-rate operation. It defines and adopts a massively parallel pipelined and message-oriented architecture, allowing the system to scale gracefully as its resources increase. HDTN’s architecture also supports hooks to replace various processing pipeline elements with specialized hardware accelerators. This offers improved Size, Weight, and Power (SWaP) characteristics while reducing development complexity and cost.

Delay Tolerant Networking↗

High-Rate Delay Tolerant Networking (HDTN) User Guide Version 1.3.0

Delay Tolerant Networking (DTN) has been identified as a key technology to enable and facilitate the development and growth of future space networks. Classically, space communications networks are collections of disparate links that are manually managed either point-to-point or use space relays. The accelerating accessibility of space enables a new scaling of space nodes, yet both the manual management of configurations and scheduling and the lack of structure connecting links precisely prohibit scaling. This challenge gives rise to newer and larger classes of communications needs that are met by DTN, which must overcome the disconnection, disruption, latency, and mobility featured in space communications systems. DTN joins the underlying links as an overlay, and can be made to communicate over any protocol stack. The core actions of DTN are store, carry, and forward, where data are stored instead of dropped if there is no immediately available outduct. It does this by taking the DTN unit of data, bundles, and providing necessary layers to adapt these bundles to the underlying transport protocols of choice; these are called convergence layers. DTN's Bundle Protocol (BP) can then be used on top of terrestrial protocol stacks, such as TCP/IP, as well as protocols for space, such as LTP/AOS, all in the same network. For emphasis it is noted that bundles can be of essentially any size, and hence this convergence to lower layers of choice is necessary. Existing DTN implementations have operated in constrained environments with limited resources, resulting in low data speeds. However, as various technologies have advanced, data transfer rates and efficiency have advanced, which has pushed the need for a DTN implementation for ground systems and for spacecraft that is performance-oriented in order to not impose an unnecessary bottleneck. High-rate Delay Tolerant Networking (HDTN) takes advantage of modern hardware platforms to substantially reduce latency and improve throughput compared to today’s DTN operations. The HDTN implementation maintains interoperability with existing deployments of DTN that conform to IETF RFCs 4838, 5050, and 9171. At the same time, HDTN defines a new data format better suited to higher-rate operation. It defines and adopts a massively parallel pipelined and message-oriented architecture, allowing the system to scale gracefully as its resources increase. HDTN’s architecture also supports hooks to replace various processing pipeline elements with specialized hardware accelerators. This offers improved Size, Weight, and Power (SWaP) characteristics while reducing development complexity and cost.

Delay Tolerant Networking↗

How Many Trip Requests Could We Support? An Activity-Travel Based Vehicle Scheduling Approach

In a world of ever-changing travel behavior and ever-increasing modal options, is vital to have integrated models that could capture the interactions between supply and demand layers of travel. Addressing this need, we propose three different versions of network representation and mathematical models for the activity-based vehicle routing problem to connect activity-travel graphs of passengers (demand layer) to spatio-temporal networks of vehicles (supply layer). Versions I and II are arc-based, while version III is path-based. In version I, we introduce the concept of activity-travel graphs for passengers. For vehicles, we construct space–time networks and add a new dimension, called “under-service state”, to track the execution status of trip requests at any location and time. In version II, we reduce the complexity of the network structure by eliminating the state dimension and some other modifications in the structure of the passengers’ and vehicles’ network. Although both versions can capture various behavioral constraints of the activity-based vehicle routing problem (e.g., mandatory and optimal activities, duration of activities, chain of activities, preferred starting and ending times of activities), due to the high level of complexity of the network structure, both versions can only solve small-sized problems. To tackle the computational complexity, we propose a path-based network representation in version III, and to make a balance between the disutility of passengers and vehicles, we present a tolled user equilibrium problem. Mathematical models are coded in C and GAMS and implemented on real-world Phoenix regional transportation network with more than 39 million trip requests, which demonstrate the effectiveness of the proposed solution for the original and restricted master problems.

33 ADVANCED PROPULSION SYSTEMS↗

Repair and Resource Scheduling in Unbalanced Distribution Systems Using Neighborhood Search

—This paper proposes an optimization strategy to assist utility operators to recover power distribution systems after large outages. Specifically, a mixed-integer linear programming (MILP) model is developed for co-optimizing crews, resources, and network operations. The MILP model coordinates damage isolation, network reconfiguration, distributed generator re-dispatch, and crew/resource logistics. In addition, a framework for integrating different types of photovoltaic (PV) systems in the restoration process is developed. We consider two different types of crews, namely, line crews for damage repair and tree crews for obstacle removal. We also model the repair resource logistic constraints. Furthermore, a new algorithm is developed for solving the distribution system repair and restoration problem (DSRRP). The algorithm starts by solving DSRRP using an assignmentbased method, then a neighborhood search method is designed to iteratively improve the solution. The proposed method is validated on modified IEEE 123- and 8500-bus distribution test systems.

Outage management↗

Towards a Scalable and Adaptive Application Support Platform for Large-Scale Distributed E-Sciences in High-Performance Network Environments

The advent of large-scale collaborative scientific applications has demonstrated the potential for broad scientific communities to pool globally distributed resources to produce unprecedented data acquisition, movement, and analysis. System resources including supercomputers, data repositories, computing facilities, network infrastructures, storage systems, and display devices have been increasingly deployed at national laboratories and academic institutes. These resources are typically shared by large communities of users over Internet or dedicated networks and hence exhibit an inherent dynamic nature in their availability, accessibility, capacity, and stability. Scientific applications using either experimental facilities or computation-based simulations with various physical, chemical, climatic, and biological models feature diverse scientific workflows as simple as linear pipelines or as complex as a directed acyclic graphs, which must be executed and supported over wide-area networks with massively distributed resources. Application users oftentimes need to manually configure their computing tasks over networks in an ad hoc manner, hence significantly limiting the productivity of scientists and constraining the utilization of resources. The success of these large-scale distributed applications requires a highly adaptive and massively scalable workflow platform that provides automated and optimized computing and networking services. This project is to design and develop a generic Scientific Workflow Automation and Management Platform (SWAMP), which contains a web-based user interface specially tailored for a target application, a set of user libraries, and several easy-to-use computing and networking toolkits for application scientists to conveniently assemble, execute, monitor, and control complex computing workflows in heterogeneous high-performance network environments. SWAMP will enable the automation and management of the entire process of scientific workflows with the convenience of a few mouse clicks while hiding the implementation and technical details from end users. Particularly, we will consider two types of applications with distinct performance requirements: data-centric and service-centric applications. For data-centric applications, the main workflow task involves large-volume data generation, catalog, storage, and movement typically from supercomputers or experimental facilities to a team of geographically distributed users; while for service-centric applications, the main focus of workflow is on data archiving, preprocessing, filtering, synthesis, visualization, and other application-specific analysis. We will conduct a comprehensive comparison of existing workflow systems and choose the best suited one with open-source code, a flexible system structure, and a large user base as the starting point for our development. Based on the chosen system, we will develop and integrate new components including a black box design of computing modules, performance monitoring and prediction, and workflow optimization and reconfiguration, which are missing from existing workflow systems. A modular design for separating specification, execution, and monitoring aspects will be adopted to establish a common generic infrastructure suited for a wide spectrum of science applications. We will further design and develop efficient workflow mapping and scheduling algorithms to optimize the workflow performance in terms of minimum end-to-end delay, maximum frame rate, and highest reliability. We will develop and demonstrate the SWAMP system in a local environment, the grid network, and the 100Gpbs Advanced Network Initiative (ANI) testbed. The demonstration will target scientific applications in climate modeling and high energy physics and the functions to be demonstrated include workflow deployment, execution, steering, and reconfiguration. Throughout the project period, we will work closely with the science communities in the fields of climate modeling and high energy physics including Spallation Neutron Source (SNS) and Large Hadron Collider (LHC) projects to mature the system for production use.

97 MATHEMATICS AND COMPUTING↗

Stackelberg Game Based on Supervised Charging Method and Pricing Strategy of Charging Service Providers

The charging of large-scale electric vehicles (EVs) brings about a large new load to the electricity network, while it is also a demand response resource. Smart charging equipment and patterns of charging service will be one of the research focuses at the next stage. Smart charging equipment schedules EV's charging on the basis of electricity price, and this method enables users to hold the right of controlling their own EV's charging procedure. Thus, there exists a Stackelberg game between charging service providers, who set the price, and independent EVs. The marginal charging price, which reflects properties of individual EV, and the pricing strategy of charging service providers can be derived through solving this game problem. A price based charging strategy is proposed, which is suitable for the dynamic electricity price mechanism because of its light communication burden. In a simulation of a charging service provider covering 200 smart devices, this real-time supervised charging strategy shows its advantages of curbing users' payment and guiding the charging load effectively.

33 ADVANCED PROPULSION SYSTEMS↗

SELF-POWERED WIRELESS SENSOR NODE POWER MODELING BASED ON IEEE 802.11 COMMUNICATION PROTOCOL

Design and technical advancements in sensing, processing, and wireless communication capabilities of small, portable devices known as wireless sensor nodes (WSNs) have drawn extensive research attention and are vastly applied in science and engineering applications. The WSNs are typically powered by a chemical battery source that has a load dependent finite lifetime. Most applications, including the nuclear industry applications, require WSNs to operate for an extended period of time beginning with their deployment. To ensure longevity, it is important to develop self-powered WSNs. The benefit of self-powered WSNs goes far beyond the cost savings of removing the need for cable installation and maintenance. Self-powered WSNs will potentially offer significant expansion in remote monitoring of nuclear facilities, and provide important data on plant equipment and component status during normal operation, as well as in case of abnormal operation, station blackouts or post-accident evaluation. Advancements in power harvesting technologies enable electric energy generation from many sources, including kinetic, thermal, and radiated energy. For the ongoing research at Idaho National Laboratory, a solid-state thermoelectric-based technology, the thermoelectric generator (TEG), is used to convert thermal energy to power a WSN. The design and development of TEGs to power WSNs that would remain active for a long period of time requires comprehensive understanding of WSN operational. This motivates the research in modeling the lifetime, i.e., power consumption, of a WSN by taking into consideration various node and network level activities. A WSN must perform three essential tasks: sense events, perform quick local information processing of sensed events, and wirelessly exchange locally processed data with the base station or with other WSNs in the network. Each task has a power cost per unit tine and an additional cost when switching between tasks. There are number of other considerations that must also be taken into account when computing the power consumption associated with each task. The considerations includes: number of events occurring in a fixed active time period and the duration of each event, event-information processing time, total communication time, number of retransmission, etc. Additionally, at the network level the communication of information data packets between WSNs involves collisions, latency, andretransmission, which result in unanticipated power losses. This paper presents stochastic modeling of power demand for a schedule-driven WSN utilizing Institute of Electrical and Electronics Engineers, IEEE, 802.11 communication protocols. The model captures the generic operation of a schedule-driven WSN when an external event occurs, i.e., sensing, following by processing, and followed by communication. The results are verified via simulation.

IEEE 802.11 Protocol↗

A Transport-Friendly NIC for Multicore-Multiprocessor Systems

Receive side scaling (RSS) is a network interface card (NIC) technology. It provides the benefits of parallel receive processing in multiprocessing environments. However, existing RSS-enabled NICs lack a critical data steering mechanism that would automatically steer incoming network data to the same core on which its application process resides. This absence causes inefficient cache usage if an application is not running on the core on which RSS has scheduled the received traffic to be processed. In Linux systems, it cannot even ensure that packets in a TCP flow are processed by a single core, even if the interrupts for the flow are pinned to a specific core. This results in degraded performance. In this paper, we develop such a data steering mechanism in the NIC for multicore or multiprocessor systems. This data steering mechanism is mainly targeted at TCP, but it can be extended to other transport layer protocols. We term a NIC with such a data steering mechanism 'A Transport Friendly NIC' (A-TFN). Experimental results have proven the effectiveness of A-TFN in accelerating TCP/IP performance.

Wu, Wenji↗