Advances in the Design and Implementation of Group Communication Middleware

Bünzli, Daniel; Fuzzati, Rachele; Mena, Sergio; Nestmann, Uwe; Rütti, Olivier; Schiper, André; Wojciechowski, Paweł T.

doi:10.1007/11808107_8

Cited by 6 publications

(3 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Addressing real-time constraints, e.g., [18], needs also to get more attention. Finally, note that recent advances in the design and implementation of group communication middeleware are presented in another chapter of this book [5].…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Dependable Systems

Schiper

2006

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Improving the dependability of computer systems is a critical and essential task. In this context, the paper surveys techniques that allow to achieve fault tolerance in distributed systems by replication. The main replication techniques are first explained. Then group communication is introduced as the communication infrastructure that allows the implementation of the different replication techniques. Finally the difficulty of implementing group communication is discussed, and the most important algorithms are presented. IntroductionComputer systems become every day more and more complex. As a consequence the probability of problems in these systems increases over the years. To avoid this from becoming a major issue, researchers have since many years worked on improving the dependability of these systems. The methods involved are traditionally classified as fault prevention, fault tolerance, fault removal and fault forecasting [23]. Fault prevention refers to methods for preventing the occurrence or the introduction of faults in the system. Fault tolerance refers to methods allowing the system to provide a service complying with the specification in spite of faults. Fault removal refers to methods for reducing the number and the severity of faults. Fault forecasting refers to methods for estimating the presence of faults (with the goal to locate and remove them). We concentrate here on fault tolerance.Several techniques to achieve fault tolerance have been developed over the years. The different techniques are related to the specificity of applications. For example, a centralized application differs from a distributed application involving several computing systems. We consider here distributed applications. Fault tolerance for distributed applications can be achieved with different techniques: transactions, checkpointing and replication.Transactions have been introduced many years ago in the context of database systems [3]. A transaction allows us to group a sequence of operations while ensuring some properties on these operations, called ACID properties [3]: Atomicity, Consistency, Isolation and Durability. Atomicity requires that either all Almost the same paper appears under the title Group Communication: from practice to theory in

show abstract

Section: Resultsmentioning

confidence: 99%

“…In the group communication solution, the increment operation is sent to the replicas using atomic broadcast; no mutual exclusion is required. 5 Implementing atomic broadcast requires weaker assumptions about the crash detection mechanism than implementing mutual exclusion [12].…”

Section: Quorum Systems For Implementing a Fault Tolerant Registermentioning

confidence: 99%

Dependable Systems

Schiper

2006

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…The group membership component is responsible for detecting faulty members, and for keeping an up-to-date list of peers that are fault-free, called the group view [15], [16], [17]. Furthermore there are also mechanisms for members to join and to leave a PCG.…”

Section: Peer Content Groupsmentioning

confidence: 99%

Peer Content Groups for Reliable and Transparent Content Access in P2P Networks

Godoi

Duarte²

2011

2011 IEEE 17th International Conference on Parallel and Distributed Systems

View full text Add to dashboard Cite

This work presents a strategy based on the group communication for transparent and robust content access in P2P networks. Instead of accessing a single peer for obtaining the desired content, a user request is received and processed by a group of peers. A Peer Content Group (PCG) guarantees continuous access to content even if members crash or leave the system provided at least one member remains fault-free. Each PCG member is capable of independently serving the request. A PCG is transparent to the user, as the group interface is identical to the interface provided by a single peer. A group member is elected to serve each request. A fault monitoring component allows the detection of member crashes. If the peer that is serving a request crashes, another group member is elected to continue providing the service. Peer election and replacement are transparent to client peers. The PCG and a P2P file sharing application were implemented in the JXTA platform. Experimental results are presented showing the latency of group operations and system components.

show abstract