Newtop: a fault-tolerant group communication protocol

Ezhilchelvan, PD; Macêdo, Raimundo José de Araújo; Shrivastava, SK

doi:10.1109/icdcs.1995.500032

Cited by 112 publications

(94 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Transis [2] was the first system that allowed partitions to continue with independent groups. It has been followed by several other such as Totem [18], Moshe [14], Relacs [5], Jgroups [6], Newtop [10], and RMP [13]. For a comprehensive comparison of different group communication services, we recommend the paper by Chockler et al [9].…”

Section: Related Workmentioning

confidence: 99%

Specification, Implementation and Verification of Dynamic Group Membership for Vehicle Coordination

Asplund

Lövhall

Villani

2017

2017 IEEE 22nd Pacific Rim International Symposium on Dependable Computing (PRDC)

View full text Add to dashboard Cite

Abstract-New advanced traffic management solutions with fully or semi-autonomous vehicles that communicate over a wireless interface to coordinate their driving decisions create new challenges in distributed computing. In this paper we address the problem of dynamic group membership in three stages. First, we propose three criteria to specify correctness and performance of the group views created by such algorithms in terms of soundness, completeness and freshness. Second, we develop a group membership protocol tailored for vehicular coordination. Finally, we show through simulation and model-based verification that the protocol does indeed meet the criteria and provide at least 95% perfect group membership views under as adverse conditions as 70% packet loss or very high churn rate.

show abstract

Section: Related Workmentioning

confidence: 99%

Specification, Implementation and Verification of Dynamic Group Membership for Vehicle Coordination

Asplund

Lövhall

Villani

2017

2017 IEEE 22nd Pacific Rim International Symposium on Dependable Computing (PRDC)

View full text Add to dashboard Cite

show abstract

“…Although most work in decentralized ordering algorithms assumes only a single group, a few consider overlapping groups [14,22,23,24]. Our approach is closest to that of Garcia-Molina et al [14].…”

Section: Related Workmentioning

confidence: 99%

Decentralized Message Ordering for Publish/Subscribe Systems

Lumezanu

Spring

Bhattacharjee

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We describe a method to order messages across groups in a publish/subscribe system without centralized control or large vector timestamps. We show that our scheme is practical-little state is required; that it is scalable-the maximum message load is limited by receivers; and that it performs well-the paths messages traverse to be ordered are not made much longer than necessary. Our insight is that only messages to groups that overlap in membership can be observed to arrive out of order: sequencing messages to these groups is sufficient to provide a consistent order, and when publishers subscribe to the groups to which they send, this message order is a causal order.

show abstract

“…FT-CORBA uses reliable multicast group communication [20,33,34,19] to provide ordered delivery of messages and to maintain state consistency among all replicas. The infrastructure sends a single reply to the client by detecting and suppressing duplicate replies generated by multiple members of the object group.…”

Section: Replication Managermentioning

confidence: 99%

“…To address this problem, therefore, the OMG devised the Fault-tolerant CORBA (FT-CORBA) specification [1], which leveraged the lessons learned from earlier R&D efforts [20,21,22,19,10,16]. As we pointed out in Sections 1 and 3, however, FT-CORBA is not yet usable in DRE systems that possess stringent end-to-end QoS constraints.…”

Section: The Interception Strategymentioning

confidence: 99%