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 235 records · Page 13

A mission planning concept and mission planning system for future manned space missions

The international character of future manned space missions will compel the involvement of several international space agencies in mission planning tasks. Additionally, the community of users requires a higher degree of freedom for experiment planning. Both of these problems can be solved by a decentralized mission planning concept using the so-called 'envelope method,' by which resources are allocated to users by distributing resource profiles ('envelopes') which define resource availabilities at specified times. The users are essentially free to plan their activities independently of each other, provided that they stay within their envelopes. The new developments were aimed at refining the existing vague envelope concept into a practical method for decentralized planning. Selected critical functions were exercised by planning an example, founded on experience acquired by the MSCC during the Spacelab missions D-1 and D-2. The main activity regarding future mission planning tasks was to improve the existing MSCC mission planning system, using new techniques. An electronic interface was developed to collect all formalized user inputs more effectively, along with an 'envelope generator' for generation and manipulation of the resource envelopes. The existing scheduler and its data base were successfully replaced by an artificial intelligence scheduler. This scheduler is not only capable of handling resource envelopes, but also uses a new technology based on neuronal networks. Therefore, it is very well suited to solve the future scheduling problems more efficiently. This prototype mission planning system was used to gain new practical experience with decentralized mission planning, using the envelope method. In future steps, software tools will be optimized, and all data management planning activities will be embedded into the scheduler.

Wickler, Martin↗

Intelligent Resource Management for Local Area Networks: Approach and Evolution

The Data Management System network is a complex and important part of manned space platforms. Its efficient operation is vital to crew, subsystems and experiments. AI is being considered to aid in the initial design of the network and to augment the management of its operation. The Intelligent Resource Management for Local Area Networks (IRMA-LAN) project is concerned with the application of AI techniques to network configuration and management. A network simulation was constructed employing real time process scheduling for realistic loads, and utilizing the IEEE 802.4 token passing scheme. This simulation is an integral part of the construction of the IRMA-LAN system. From it, a causal model is being constructed for use in prediction and deep reasoning about the system configuration. An AI network design advisor is being added to help in the design of an efficient network. The AI portion of the system is planned to evolve into a dynamic network management aid. The approach, the integrated simulation, project evolution, and some initial results are described.

Meike, Roger↗

IUS/TUG orbital operations and mission support study. Volume 4: Project planning data

Planning data are presented for the development phases of interim upper stage (IUS) and tug systems. Major project planning requirements, major event schedules, milestones, system development and operations process networks, and relevant support research and technology requirements are included. Topics discussed include: IUS flight software; tug flight software; IUS/tug ground control center facilities, personnel, data systems, software, and equipment; IUS mission events; tug mission events; tug/spacecraft rendezvous and docking; tug/orbiter operations interface, and IUS/orbiter operations interface.

Source record↗

Project Planning and Reporting

Project Planning Analysis and Reporting System (PPARS) is automated aid in monitoring and scheduling of activities within project. PPARS system consists of PPARS Batch Program, five preprocessor programs, and two post-processor programs. PPARS Batch program is full CPM (Critical Path Method) scheduling program with resource capabilities. Can process networks with up to 10,000 activities.

Source record↗

ISEE-3/ICE navigation analysis

Efforts to assure communications continuity and navigational accuracy for the ISEE-3 (now called the International Cometary Explorer - ICE) spacecraft as it heads toward a passage through the Giacobini-Zimmer (G-Z) comet tail are reviewed. Sufficient energy was gained with a series of lunar swingbys to take the rendezvous attempt possible. Communications will be by an S-band link though the upgraded Deep Space Network. The G-Z encounter is scheduled for September 1983. A 512 bps data rate will be supported by 64-3 m dishes at various global sites. The tracking will continue for 6 mos as the spacecraft moves into an orbit that parallels that of Halley's Comet. Ground-based recovery of the G-Z location in the spring of 1984 provided data for calculating the ephemerides required for configuring a major course correction for ICE 100 days before rendezvous.

Efron, L.↗

NASA Goddard Space Flight Center

The NASA SLR Operational Center is responsible for: 1) NASA SLR network control, sustaining engineering, and logistics; 2) ILRS mission operations; and 3) ILRS and NASA SLR data operations. NASA SLR network control and sustaining engineering tasks include technical support, daily system performance monitoring, system scheduling, operator training, station status reporting, system relocation, logistics and support of the ILRS Networks and Engineering Working Group. These activities ensure the NASA SLR systems are meeting ILRS and NASA mission support requirements. ILRS mission operations tasks include mission planning, mission analysis, mission coordination, development of mission support plans, and support of the ILRS Missions Working Group. These activities ensure than new mission and campaign requirements are coordinated with the ILRS. Global Normal Points (NP) data, NASA SLR FullRate (FR) data, and satellite predictions are managed as part of data operations. Part of this operation includes supporting the ILRS Data Formats and Procedures Working Group. Global NP data operations consist of receipt, format and data integrity verification, archiving and merging. This activity culminates in the daily electronic transmission of NP files to the CDDIS. Currently of all these functions are automated. However, to ensure the timely and accurate flow of data, regular monitoring and maintenance of the operational software systems, computer systems and computer networking are performed. Tracking statistics between the stations and the data centers are compared periodically to eliminate lost data. Future activities in this area include sub-daily (i.e., hourly) NP data management, more stringent data integrity tests, and automatic station notification of format and data integrity issues.

