Deep Space Network information system architecture study

The purpose of this article is to describe an architecture for the Deep Space Network (DSN) information system in the years 2000-2010 and to provide guidelines for its evolution during the 1990s. The study scope is defined to be from the front-end areas at the antennas to the end users (spacecraft teams, principal investigators, archival storage systems, and non-NASA partners). The architectural vision provides guidance for major DSN implementation efforts during the next decade. A strong motivation for the study is an expected dramatic improvement in information-systems technologies, such as the following: computer processing, automation technology (including knowledge-based systems), networking and data transport, software and hardware engineering, and human-interface technology. The proposed Ground Information System has the following major features: unified architecture from the front-end area to the end user; open-systems standards to achieve interoperability; DSN production of level 0 data; delivery of level 0 data from the Deep Space Communications Complex, if desired; dedicated telemetry processors for each receiver; security against unauthorized access and errors; and highly automated monitor and control

Cognitive Communications in White Space: Opportunistic Scheduling, Spectrum Shaping and Delay Analysis

abstract: A unique feature, yet a challenge, in cognitive radio (CR) networks is the user hierarchy: secondary users (SU) wishing for data transmission must defer in the presence of active primary users (PUs), whose priority to channel access is strictly higher.Under a common thread of characterizing and improving Quality of Service (QoS) for the SUs, this dissertation is progressively organized under two main thrusts: the first thrust focuses on SU's throughput by exploiting the underlying properties of the PU spectrum to perform effective scheduling algorithms; and the second thrust aims at another important QoS performance of the SUs, namely delay, subject to the impact of PUs' activities, and proposes enhancement and control mechanisms. More specifically, in the first thrust, opportunistic spectrum scheduling for SU is first considered by jointly exploiting the memory in PU's occupancy and channel fading. In particular, the underexplored scenario where PU occupancy presents a {long} temporal memory is taken into consideration. By casting the problem as a partially observable Markov decision process, a set of {multi-tier} tradeoffs are quantified and illustrated. Next, a spectrum shaping framework is proposed by leveraging network coding as a {spectrum shaper} on the PU's traffic. Such shaping effect brings in predictability of the primary spectrum, which is utilized by the SUs to carry out adaptive channel sensing by prioritizing channel access order, and hence significantly improve their throughput. On the other hand, such predictability can make wireless channels more susceptible to jamming attacks. As a result, caution must be taken in designing wireless systems to balance the throughput and the jamming-resistant capability. The second thrust turns attention to an equally important performance metric, i.e., delay performance. Specifically, queueing delay analysis is conducted for SUs employing random access over the PU channels. Fluid approximation is taken and Poisson driven stochastic differential equations are applied to characterize the moments of the SUs' steady-state queueing delay. Then, dynamic packet generation control mechanisms are developed to meet the given delay requirements for SUs.Dissertation/ThesisPh.D. Electrical Engineering 201

Fault-Tolerant Load Management for Real-Time Distributed Computer Systems

This paper presents a fault-tolerant scheme applicable to any decentralized load balancing algorithms used in soft real-time distributed systems. Using the theory of distance-transitive graphs for representing topologies of these systems, the proposed strategy partitions these systems into independent symmetric regions (spheres) centered at some control points. These central points, called fault-control points, provide a two-level task redundancy and efficiently re-distribute the load of failed nodes within their spheres. Using the algebraic characteristics of these topologies, it is shown that the identification of spheres and fault-control points is, in general, is an NP-complete problem. An efficient solution for this problem is presented by making an exclusive use of a combinatorial structure known as the Hadamard matrix. Assuming a realistic failure-repair system environment, the performance of the proposed strategy has been evaluated and compared with no fault environment, through an extensive and detailed simulation. For our fault-tolerant strategy, we propose two measures of goodness, namely, the percentage of re-scheduled tasks which meet their deadlines and the overhead incurred for fault management. It is shown that using the proposed strategy, up to 80% of the tasks can still meet their deadlines. The proposed strategy is general enough to be applicable to many networks, belonging to a number of families of distance transitive graphs. Through simulation, we have analyzed the sensitivity of this strategy to various system parameters and have shown that the performance degradation due to failures does not depend on these parameter. Also, the probability of a task being lost altogether due to multiple failures has been shown to be extremely low

Multiwavelength Observations of the Hot DB Star PG 0112+104

We present a comprehensive multiwavelength analysis of the hot DB white dwarf PG 0112+104. Our analysis relies on newly-acquired FUSE observations, on medium-resolution FOS and GHRS data, on archival high-resolution GHRS observations, on optical spectrophotometry both in the blue and around Halpha, as well as on time-resolved photometry. From the optical data, we derive a self-consistent effective temperature of 31,300+-500 K, a surface gravity of log g = 7.8 +- 0.1 (M=0.52 Msun), and a hydrogen abundance of log N(H)/N(He) < -4.0. The FUSE spectra reveal the presence of CII and CIII lines that complement the previous detection of CII transitions with the GHRS. The improved carbon abundance in this hot object is log N(C)/N(He) = -6.15 +- 0.23. No photospheric features associated with other heavy elements are detected. We reconsider the role of PG 0112+104 in the definition of the blue edge of the V777 Her instability strip in light of our high-speed photometry, and contrast our results with those of previous observations carried out at the McDonald Observatory.Comment: 10 pages in emulateapj, 9 figures, accepted for publication in Ap

Static and dynamic fault tree analysis with application to hybrid vehicle systems and supply chains

One of the most challenging parts of reliability analysis is building a reliability model of the system. Reliability block diagram, Markov models, and fault tree analysis are some of the most common techniques for constructing a reliability model. Fault tree analysis provides a way to combine components, which together can cause system failure. This research uses both static and dynamic fault trees to quantify the reliability of a hybrid vehicle system and to analyze supply chain risk. The hybrid vehicle combines a mechanical power source, such as the internal combustion engine (gasoline engine or diesel engine), and an electric power source (electric motor) to take advantage of two power sources and compensate from each source. The hybrid system’s complexity and non-mature technology carry potential risks for the vehicle. This research uses a static fault tree to analyze the reliability of the 2004 Toyota Prius under different operational modes. We apply Bayesian analysis that combines survey data to estimate the reliability of the hybrid vehicle’s battery. Supply chain risk analysis is increasingly becoming an important field and supply chain risk models help identify significant risks that can occur and the consequences if those risks occur. We use dynamic fault trees, which are relatively new in reliability analysis, to understand the timing of potential failures in different types of supply chains. We estimate failure rates for each supply chain under different production scenarios and simulate delivery time for the supply chain