Comparative Performance Analysis of Ordering Strategies in Atomic Broadcast Algorithms

IEICE Transactions on Information and Systems

Volumn E86-D, Issue 12, 2003, Pages 2698-2709

  Défago, Xavier ^a,b   Schiper, André ^c   Urbán, Péter ^c  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^c EPFL   (Switzerland)

Author keywords

Atomic Broadcast; Contention aware metrics; Distributed algorithms; Performance analysis; Total order

Indexed keywords

ALGORITHMS; COMMUNICATION; COMPUTER SIMULATION; ESTIMATION; NETWORKS (CIRCUITS); PERFORMANCE; PROBLEM SOLVING; SYSTEMS ANALYSIS;

ATOMIC BROADCAST; CONTENTION-AWARE METRICES; DISTRIBUTED ALGORITHMS; PERFORMANCE ANALYSIS; TOTAL ORDER;

BROADCASTING;

EID: 0842332037     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (16)

1. Y. Amir, L.E. Moser, P.M. Melliar-Smith, D.A. Agarwal, and P. Ciarfella, "The Totem single-ring ordering and membership protocol," ACM Trans. Comput. Syst., vol.13, no.4, pp.311-342, 1995.
2. K.P. Birman and T.A. Joseph, "Reliable communication in the presence of failures," ACM Trans. Comput. Syst., vol.5, no.1, pp.47-76, 1987.
3. K.P. Birman, A. Schiper, and P. Stephenson, "Lightweight causal and atomic group multicast," ACM Trans. Comput. Syst., vol.9, no.3, pp.272-314, 1991.
4. T.D. Chandra and S. Toueg, "Unreliable failure detectors for reliable distributed systems," J. ACM, vol.43, no.2, pp.225-267, 1996.
5. J.-M. Chang and N.F. Maxemchuk, "Reliable broadcast protocols, " ACM Trans. Comput. Syst., vol.2, no.3, pp.251-273, 1984.
6. F. Cristian, R. de Beijer, and S. Mishra, "A performance comparison of asynchronous atomic broadcast protocols," Distr. Syst. Eng., vol.1, no.4, pp.177-201, 1994.
7. F. Cristian, S. Mishra, and G. Alvarez, "High-performance asynchronous atomic broadcast," Distr. Syst. Eng., vol.4, no.2, pp.109-128, 1997.
8. X. Défago, A. Schiper, and P. Urban, "Totally ordered broadcast and multicast algorithms: A comprehensive survey," Tech. Rep. DSC/2000/036, Swiss Fed. Inst. Tech., Lausanne, Switzerland, Sept. 2000.
9. R. Friedman and R. van Renesse, "Packing messages as a tool for boosting the performance of total ordering protocols," Proc. HPDC, pp.233-242, IEEE, Aug. 1997.
10. V. Hadzilacos and S. Toueg, "A modular approach to fault-tolerant broadcasts and related problems," Tech. Rep. CS94-1425, Cornell Univ., USA, May 1994.
11. M.F. Kaashoek and A.S. Tanenbaum, "Group communication in the Amoeba distributed operating system," Proc. ICDCS, pp.222-230, IEEE, May 1991.
12. B. Kemme, F. Pedone, G. Alonso, A. Schiper, and M. Wiesmann, "Using optimistic atomic broadcast in transaction processing systems," IEEE Trans. Knowl. Data Eng., vol.15, no.4, pp.1018-1032, 2003.
13. L. Lamport, "Time, clocks, and the ordering of events in a distributed system," Commun. ACM, vol.21, no.7, pp.558-565, 1978.
14. L.L. Peterson, N.C. Buchholz, and R.D. Schlichting, "Preserving and using context information in interprocess communication," ACM Trans. Comput. Syst., vol.7, no.3, pp.217-246, 1989.
15. F.B. Schneider, "Implementing fault-tolerant services using the state machine approach: A tutorial," ACM Comput. Surv., vol.22, no.4, pp.299-319, 1990.
16. P. Urban, X. Défago, and A. Schiper, "Contention-aware metrics for distributed algorithms," Proc. ICCCN, pp.582-589, IEEE, Oct. 2000.