Carter, David↗

Evaluation of IEEE 802.11g and 802.16 for Lunar Surface Exploration Missions Using MACHETE Simulations

In this paper, we investigated the suitability of terrestrial wireless networking technologies for lunar surface exploration missions. Specifically, the scenario we considered consisted of two teams of collaborating astronauts, one base station and one rover, where the base station and the rover have the capability of acting as relays. We focused on the evaluation of IEEE 802.11g and IEEE 802.16 protocols, simulating homogeneous 802.11g network, homogeneous 802.16 network, and heterogeneous network using both 802.11g and 802.16. A mix of traffic flows were simulated, including telemetry, caution and warning, voice, command and file transfer. Each traffic type had its own distribution profile, data volume, and priority. We analyzed the loss and delay trade-offs of these wireless protocols with various link-layer options. We observed that 802.16 network managed the channel better than an 802.11g network due to controlled infrastructure and centralized scheduling. However, due to the centralized scheduling, 802.16 also had a longer delay. The heterogeneous (hybrid) of 802.11/802.16 achieved a better balance of performance in terms of data loss and delay compared to using 802.11 or 802.16 alone.

Segui, John↗

High Data Rate Architecture (HiDRA)

One of the greatest challenges in developing new space technology is in navigating the transition from ground based laboratory demonstration at Technology Readiness Level 6 (TRL-6) to conducting a prototype demonstration in space (TRL-7). This challenge is com- pounded by the relatively low availability of new spacecraft missions when compared with aeronautical craft to bridge this gap, leading to the general adoption of a low-risk stance by mission management to accept new, unproven technologies into the system. Also in consideration of risk, the limited selection and availability of proven space-grade components imparts a severe limitation on achieving high performance systems by current terrestrial technology standards. Finally from a space communications point of view the long duration characteristic of most missions imparts a major constraint on the entire space and ground network architecture, since any new technologies introduced into the system would have to be compliant with the duration of the currently deployed operational technologies, and in some cases may be limited by surrounding legacy capabilities. Beyond ensuring that the new technology is verified to function correctly and validated to meet the needs of the end users the formidable challenge then grows to additionally include: carefully timing the maturity path of the new technology to coincide with a feasible and accepting future mission so it flies before its relevancy has passed, utilizing a limited catalog of available components to their maximum potential to create meaningful and unprecedented new capabilities, designing and ensuring interoperability with aging space and ground infrastructures while simultaneously providing a growth path to the future. The International Space Station (ISS) is approaching 20 years of age. To keep the ISS relevant, technology upgrades are continuously taking place. Regarding communications, the state-of-the-art communication system upgrades underway include high-rate laser terminals. These must interface with the existing, aging data infrastructure. The High Data Rate Architecture (HiDRA) project is designed to provide networked store, carry, and forward capability to optimize data flow through both the existing radio frequency (RF) and new laser communications terminal. The networking capability is realized through the Delay Tolerant Networking (DTN) protocol, and is used for scheduling data movement as well as optimizing the performance of existing RF channels. HiDRA is realized as a distributed FPGA memory and interface controller that is itself controlled by a local computer running DTN software. Thus HiDRA is applicable to other arenas seeking to employ next-generation communications technologies, e.g. deep space. In this paper, we describe HiDRA and its far-reaching research implications.

DTN↗

An Augmented Ground Station Architecture for Spacecraft-Initiated Communication Service Requests

Spacecraft performing science and exploration missions have increasingly complex and event-driven objectives, making communication needs difficult to predict in advance. Additional flexibility is required in space communication provider networks to effectively meet time-varying demand. We envision a framework for automated resource allocation in which requests for communications service are initiated by spacecraft based on current mission needs. We propose an augmented ground station configuration featuring a wide field-of-view antenna to receive transmissions from spacecraft requesting high-rate communications. A software suite to automate the service fulfillment process, including interfacing with external scheduling systems such as NASA’s Near Space Network, is described. Experimental results characterizing the physical-layer link between the wide field-of-view antenna and a software-defined radio testbed on the International Space Station are presented. We also discuss long-duration software testing on a ground-based testbed. Taken together, these proof-of-concept results demonstrate the feasibility of the concept to improve the responsiveness of space communications.

user-initiated service↗

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

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

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↗

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↗

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

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↗

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↗

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

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↗