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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Automated platform management system scheduling

The Platform Management System (PMS) has been established to coordinate the operation of platform systems and payloads. Since platforms are to be out of contact with the ground more than the manned base, PMS functions are required to be more autonomous than those of the manned base. Automated replanning and rescheduling will be required to effectively and efficiently meet mission goals. In a FY88 study, we developed a phased approach to automated PMS scheduling based upon use of the same scheduling engine in both ground and space components. In the past year, we implemented a baseline, first phase, PMS scheduler prototype. Presently we are integrating this scheduler into two NASA Goddard Space Flight Center testbeds, as the ground scheduler in the Scheduling Concepts, Architectures, and Networks Testbed and as the onboard scheduler in the PMS Testbed. We will investigate rescheduling issues, evaluated operational performance and enhance the prototype to demonstrate our evolutionary approach to automated PMS scheduling.

Hull, Larry G.↗
NASA NTRS2018

Simulation Evaluations of an Autonomous Urban Air Mobility Network Management and Separation Service

This paper presents an initial implementation of an autonomous Urban Air Mobility network management and aircraft separation service for urban airspace that does 1) departure and arrival scheduling across the network, 2) continuous trajectory management to ensure safe separation between aircraft, and 3) seamless integration with traditional operations. The highly-autonomous AutoResolver algorithm developed for traditional aviation was extended to provide these capabilities. An evaluation of this initial implementation was conducted in fast-time simulations using a dense, two-hour traffic scenario with Urban Air Mobility aircraft flying between a network of 20 vertiports in the Dallas-Fort Worth metroplex. When the spatial separation was reduced from 0:3nmi to 0:1nmi, the total de- lay decreased by 7:3%; when the temporal separation was reduced from 60s to 45s, the total delay decreased by 28:4%. The total number of conflict resolutions decreased by 26% and 17%, respectively. Furthermore, when a scheduling horizon greater than the duration of UAM flights was used (50min), most conflicts were resolved pre-departure producing ground delay. By comparison, when a shorter scheduling horizon was used (8min), most conflicts were resolved post-departure generating airborne delay. For all scheduling and separation constraints tested, AutoResolver prevented loss of separation from occurring. Urban Air Mobility operations have the ability to revolutionize how people and goods are transported and this paper presents initial research focusing on the high levels of autonomy required for an airspace system capable of scaling to handle significantly higher densities of aircraft.

Bosson, Christabelle S.↗
NASA NTRS1989

Mission scheduling

How a neural network can work, compared to a hybrid system based on an operations research and artificial intelligence approach, is investigated through a mission scheduling problem. The characteristic features of each system are discussed.

Gaspin, Christine↗
NASA NTRS2018

Simulation Evaluations of an Autonomous Urban Air Mobility Network Management and Separation Service

This presents an initial implementation of an autonomous Urban Air Mobility network management and aircraft separation service for urban airspace that does 1) departure and arrival scheduling across the network, 2) continuous trajectory management to ensure safe separation between aircraft, and 3) seamless integration with traditional operations. The highly-autonomous AutoResolver algorithm developed for traditional aviation was extended to provide these capabilities. An evaluation of this initial implementation was conducted in fast-time simulations using a dense, two-hour traffic scenario with Urban Air Mobility aircraft flying between a network of 20 vertiports in the Dallas-Fort Worth metroplex. When the spatial separation was reduced from 0:3 nmi (nautical miles) to 0:1nmi, the total delay decreased by 7:3 percent...

Bosson, Christabelle S.↗
NASA NTRS2007

Collaborative Resource Allocation

Collaborative Resource Allocation Networking Environment (CRANE) Version 0.5 is a prototype created to prove the newest concept of using a distributed environment to schedule Deep Space Network (DSN) antenna times in a collaborative fashion. This program is for all space-flight and terrestrial science project users and DSN schedulers to perform scheduling activities and conflict resolution, both synchronously and asynchronously. Project schedulers can, for the first time, participate directly in scheduling their tracking times into the official DSN schedule, and negotiate directly with other projects in an integrated scheduling system. A master schedule covers long-range, mid-range, near-real-time, and real-time scheduling time frames all in one, rather than the current method of separate functions that are supported by different processes and tools. CRANE also provides private workspaces (both dynamic and static), data sharing, scenario management, user control, rapid messaging (based on Java Message Service), data/time synchronization, workflow management, notification (including emails), conflict checking, and a linkage to a schedule generation engine. The data structure with corresponding database design combines object trees with multiple associated mortal instances and relational database to provide unprecedented traceability and simplify the existing DSN XML schedule representation. These technologies are used to provide traceability, schedule negotiation, conflict resolution, and load forecasting from real-time operations to long-range loading analysis up to 20 years in the future. CRANE includes a database, a stored procedure layer, an agent-based middle tier, a Web service wrapper, a Windows Integrated Analysis Environment (IAE), a Java application, and a Web page interface.

