In distributed systems it is often useful to ensure that messages sent between processes in a group are received by all group members. This thesis presents Reliable Non-Ordered Multicast Protocol (RNOMP). We argue that it achieves reliable multicast between processes in groups that processes can leave and join arbitrarily. The protocol has been implemented on top of a group membership simulation which allows evaluation of the performance of the protocol while varying packet loss and the frequency at which processes leaves and joins groups. After analyzing how the protocol handles certain situations we conclude that our protocol achieves reliability and performs well within certain parameter values
We present a new scalable fault-tolerant algorithm which ensures total order delivery of messages se...
Concepts of group (to structure processes) and causality (to structure sendings and deliveries of me...
Reliable multicast protocols are becoming an essential element in distributed applications such as i...
In distributed systems it is often useful to ensure that messages sent between processes in a group ...
This paper presents a transport-level multicast protocol that is useful for building fault-tolerant ...
Multicast is an efficient mechanism for distributing data from one sender to multiple receivers. Ma...
The group membership protocol is a mechanism that handle mobile nodes in a dynamic environment and p...
We propose a lightweight fault-tolerant multicast and mem-bership service for real-time process grou...
An efficient error recovery algorithm is essential for reliable multicast in large groups. Tree-bas...
Process groups are an increasingly popular tool for programming distributed systems. Such ...
The definition of reliable multicast has varied widely, going from requirements for absolute data re...
PhD ThesisIt is widely accepted that group communication (multicast) is a powerful abstraction that...
International audienceWe study atomic multicast, a fundamental abstraction for building fault-tolera...
This paper presents the Reliable Multicast Protocol (RMP). RMP provides a totally ordered, reliable,...
In this thesis, we present new protocols that provide reliable ordered multicasts to multiple overl...
We present a new scalable fault-tolerant algorithm which ensures total order delivery of messages se...
Concepts of group (to structure processes) and causality (to structure sendings and deliveries of me...
Reliable multicast protocols are becoming an essential element in distributed applications such as i...
In distributed systems it is often useful to ensure that messages sent between processes in a group ...
This paper presents a transport-level multicast protocol that is useful for building fault-tolerant ...
Multicast is an efficient mechanism for distributing data from one sender to multiple receivers. Ma...
The group membership protocol is a mechanism that handle mobile nodes in a dynamic environment and p...
We propose a lightweight fault-tolerant multicast and mem-bership service for real-time process grou...
An efficient error recovery algorithm is essential for reliable multicast in large groups. Tree-bas...
Process groups are an increasingly popular tool for programming distributed systems. Such ...
The definition of reliable multicast has varied widely, going from requirements for absolute data re...
PhD ThesisIt is widely accepted that group communication (multicast) is a powerful abstraction that...
International audienceWe study atomic multicast, a fundamental abstraction for building fault-tolera...
This paper presents the Reliable Multicast Protocol (RMP). RMP provides a totally ordered, reliable,...
In this thesis, we present new protocols that provide reliable ordered multicasts to multiple overl...
We present a new scalable fault-tolerant algorithm which ensures total order delivery of messages se...
Concepts of group (to structure processes) and causality (to structure sendings and deliveries of me...
Reliable multicast protocols are becoming an essential element in distributed applications such as i...