Fast message ordering and membership using a logical token-passing ring

Author

Amir, Y. ; Moser, L.E. ; Melliar-Smith, P.M. ; Agarwal, D.A. ; Ciarfella, P.

Author_Institution

Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA

fYear

1993

fDate

25-28 May 1993

Firstpage

551

Lastpage

560

Abstract

The Totem protocol supports consistent concurrent operations by placing a total order on broadcast messages. This total order is achieved by including a sequence number in a token circulated around a logical ring that is imposed on a set of processors in a broadcast domain. A membership algorithm handles reconfiguration, including restarting of a failed processor and remerging of a partitioned network. Effective flow-control allows the protocol to achieve message ordering rates two to three times higher than the best prior protocols. The single-ring total ordering protocol of Totem provides fault-tolerant agreed and safe delivery of messages within a broadcast domain

Keywords

fault tolerant computing; protocols; token networks; Totem protocol; broadcast domain; broadcast messages; failed processor; fault-tolerant; flow-control; logical token-passing ring; membership algorithm; message ordering; partitioned network; reconfiguration; restarting; safe delivery; sequence number; single-ring total ordering protocol; total order; Broadcasting; Computer science; Delay; Fault tolerance; Fault tolerant systems; Maintenance; Merging; Partitioning algorithms; Protocols; Throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

Distributed Computing Systems, 1993., Proceedings the 13th International Conference on

Conference_Location

Pittsburgh, PA

Print_ISBN

0-8186-3770-6

Type

conf

DOI

10.1109/ICDCS.1993.287668

Filename

287668