Wang, Yeou-Fang↗
NASA NTRS1991

Distributed scheduling with COMPASS

COMPASS (COMPuter Aided Scheduling System) is a sophisticated, interactive scheduling tool used within NASA. Like most existing tools, however, COMPASS is a single-user application. There is a large class of scheduling problems which may be better solved by allowing several people at various locations to build separate schedules with shared resources. DISCORS (DIStributed COmputer Resource Scheduling) is a set of services which support a distributed version of COMPASS. This architecture naturally accommodates the integration of user-defined resource models without modifying COMPASS. DISCORS services include the ability to establish and manage communications, to code messages in efficient formats, to provide fault detection and recovery, and to configure schedulers across a network. In its present form, DISCORS effectively supports distributed COMPASS, but fails to run fast and to guarantee efficient schedules. Further enhancements may allow several users to simultaneously and interactively work together to create complex schedules while COMPASS detects and coordinates the resolution of conflicting requests.

Rufat-Latre, Jorge↗
NASA NTRSDate not supplied

Scheduling Position, Navigation and Time Service Requests from Non-dedicated Lunar Constellations

This paper presents a centralized scheduler that satisfies user requests for Position, Navigation, and Time (PNT) services from an ad-hoc, non-dedicated orbital constellation around the Moon. Traditional, dedicated GNSS networks provide service 24/7, which allows users to acquire localization services at-will. For ad-hoc networks, a coordinated schedule is needed to ensure Quality of Service (QoS) guarantees for user localization, while satisfying non-dedicated assets’ usage constraints. This scheduler bridges this coordination gap by leveraging Mixed Integer-Linear Programming (MILP) to schedule this “as-needed” localization service while respecting the constraints on each asset. In upcoming decades there is expected to be a substantial increase in Lunar missions. Many of these missions will feature low-cost surface assets near the moon’s polar regions and small-sat science missions in orbit. Most missions need PNT capabilities to ensure safe operations and meet their science objectives, but low-cost missions may not be able to support the large power, mass, and weight that a weak GNSS or DSN based navigation solution would entail. Asset localization has been demonstrated using a decentralized extended Kalman Filter (DEKF) in the previously presented Lunar Autonomous PNT System (LAPS). Within the LAPS simulation environment, a module has been developed to generate the coordinated user-asset schedules described above; this Service Scheduler Module (SSM) allows for complete end-to-end testing of the entire system. Within SSM, a user service request consists of a location on the Lunar surface, a cumulative service duration, and a window in which service must occur. SSM takes as input these requests and the LAPS-predicted positional degree of precision as the QoS for each available set of orbital assets. A simple, baseline MILP model is formulated to provide the highest-precision service balanced across all requests. To reflect the non-dedicated nature of the constellation, this baseline model is augmented with additional asset-specific load capacity constraints or availability constraints. The load capacity constraints limit total time spent providing service, and the availability constraints reflect blockout times or availability windows when the assets are not otherwise occupied. SSM outputs two schedules: the user schedule to indicate their service times and expected QoS, and a satellite schedule to be transmitted to the orbiting constellation, describing when each non-dedicated asset provides PNT service. SSM is predominantly implemented in MATLAB and allows the use of any MILP solver to generate the resulting schedules. This paper describes the SSM - LAPS interface, how the output of LAPS is used to construct the MILP, and how SSM provides user localization service while satisfying constraints. It will also demonstrate the tool’s flexibility for formulating schedules for the end user and the constellation, focusing on scenarios that match real-world proposed missions. It will detail how SSM can be used to compare the addition of load capacity constraints, satellite availability constraints, and QoS guarantees for the users. Finally, we describe how SSM can be used to support the design of the ad-hoc constellation itself. The resulting integrated capability will support the design of future ad-hoc Lunar PNT networks, enabling high-quality, low-cost Lunar exploration

