|
Abstract : |
In group communication, in order to deliver multicast messages reliably in a group, it is common practice for each member to maintain copies of all messages it sends and receives in a bu er for potential local retransmission. The storage of these messages is costly and bu ers may grow out of bound. A form of garbage collection is needed to address this issue. Garbage collection occurs once a process learns that a message in its bu er has been received by every process in the group. The message is declared stable and is released from the bu er. An important part of garbage collection is message stability detection. This dissertation presents the result of an investigation into message stability detection protocols. A number of message stability detection protocols used in popular reliable multicast protocols are studied with a focus on their performance in large scale settings. This dissertation proposes anewgossip-style protocol with improved scalability and fault tolerance. This dissertation also shows that by adding a hierarchical structure to the set of basic protocols, their performance can be signi cantly improved when the number of participants is large., |
