Verifications of RMP: An efficient reliable multicast protocol

doi:10.1109/ISPAN.1996.509015

Details of Research Outputs

Title	Verifications of RMP: An efficient reliable multicast protocol
Creator	Jia, Weijia; Cao, Jiannon; Nett, Edgar; Kaiser, Jörg
Date Issued	1996
Conference Name	2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN
Source Publication	Proceedings Second International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'96)
ISBN	0818674601
ISSN	1087-4089
Pages	388-393
Conference Date	JUN 12-14, 1996
Conference Place	Beijing, China
Publisher	IEEE, Los Alamitos, CA, United States
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 in 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.
Keyword	atomic multicast communication protocols fault-tolerance distributed systems
DOI	10.1109/ISPAN.1996.509015
URL	View source
Indexed By	CPCI-S
Language	英语English
WOS Research Area	Computer Science
WOS Subject	Computer Science, Hardware & Architecture ; Computer Science, Theory & Methods
WOS ID	WOS:A1996BF75W00063
Citation statistics	Cited Times:1[WOS] [WOS Record] [Related Records in WOS]
Document Type	Conference paper
Identifier	http://repository.uic.edu.cn/handle/39GCC9TT/4676
Collection	Research outside affiliated institution
Affiliation	City Univ of Hong Kong, Hong Kong, China
Recommended Citation GB/T 7714	Jia, Weijia,Cao, Jiannon,Nett, Edgaret al. Verifications of RMP: An efficient reliable multicast protocol[C]: IEEE, Los Alamitos, CA, United States, 1996: 388-393.

Files in This Item:
There are no files associated with this item.

Related Services

Usage statistics

Google Scholar

If you have any objections to this item, please fill out the form below and the administrator will contact you as soon as possible.
Content:
Email：	*
Institution:
Verification Code:	Refresh

Any comments and suggestions are welcomed.
Title:	*
Content:
Email：	*
Verification Code:	Refresh