Swarm↗
NASA NTRS1990

Automated Platform Management System Scheduling

The Platform Management System was established to coordinate the operation of platform systems and instruments. The management functions are split between ground and space components. Since platforms are to be out of contact with the ground more than the manned base, the on-board functions are required to be more autonomous than those of the manned base. Under this concept, automated replanning and rescheduling, including on-board real-time schedule maintenance and schedule repair, are required to effectively and efficiently meet Space Station Freedom mission goals. In a FY88 study, we developed several promising alternatives for automated platform planning and scheduling. We recommended both a specific alternative and a phased approach to automated platform resource scheduling. Our recommended alternative was based upon use of exactly the same scheduling engine in both ground and space components of the platform management system. Our phased approach recommendation was based upon evolutionary development of the platform. In the past year, we developed platform scheduler requirements and implemented a rapid prototype of a baseline platform scheduler. Presently we are rehosting this platform scheduler rapid prototype and integrating the scheduler prototype into two Goddard Space Flight Center testbeds, as the ground scheduler in the Scheduling Concepts, Architectures, and Networks Testbed and as the on-board scheduler in the Platform Management System Testbed. Using these testbeds, we will investigate rescheduling issues, evaluate operational performance and enhance the platform scheduler prototype to demonstrate our evolutionary approach to automated platform scheduling. The work described in this paper was performed prior to Space Station Freedom rephasing, transfer of platform responsibility to Code E, and other recently discussed changes. We neither speculate on these changes nor attempt to predict the impact of the final decisions. As a consequence some of our work and results may be outdated when this paper is published.

Hull, Larry G.↗
NASA NTRS1993

Performance analysis of a large-grain dataflow scheduling paradigm

A paradigm for scheduling computations on a network of multiprocessors using large-grain data flow scheduling at run time is described and analyzed. The computations to be scheduled must follow a static flow graph, while the schedule itself will be dynamic (i.e., determined at run time). Many applications characterized by static flow exist, and they include real-time control and digital signal processing. With the advent of computer-aided software engineering (CASE) tools for capturing software designs in dataflow-like structures, macro-dataflow scheduling becomes increasingly attractive, if not necessary. For parallel implementations, using the macro-dataflow method allows the scheduling to be insulated from the application designer and enables the maximum utilization of available resources. Further, by allowing multitasking, processor utilizations can approach 100 percent while they maintain maximum speedup. Extensive simulation studies are performed on 4-, 8-, and 16-processor architectures that reflect the effects of communication delays, scheduling delays, algorithm class, and multitasking on performance and speedup gains.

Young, Steven D.↗
DOE OSTI2021

Illinois Express Quantum Network (IEQNET): metropolitan-scale experimental quantum networking over deployed optical fiber

The Illinois Express Quantum Network (IEQNET) is a program to realize metro-scale quantum networking over deployed optical fiber using currently available technology. IEQNET consists of multiple sites that are geographically dispersed in the Chicago metropolitan area. Each site has one or more quantum nodes (Qnodes) representing the communication parties in a quantum network. Q-nodes generate or measure quantum signals such as entangled photons and communicate the results via standard, classical, means. The entangled photons in IEQNET nodes are generated at multiple wavelengths, and are selectively distributed to the desired users via optical switches. Here we describe the network architecture of IEQNET, including the Internet-inspired layered hierarchy that leverages software-defined-networking (SDN) technology to perform traditional wavelength routing and assignment between the Q-nodes. Specifically, SDN decouples the control and data planes, with the control plane being entirely classical. Issues associated with synchronization, calibration, network monitoring, and scheduling will be discussed. An important goal of IEQNET is demonstrating the extent to which the control plane can coexist with the data plane using the same fiber lines. This goal is furthered by the use of tunable narrow-band optical filtering at the receivers and, at least in some cases, a wide wavelength separation between the quantum and classical channels. We envision IEQNET to aid in developing robust and practical quantum networks by demonstrating metro-scale quantum communication tasks such as entanglement distribution and quantum-state teleportation.

Chung, Joaquin↗