Self-stabilizing tree algorithms

Designers of distributed algorithms have to contend with the problem of making the algorithms tolerant to several forms of coordination loss, primarily faulty initialization. The processes in a distributed system do not share a global memory and can only get a partial view of the global state. Transient failures in one part of the system may go unnoticed in other parts and thus cause the system to go into an illegal state. If the system were self-stabilizing, however, it is guaranteed that it will return to a legal state after a finite number of state transitions. This thesis presents and proves self-stabilizing algorithms for calculating tree metrics and for achieving mutual exclusion on a tree structured distributed system

Distributed match-making

In many distributed computing environments, processes are concurrently executed by nodes in a store- and-forward communication network. Distributed control issues as diverse as name server, mutual exclusion, and replicated data management involve making matches between such processes. We propose a formal problem called distributed match-making as the generic paradigm. Algorithms for distributed match-making are developed and the complexity is investigated in terms of messages and in terms of storage needed. Lower bounds on the complexity of distributed match-making are established. Optimal algorithms, or nearly optimal algorithms, are given for particular network topologies

Algorithm Diversity for Resilient Systems

Diversity can significantly increase the resilience of systems, by reducing the prevalence of shared vulnerabilities and making vulnerabilities harder to exploit. Work on software diversity for security typically creates variants of a program using low-level code transformations. This paper is the first to study algorithm diversity for resilience. We first describe how a method based on high-level invariants and systematic incrementalization can be used to create algorithm variants. Executing multiple variants in parallel and comparing their outputs provides greater resilience than executing one variant. To prevent different parallel schedules from causing variants' behaviors to diverge, we present a synchronized execution algorithm for DistAlgo, an extension of Python for high-level, precise, executable specifications of distributed algorithms. We propose static and dynamic metrics for measuring diversity. An experimental evaluation of algorithm diversity combined with implementation-level diversity for several sequential algorithms and distributed algorithms shows the benefits of algorithm diversity

The Raincore Distributed Session Service for Networking Elements

Motivated by the explosive growth of the Internet, we study efficient and fault-tolerant distributed session layer protocols for networking elements. These protocols are designed to enable a network cluster to share the state information necessary for balancing network traffic and computation load among a group of networking elements. In addition, in the presence of failures, they allow network traffic to fail-over from failed networking elements to healthy ones. To maximize the overall network throughput of the networking cluster, we assume a unicast communication medium for these protocols. The Raincore Distributed Session Service is based on a fault-tolerant token protocol, and provides group membership, reliable multicast and mutual exclusion services in a networking environment. We show that this service provides atomic reliable multicast with consistent ordering. We also show that Raincore token protocol consumes less overhead than a broadcast-based protocol in this environment in terms of CPU task-switching. The Raincore technology was transferred to Rainfinity, a startup company that is focusing on software for Internet reliability and performance. Rainwall, Rainfinity’s first product, was developed using the Raincore Distributed Session Service. We present initial performance results of the Rainwall product that validates our design assumptions and goals

Terrorizing Advocacy and the First Amendment: Free Expression and the Fallacy of Mutual Exclusivity

Traditional free speech doctrine is inadequate to account for modern terrorist speech. Unprotected threats and substantially protected lawful advocacy are not mutually exclusive. This Article proposes recognizing a new hybrid category of speech called “terrorizing advocacy.” This is a type of traditionally protected public advocacy of unlawful conduct that simultaneously exhibits the unprotected pathologies of a true threat. This Article explains why this new category confounds existing First Amendment doctrine and details a proposed model for how the doctrine should be reshaped

Quantifying Quantum Correlations in Fermionic Systems using Witness Operators

We present a method to quantify quantum correlations in arbitrary systems of indistinguishable fermions using witness operators. The method associates the problem of finding the optimal entan- glement witness of a state with a class of problems known as semidefinite programs (SDPs), which can be solved efficiently with arbitrary accuracy. Based on these optimal witnesses, we introduce a measure of quantum correlations which has an interpretation analogous to the Generalized Robust- ness of entanglement. We also extend the notion of quantum discord to the case of indistinguishable fermions, and propose a geometric quantifier, which is compared to our entanglement measure. Our numerical results show a remarkable equivalence between the proposed Generalized Robustness and the Schliemann concurrence, which are equal for pure states. For mixed states, the Schliemann con- currence presents itself as an upper bound for the Generalized Robustness. The quantum discord is also found to be an upper bound for the entanglement.Comment: 7 pages, 6 figures, Accepted for publication in Quantum Information Processin