%%% ====================================================================
%%%  @LaTeX-file{
%%%     filename  = "dolevhss95.ltx",
%%%     date      = "20 November 1995",
%%%     time      = "21:41:30 EST",
%%%     author    = "David M. Jones",
%%%     email     = "jacm@theory.lcs.mit.edu",
%%%     url       = "http://theory.lcs.mit.edu/~jacm/",
%%%     address   = "Journal of the ACM
%%%                  MIT Laboratory for Computer Science
%%%                  Room NE43-316
%%%                  545 Technology Square
%%%                  Cambridge, MA 02139
%%%                  USA",
%%%     telephone = "(617) 253-5936",
%%%     FAX       = "(617) 253-3480",
%%%     checksum  = "31784 107 453 3946",
%%%     codetable = "ISO/ASCII",
%%%     supported = "yes",
%%%     docstring = "Copyright (c) 1995 by ACM, Inc.
%%%                  Permission to make digital or hard copies of part
%%%                  or all of this work for personal or classroom use
%%%                  is granted without fee provided that copies are
%%%                  not made or distributed for profit or direct
%%%                  commercial advantage and that copies bear this
%%%                  notice and the full citation on the first page.
%%%                  Copyrights for components of this work owned by
%%%                  others than ACM must be honored. Abstracting with
%%%                  credit is permitted. To copy otherwise, to
%%%                  republish, to post on servers, or to redistribute
%%%                  to lists, requires prior specific permission
%%%                  and/or a fee. Request permissions from
%%%                  Publications Dept, ACM Inc., fax +1 (212)
%%%                  869-0481, or permissions@acm.org.
%%%                  
%%%                  This is a LaTeX2e file.  To process it, you will
%%%                  need a copy of the acmabs document class, which is
%%%                  available via the following URL:
%%%
%%%                  http://theory.lcs.mit.edu/~jacm/acmart/acmabs.cls
%%%                  ",
%%%  }
%%% ====================================================================

\documentclass{acmabs}

\begin{document}

\Journal{Journal of the ACM}

\refkey{DolevHSS95}

\title{Dynamic Fault-Tolerant Clock Synchronization}

\author{Danny Dolev \and Joseph~Y. Halpern \and Barbara Simons \and Ray Strong}

\Pages{143--185}

\Month{January}

\Year{1995}

\Volume{42}

\Number{1}

\maketitle

\begin{abstract}

This paper gives two simple efficient distributed algorithms: one for keeping
  clocks in a network synchronized and one for allowing new processors to join
  the network with their clocks synchronized. Assuming a fault-tolerant
  authentication protocol, the algorithms tolerate both link and processor
  failures of any type. The algorithm for maintaining synchronization works for
  arbitrary networks (rather than just completely connected networks) and
  tolerates any number of processor or communication link faults as long as the
  correct processors remain connected by fault-free paths. It thus represents
  an improvement over other clock synchronization algorithms such as those of
  Lamport and Melliar-Smith [1985] and Welch and Lynch [1988], although, unlike
  them, it does require an authentication protocol to handle Byzantine faults.
  Our algorithm for allowing new processors to join requires that more than
  half the processors be correct, a requirement that is provably necessary.

\end{abstract}

\begin{categories}

C.2.4[distributed applications, distributed databases, network operating
  systems]; C.4[reliability, availability, and serviceability];
  D.4.1[synchronization]; D.4.5[fault-tolerance]

\end{categories}

\begin{terms}

General Terms: Algorithms, performance, reliability, theory

\end{terms}

\begin{keywords}

Byzantine failures, clock synchronization, fault-tolerance, time-of-day clock

\end{keywords}

\end{document}