Newtop: a fault-tolerant group communication protocol

  title={Newtop: a fault-tolerant group communication protocol},
  author={Paul D. Ezhilchelvan and Raimundo J. A. Mac{\^e}do and Santosh K. Shrivastava},
  journal={Proceedings of 15th International Conference on Distributed Computing Systems},
A general purpose group communication protocol suite called Newtop is described. It is assumed that processes can simultaneously belong to many groups, group size could be large, and processes could be communicating over the Internet. Asynchronous communication environment is therefore assumed where message transmission times cannot be accurately estimated, and the underlying network may well get partitioned, preventing functioning processes from communicating with each other. Newtop can… 

Figures from this paper

Scalable atomic multicast
A new scalable fault-tolerant algorithm which ensures total order delivery of messages sent to multiple groups of processes and uses two companion protocols, namely a reliable multicast protocol and a consensus protocol, which follows a design methodology based on the composition of (encapsulated) micro-protocols.
Fault-tolerant causal delivery in group communication
A new intra-group communication protocol is proposed which supports the causally ordered delivery of messages for the processes within the group and supports the reliable delivery of items in the presence of the Byzantine faults of the processes.
Implementation and Performance of a Total Order Multicast to Multiple Groups
This paper presents an implementation and the performance of a total order (or atomic) multicast protocol, which assumes the distributed system is composed by a set of disjoint process groups and allows messages to be multicast to arbitrary sets of groups.
Flexible Communication Protocol for Wide-area Group
High-speed protocols which can change the ways for distributing messages to multiple destinations and retransmitting messages to processes losing the messages in the wide-area group in the change of the delay and reliability are discussed.
MojaveComm: A View-Oriented Group Communication Protocol with Support for Virtual Synchrony
In this thesis, we explore the feasibility of implementing a general communication protocol that addresses common classes of problems that one encounters in the development of distributed
A group communication protocol for CORBA
  • L. Moser, P. Melliar-Smith, R. Koch, K. Berket
  • Computer Science
    Proceedings of the 1999 ICPP Workshops on Collaboration and Mobile Computing (CMC'99). Group Communications (IWGC). Internet '99 (IWI'99). Industrial Applications on Network Computing (INDAP). Multime
  • 1999
The Fault-Tolerant Multicast Protocol (FTMP) described here is a group communication protocol specifically designed for the common object request broker architecture (CORBA).
Scalable Atomic Multicast Scalable Atomic Multicast
A new scalable fault-tolerant algorithm which ensures total order delivery of messages sent to multiple groups of processes and uses two companion protocols that are not required to use the same communication channels or to share common variables with the total order protocol.
Multicast group communication for CORBA
This paper presents a multicast group communication engine and bridge for CORBA that allows different multicasts group communication protocols to cooperate and integrates streams of messages into a single stream for delivery in timestamp order.
MojaveComm: A Robust Group Communication Library for Grid Environments
A fault-tolerant group communication protocol that is aimed at grid and wide area environments and can be used to implement sequential consistency is introduced.
Enhancing group communication with self-manageable behavior


Fault-tolerant group communication protocols for asynchronous systems
The Causal Blocks representation provides a concise method for deducing ordering relationships between messages exchanged by processes of a group, resulting in simple methods for dealing with multiple groups and a protocol for total order message delivery which has constant and low message space overhead.
Broadcast Protocols for Distributed Systems
An innovative approach is presented to the design of fault-tolerant distributed systems that avoids the several rounds of message exchange required by current protocols for consensus agreement. The
Causal multicasts in overlapping groups: towards a low cost approach
It is shown that there is a tradeoff between the delay in the delivery of messages and the size of timestamps carried by messages for timestamp-based protocols implementing causal order.
A Membership Protocol Based on Partial Order
A membership protocol is described that is based on a multicast facility that preserves only the partial order of messages exchanged among the communicating processes and requires less synchronization overhead than existing protocols.
Preserving and using context information in interprocess communication
The paper shows how Psync can be efficiently implemented on an unreliable communications network, and it demonstrates how conversations serve as an elegant foundation for ordering messages exchanged in a distributed computation and for recovering from processor failures.
Early delivery totally ordered multicast in asynchronous environments
Experimental results show up to O(log (n)) speedup over previous protocols, which matches the authors' prediction of the expected speedup.
Consul: a communication substrate for fault-tolerant distributed programs
This dissertation introduces Consul, a communication substrate designed to help improve system dependability by providing a platform for building fault-tolerant, distributed systems based on the replicated state machine approach and shows that the semantic based order is more efficient than a total order in many situations.
Virtually-synchronous communication based on a weak failure suspector
  • A. Schiper, A. Ricciardi
  • Computer Science
    FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing
  • 1993
The authors suggest a three-component architecture to implement virtually synchronous communication: (1) at the lowest level, the FS component; on top of it, (2a) a component that defines new views, and (2b) a components that reliably multicasts messages within a view.
Using process groups to implement failure detection in asynchronous environments
A rigorous, formal specification for group membership is presented under this interpretation and a solution is presented for this problem as it relates to failure detection in asynchronous, distributed systems.
RELACS: A communications infrastructure for constructing reliable applications in large-scale distributed systems
The architecture of the RELACS communication subsystem that constitutes the microkernel of a layered approach to reliable computing in large-scale distributed systems is described.