Reasoning about the Reliability of Diverse Two-Channel Systems in which One Channel is "Possibly Perfect"

This paper considers the problem of reasoning about the reliability of fault-tolerant systems with two "channels" (i.e., components) of which one, A, supports only a claim of reliability, while the other, B, by virtue of extreme simplicity and extensive analysis, supports a plausible claim of "perfection." We begin with the case where either channel can bring the system to a safe state. We show that, conditional upon knowing pA (the probability that A fails on a randomly selected demand) and pB (the probability that channel B is imperfect), a conservative bound on the probability that the system fails on a randomly selected demand is simply pA.pB. That is, there is conditional independence between the events "A fails" and "B is imperfect." The second step of the reasoning involves epistemic uncertainty about (pA, pB) and we show that under quite plausible assumptions, a conservative bound on system pfd can be constructed from point estimates for just three parameters. We discuss the feasibility of establishing credible estimates for these parameters. We extend our analysis from faults of omission to those of commission, and then combine these to yield an analysis for monitored architectures of a kind proposed for aircraft

Channel-Aware Random Access in the Presence of Channel Estimation Errors

In this work, we consider the random access of nodes adapting their transmission probability based on the local channel state information (CSI) in a decentralized manner, which is called CARA. The CSI is not directly available to each node but estimated with some errors in our scenario. Thus, the impact of imperfect CSI on the performance of CARA is our main concern. Specifically, an exact stability analysis is carried out when a pair of bursty sources are competing for a common receiver and, thereby, have interdependent services. The analysis also takes into account the compound effects of the multipacket reception (MPR) capability at the receiver. The contributions in this paper are twofold: first, we obtain the exact stability region of CARA in the presence of channel estimation errors; such an assessment is necessary as the errors in channel estimation are inevitable in the practical situation. Secondly, we compare the performance of CARA to that achieved by the class of stationary scheduling policies that make decisions in a centralized manner based on the CSI feedback. It is shown that the stability region of CARA is not necessarily a subset of that of centralized schedulers as the MPR capability improves.Comment: The material in this paper was presented in part at the IEEE International Symposium on Information Theory, Cambridge, MA, USA, July 201

Measurement-device-independent quantum communication with an untrusted source

Measurement-device-independent quantum key distribution (MDI-QKD) can provide enhanced security, as compared to traditional QKD, and it constitutes an important framework for a quantum network with an untrusted network server. Still, a key assumption in MDI-QKD is that the sources are trusted. We propose here a MDI quantum network with a single untrusted source. We have derived a complete proof of the unconditional security of MDI-QKD with an untrusted source. Using simulations, we have considered various real-life imperfections in its implementation, and the simulation results show that MDI-QKD with an untrusted source provides a key generation rate that is close to the rate of initial MDI-QKD in the asymptotic setting. Our work proves the feasibility of the realization of a quantum network. The network users need only low-cost modulation devices, and they can share both an expensive detector and a complicated laser provided by an untrusted network server.Comment: 13 pages, 4 figures. arXiv admin note: the security proof technique is based on arXiv:0802.2725, arXiv:0905.4225

On the Statistical Modeling and Analysis of Repairable Systems

We review basic modeling approaches for failure and maintenance data from repairable systems. In particular we consider imperfect repair models, defined in terms of virtual age processes, and the trend-renewal process which extends the nonhomogeneous Poisson process and the renewal process. In the case where several systems of the same kind are observed, we show how observed covariates and unobserved heterogeneity can be included in the models. We also consider various approaches to trend testing. Modern reliability data bases usually contain information on the type of failure, the type of maintenance and so forth in addition to the failure times themselves. Basing our work on recent literature we present a framework where the observed events are modeled as marked point processes, with marks labeling the types of events. Throughout the paper the emphasis is more on modeling than on statistical inference.Comment: Published at http://dx.doi.org/10.1214/088342306000000448 in the Statistical Science (http://www.imstat.org/sts/) by the Institute of Mathematical Statistics (http://www.imstat.org