A Consistent History Link Connectivity Protocol
- Creators
- LeMahieu, Paul
-
Bruck, Jehoshua
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
Name | Size | Download all |
---|---|---|
md5:77267d0a61b7eef433ac6b165a4fb2d7
|
75.1 kB | Preview Download |
Additional details
- Eprint ID
- 28334
- Resolver ID
- CaltechAUTHORS:20111207-091413566
- NSF Young Investigator Award
- CCR-9457811
- Alfred P. Sloan Foundation
- Defense Advanced Research Projects Agency (DARPA)
- NASA
- Created
-
2011-12-22Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 6251689