Filed under Networks, Research by Oscar Boykin | 0 comments
My co-authors and I have posted a new pre-print to the Arxiv:
Disaster Management in Scale-Free Networks: Recovery from and Protection Against Intentional Attacks.
This paper studies the effect of continuous attacks on scale-free networks (such as P2P networks), and how to recover from an attack. Since P2P systems are often billed as robust, it is important to consider not only random failures, but also attacks. We see that if the network is reactive, we can recover almost instantly from attacks.
Filed under Computing, Research by Oscar Boykin | 0 comments
I recently put a new preprint on the Arxiv: Reversible Fault-Tolerant Logic. This is a joint work with Vwani Roychowdhury which considers fault tolerance techniques for reversible computing. We show that as long as the reversible gates have errors less than a threshold value, those errors may be held in check by using O(N \log^{4.75} N) noisy gates to simulate N noise-less gates.
This work also considers the case of locally connected architectures in 1-D and 2-D. There we show that the threshold decreases somewhat. Finally, we consider the entropy that must be removed from the system and see that the entropy saving aspect of reversible computing is lost unless the gate error rate is much lower than the threshold error rate.
I will present this work this summer at the International Conference on Dependable Systems and Networks.