CaltechAUTHORS
  A Caltech Library Service

A Consistent History Link Connectivity Protocol

LeMahieu, Paul and Bruck, Jehoshua (1999) A Consistent History Link Connectivity Protocol. In: 13th International Parallel Processing Symposium & 10th Symposium on Parallel and Distributed Processing. IEEE Computer Society , Los Alamitos, CA, pp. 138-142. ISBN 0-7695-0143-5 http://resolver.caltech.edu/CaltechAUTHORS:20111207-091413566

[img]
Preview
PDF - Published Version
See Usage Policy.

73Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20111207-091413566

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.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1109/IPPS.1999.760448 DOIUNSPECIFIED
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=760448PublisherUNSPECIFIED
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.
Funders:
Funding AgencyGrant Number
NSF Young Investigator Award CCR-9457811
Alfred P. Sloan FoundationUNSPECIFIED
Defense Advanced Research Projects Agency (DARPA)UNSPECIFIED
NASAUNSPECIFIED
Other Numbering System:
Other Numbering System NameOther Numbering System ID
INSPEC Accession Number6251689
Record Number:CaltechAUTHORS:20111207-091413566
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:20111207-091413566
Official Citation:LeMahieu, P.; Bruck, J.; , "A consistent history link connectivity protocol," Parallel and Distributed Processing, 1999. 13th International and 10th Symposium on Parallel and Distributed Processing, 1999. 1999 IPPS/SPDP. Proceedings , vol., no., pp.138-142, 12-16 Apr 1999 doi: 10.1109/IPPS.1999.760448 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=760448&isnumber=16457
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:28334
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:22 Dec 2011 23:42
Last Modified:26 Dec 2012 14:34

Repository Staff Only: item control page