Verifications of RMP: an efficient reliable multicast protocol

Author

Jia, Weijia ; Cao, Jiannon ; Nett, Edgar ; Kaiser, Jörg

Author_Institution

Dept. of Comput. Sci., City Univ. of Hong Kong, Hong Kong

fYear

1996

fDate

12-14 Jun 1996

Firstpage

388

Lastpage

393

Abstract

This paper presents a novel reliable group multicast based on a logical-clock token ring approach. The algorithms are simple and can guarantee the total ordering and atomicity of multicast messages and is highly efficient. The correctness of the algorithms has been given an terms of the operational processes in a group. The recovery algorithms of the protocol can handle communication fault, process crash failures and network partition. The performance analysis of the algorithms is also presented

Keywords

fault tolerant computing; formal verification; token networks; transport protocols; RMP; atomic multicast; communication fault; communication protocols; distributed systems; fault-tolerance; group multicast; logical-clock token ring; multicast messages; network partition; performance analysis; process crash failures; recovery algorithms; reliable multicast protocol; Computer crashes; Computer science; Fault tolerant systems; Large-scale systems; Multicast algorithms; Multicast protocols; Partitioning algorithms; Performance analysis; Process design; Token networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Architectures, Algorithms, and Networks, 1996. Proceedings., Second International Symposium on

Conference_Location

Beijing

ISSN

1087-4089

Print_ISBN

0-8186-7460-1

Type

conf

DOI

10.1109/ISPAN.1996.509015

Filename

509015