DocumentCode
2747275
Title
A consistent history link connectivity protocol
Author
LeMahieu, Paul ; Bruck, Jehoshua
Author_Institution
California Inst. of Technol., Pasadena, CA, USA
fYear
1999
fDate
12-16 Apr 1999
Firstpage
138
Lastpage
142
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
Keywords
distributed processing; fault tolerant computing; protocols; RAIN; Reliable Array of Independent Nodes; connectivity; connectivity protocol; fault-tolerance; history link connectivity protocol; reliable distributed systems; Computer interfaces; Computer network reliability; Computer networks; Fault tolerance; History; Microcomputers; Network interfaces; Protocols; Rain; Telecommunication network reliability;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing, 1999. 13th International and 10th Symposium on Parallel and Distributed Processing, 1999. 1999 IPPS/SPDP. Proceedings
Conference_Location
San Juan
Print_ISBN
0-7695-0143-5
Type
conf
DOI
10.1109/IPPS.1999.760448
Filename
760448
Link To Document