A consistent history link connectivity protocol

The RAIN (Reliable Array of Independent Nodes) project at Caltech is focusing on creating highly reliable distributed systems by leveraging commercially available personal computers, workstations and interconnect technologies. In particular, the issue of reliable communication is addressed by introducing redundancy in the form of multiple network interfaces per compute node. When using compute nodes with multiple network connections the question of how to determine connectivity between nodes arises. We examine a connectivity protocol that guarantees that each side of a point-to-point connection sees the same history of activity over the communication channel. In other words, we maintain a consistent history of the state of the communication channel. At any give moment in time the histories as seen by each side are guaranteed to be identical to within some number of transitions. This bound on how much one side may lead or lag the other is the slack. Our main contributions ar..

Computing in the RAIN: a reliable array of independent nodes

The RAIN project is a research collaboration between Caltech and NASA-JPL on distributed computing and data-storage systems for future spaceborne missions. The goal of the project is to identify and develop key building blocks for reliable distributed systems built with inexpensive off-the-shelf components. The RAIN platform consists of a heterogeneous cluster of computing and/or storage nodes connected via multiple interfaces to networks configured in fault-tolerant topologies. The RAIN software components run in conjunction with operating system services and standard network protocols. Through software-implemented fault tolerance, the system tolerates multiple node, link, and switch failures, with no single point of failure. The RAIN-technology has been transferred to Rainfinity, a start-up company focusing on creating clustered solutions for improving the performance and availability of Internet data centers. In this paper, we describe the following contributions: 1) fault-tolerant interconnect topologies and communication protocols providing consistent error reporting of link failures, 2) fault management techniques based on group membership, and 3) data storage schemes based on computationally efficient error-control codes. We present several proof-of-concept applications: a highly-available video server, a highly-available Web server, and a distributed checkpointing system. Also, we describe a commercial product, Rainwall, built with the RAIN technology

A group membership algorithm with a practical specification

Presents a solvable specification and gives an algorithm for the group membership problem in asynchronous systems with crash failures. Our specification requires processes to maintain a consistent history in their sequences of views. This allows processes to order failures and recoveries in time and simplifies the programming of high level applications. Previous work has proven that the group membership problem cannot be solved in asynchronous systems with crash failures. We circumvent this impossibility result building a weaker, yet nontrivial specification. We show that our solution is an improvement upon previous attempts to solve this problem using a weaker specification. We also relate our solution to other methods and give a classification of progress properties that can be achieved under different models

Agreement Problems in Networks with Directed Graphs and Switching Topology

In this paper, we provide tools for convergence and performance analysis of an agreement protocol for a network of integrator agents with directed information flow. Moreover, we analyze algorithmic robustness of this consensus protocol for the case of a network with mobile nodes and switching topology. We establish a connection between the Fiedler eigenvalue of the graph Laplacian and the performance of this agreement protocol. We demostrate that a class of directed graphs, called balanced graphs, have a crucial role in solving average-consensus problems. Based on the properties of balanced graphs, a group disagreement function (i.e. Lyapunov function) is proposed for convergence analysis of this agreement protocol for networks with directed graphs. This group disagreement function is later used for convergence analysis for the agreement problem in networks with switching topology. We provide simulation results that are consistent with our theoretical results and demonstrate the effectiveness of the proposed analytical tools

Understanding Internet topology: principles, models, and validation

Building on a recent effort that combines a first-principles approach to modeling router-level connectivity with a more pragmatic use of statistics and graph theory, we show in this paper that for the Internet, an improved understanding of its physical infrastructure is possible by viewing the physical connectivity as an annotated graph that delivers raw connectivity and bandwidth to the upper layers in the TCP/IP protocol stack, subject to practical constraints (e.g., router technology) and economic considerations (e.g., link costs). More importantly, by relying on data from Abilene, a Tier-1 ISP, and the Rocketfuel project, we provide empirical evidence in support of the proposed approach and its consistency with networking reality. To illustrate its utility, we: 1) show that our approach provides insight into the origin of high variability in measured or inferred router-level maps; 2) demonstrate that it easily accommodates the incorporation of additional objectives of network design (e.g., robustness to router failure); and 3) discuss how it complements ongoing community efforts to reverse-engineer the Internet

A critical look at power law modelling of the Internet

This paper takes a critical look at the usefulness of power law models of the Internet. The twin focuses of the paper are Internet traffic and topology generation. The aim of the paper is twofold. Firstly it summarises the state of the art in power law modelling particularly giving attention to existing open research questions. Secondly it provides insight into the failings of such models and where progress needs to be made for power law research to feed through to actual improvements in network performance.Comment: To appear Computer Communication

Effect of rs1344706 in the ZNF804A gene on the brain network.

ZNF804A rs1344706 (A/C) was the first SNP that reached genome-wide significance for schizophrenia. Recent studies have linked rs1344706 to functional connectivity among specific brain regions. However, no study thus far has examined the role of this SNP in the entire functional connectome. In this study, we used degree centrality to test the role of rs1344706 in the whole-brain voxel-wise functional connectome during the resting state. 52 schizophrenia patients and 128 healthy controls were included in the final analysis. In our whole-brain analysis, we found a significant interaction effect of genotype × diagnosis at the precuneus (PCU) (cluster size = 52 voxels, peak voxel MNI coordinates: x = 9, y = - 69, z = 63, F = 32.57, FWE corrected P < 0.001). When we subdivided the degree centrality network according to anatomical distance, the whole-brain analysis also found a significant interaction effect of genotype × diagnosis at the PCU with the same peak in the short-range degree centrality network (cluster size = 72 voxels, F = 37.29, FWE corrected P < 0.001). No significant result was found in the long-range degree centrality network. Our results elucidated the contribution of rs1344706 to functional connectivity within the brain network, and may have important implications for our understanding of this risk gene's role in functional dysconnectivity in schizophrenia