Fault-tolerant total order multicast to asynchronous groups

被引:14
|
作者
Fritzke, U [1 ]
Ingels, P [1 ]
Mostefaoui, A [1 ]
Raynal, M [1 ]
机构
[1] IRISA, F-35042 Rennes, France
关键词
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
相关论文
共 50 条
  • [21] Efficient fault-tolerant multicast scheme for hypercube multicomputers
    Chiu, GM
    Chen, KS
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1998, 9 (10) : 952 - 962
  • [22] A "dual-tree" scheme for fault-tolerant multicast
    Fei, AG
    Cui, JH
    Gerla, M
    Cavendish, D
    2001 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-10, CONFERENCE RECORD, 2001, : 690 - 694
  • [23] A Fault-Tolerant Distributed Framework for Asynchronous Iterative Computations
    Zhou, Tian
    Gao, Lixin
    Guan, Xiaohong
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2021, 32 (08) : 2062 - 2073
  • [24] FAULT-TOLERANT CRITICAL SECTION MANAGEMENT IN ASYNCHRONOUS NETWORKS
    BARNOY, A
    DOLEV, D
    KOLLER, D
    PELEG, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 392 : 13 - 23
  • [25] Fundamentals of fault-tolerant distributed computing in asynchronous environments
    Gärtner, FC
    ACM COMPUTING SURVEYS, 1999, 31 (01) : 1 - 26
  • [26] FAULT-TOLERANT CRITICAL SECTION MANAGEMENT IN ASYNCHRONOUS ENVIRONMENTS
    BARNOY, A
    DOLEV, D
    KOLLER, D
    PELEG, D
    INFORMATION AND COMPUTATION, 1991, 95 (01) : 1 - 20
  • [27] Fault-tolerant nanocomputers based on asynchronous Cellular Automata
    Isokawa, T
    Abo, F
    Peper, F
    Adachi, S
    Lee, J
    Matsui, N
    Mashiko, S
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2004, 15 (06): : 893 - 915
  • [28] FTKM: A fault-tolerant key management protocol for multicast communications
    Seba, H.
    COMPUTERS & SECURITY, 2006, 25 (06) : 426 - 434
  • [29] Performance of an adaptive fault-tolerant routing algorithm for multicast communications
    Borella, A
    Cancellieri, G
    ATM, NETWORKS AND LANS - NOC '96-II, 1996, : 295 - 296
  • [30] An efficient fault-tolerant multicast approach for wireless mobile systems
    Lin, JW
    ISCC2004: NINTH INTERNATIONAL SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, VOLS 1 AND 2, PROCEEDINGS, 2004, : 556 - 561