Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published April 1999 | Published
Book Section - Chapter Open

A Consistent History Link Connectivity Protocol

Abstract

The RAIN (Reliable Array of Independent Nodes) project at Caltech is focusing on creating reliable distributed systems by leveraging commercially available personal computers and interconnect technologies. Fault-tolerance is introduced into the communication infrastructure by using multiple network interfaces per compute node. When using multiple network connections per compute node, the question of how to monitor 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 channel. The history of channel-state is guaranteed to be identical at each endpoint within some bounded slack. Our main contributions are: (i) a simple, stable protocol for monitoring connectivity that maintains a consistent history with bounded slack, and (ii) proofs that this protocol exhibits correctness, bounded slack, and stability.

Additional Information

© 1999 IEEE. Date of Current Version: 06 August 2002. Supported in part by the NSF Young Investigator Award CCR-9457811, by the Sloan Research Fellowship, and by DARPA through an agreement with NASA/OSAT.

Attached Files

Published - LEMipssspdp99.pdf

Files

LEMipssspdp99.pdf
Files (75.1 kB)
Name Size Download all
md5:77267d0a61b7eef433ac6b165a4fb2d7
75.1 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 24, 2023