Browse Prior Art Database

Reliable Message Diffusion

IP.com Disclosure Number: IPCOM000062793D
Original Publication Date: 1986-Dec-01
Included in the Prior Art Database: 2005-Mar-09
Document File: 1 page(s) / 12K

Publishing Venue

IBM

Related People

Cristian, F: AUTHOR [+3]

Abstract

A method for reliably sending a message to each processor in a network despite processor and communication failures is proposed. Each processor should receive and process the message exactly once in spite of omission and performance fault of processors and links, and even if such failures disconnect some processors from the message initiator.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 62% of the total text.

Page 1 of 1

Reliable Message Diffusion

A method for reliably sending a message to each processor in a network despite processor and communication failures is proposed. Each processor should receive and process the message exactly once in spite of omission and performance fault of processors and links, and even if such failures disconnect some processors from the message initiator.

To use the proposed protocol, each processor in the network must be able to buffer messages until the network eventually reconnects disconnected processors or failed processors are recovered. For the protocol to be efficient and scalable to very large networks, two constraints are required. The first constraint is processor should be responsible for ensu that each processor should be responsible for ensuring that only a small subset of the processors in the network receive the message. Thus, only modest storage requirements for message histories are imposed. The second constraint is that each processor must be able to determine, as quickly as possible, when information concerning a message can be safely discarded without possibility that the same message will be delivered twice. The capability to "forget" is an important practical constraint to avoid the need for infinite storage capacity to store message histories.

The proposed protocol is characterized by each processor maintaining a message history concerning communications with its "neighbors". The message history includes a neighbor timestamp...