Fault-tolerant total order multicast to asynchronous groups

被引:15
作者
Fritzke, U [1 ]
Ingels, P [1 ]
Mostefaoui, A [1 ]
Raynal, M [1 ]
机构
[1] IRISA, F-35042 Rennes, France
来源
SEVENTEENTH IEEE SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS, PROCEEDINGS | 1998年
关键词
D O I
10.1109/RELDIS.1998.740503
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
While Total Order Broadcast (or Atomic Broadcast) primitives have received a lot of attention, this paper concentrates an Total Order Multicast to Multiple Groups in the context of asynchronous distributed systems in which processes may suffer crash failures. "Multicast to Multiple Groups" means that each message is sent to a subset of the process groups composing the system, distinct messages possibly having distinct destination groups. "Total Order" means that all message deliveries must be totally ordered. This paper proposes a protocol for such a multicast primitive. This protocol is based on two underlying building blocks, namely, Uniform Reliable Multicast and Uniform Consensus. its design characteristics lie in the two following properties. The first one is a Minimality property, more precisely, only the sender of a message and processes of its destination groups have to participate in the multicast of the message. The second property is a Locality property: no execution of a consensus has to involve processes belonging to distinct groups (i.e., consensus are executed on a "per group" basis). This Locality property is particularly useful when one is interested in using the Total Order Multicast primitive in large scale distributed systems. An improvement that reduces the cost of the protocol is also suggested.
引用
收藏
页码:228 / 234
页数:7
相关论文
共 17 条
[1]   THE TOTEM SINGLE-RING ORDERING AND MEMBERSHIP PROTOCOL [J].
AMIR, Y ;
MOSER, LE ;
MELLIARSMITH, PM ;
AGARWAL, DA ;
CIARFELLA, P .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1995, 13 (04) :311-342
[2]  
[Anonymous], P 23 INT S FAULT TOL
[3]   RELIABLE COMMUNICATION IN THE PRESENCE OF FAILURES [J].
BIRMAN, KP ;
JOSEPH, TA .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1987, 5 (01) :47-76
[4]   Unreliable failure detectors for reliable distributed systems [J].
Chandra, TD ;
Toueg, S .
JOURNAL OF THE ACM, 1996, 43 (02) :225-267
[5]   The weakest failure detector for solving Consensus [J].
Chandra, TD ;
Hadzilacos, V ;
Toueg, S .
JOURNAL OF THE ACM, 1996, 43 (04) :685-722
[6]   IMPOSSIBILITY OF DISTRIBUTED CONSENSUS WITH ONE FAULTY PROCESS [J].
FISCHER, MJ ;
LYNCH, NA ;
PATERSON, MS .
JOURNAL OF THE ACM, 1985, 32 (02) :374-382
[7]  
FRITZE U, 1998, 1162 IRISA
[8]   ORDERED AND RELIABLE MULTICAST COMMUNICATION [J].
GARCIAMOLINA, H ;
SPAUSTER, A .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1991, 9 (03) :242-271
[9]  
GARG VK, 1998, IN PRESS PARALLEL PR
[10]  
Guerraoui R, 1997, LECT NOTES COMPUT SC, V1320, P141, DOI 10.1007/BFb0030681