Lines Matching +full:clock +full:- +full:master

45 Command under contract No. N00039-84-C-0089, and by the Italian CSELT
53 .OH 'The Berkeley UNIX Time Synchronization Protocol''SMM:12-%'
54 .EH 'SMM:12-%''The Berkeley UNIX Time Synchronization Protocol'
60 a local area network clock synchronizer for
64 is based on a master slave scheme.
70 among slave time daemons when, for any reason, the master disappears.
77 (one per machine) and is based on a master-slave
81 A \fImaster time daemon\fP measures the time
82 difference between the clock of the machine on which it
84 uses ICMP \fITime Stamp Requests\fP [5] to measure the clock difference
86 The master computes the \fInetwork time\fP as the average of the
89 A clock is considered to be faulty when its value
96 correction that should be performed on the clock of its machine.
102 will ask the master for the correct time and will reset the machine's clock
110 already has a master and as master on other networks.
116 new master should the machine running the current master crash, the master
117 terminate (for example, because of a run-time error), or the network be
119 Under our algorithm, slaves are able to realize when the master has
120 stopped functioning and to elect a new master from among themselves.
121 It is important to note that since the failure of the master results
122 only in a gradual divergence of clock values, the election
151 All fields are based upon 8-bit bytes.  Fields should be sent in
167 A zero-terminated string of up to 256 \s-2ASCII\s+2 characters with the name of
174 one of three states: slave, master, or candidate for election to master.
185 The master sends this message to a slave to communicate
187 the clock of the slave and
188 the network time the master has just computed.
200 Both the master and the slaves use this message for
206 Master Request Message
212 A newly-started time daemon broadcasts this message to
213 locate a master.  No other action is implied by this packet.
214 It requires a Master Acknowledgment.
217 Master Acknowledgement
223 The master sends this message to acknowledge the Master Request message
233 The master sends this message to slave time daemons to set their time.
236 It contains the master's time as an approximation of the network time.
243 Master Active Message
249 The master broadcasts this message to
260 A slave sends this message to the master in answer to a Master Active message.
261 This message is also sent when a new slave starts up to inform the master that
265 Master Candidature Message
271 A slave eligible to become a master broadcasts this message when its election
273 The message declares that the slave wishes to become the new master.
285 will control should it become the master.
300 Multiple Master Notification Message
306 When two or more masters reply to a Master Request message, the slave
307 uses this message to inform one of them that more than one master exists.
316 A master which has been informed of the existence of other masters
326 This message is sent by the master in three different contexts:
327 1) to a candidate that broadcasts a Master Candidature message,
328 2) to another master when notified of its existence,
329 3) to another master if a loop is detected.
341 when a super-user wants to set the network date.
342 If the local time daemon is the master, it will set the date;
343 if it is a slave, it will communicate the desired date to the master.
353 desired date to the master using this message.
362 The master sends this message to a slave in acknowledgment of a
366 master.
391 Master Site Message
398 where the master is running.
401 Remote Master Site Message
408 of the master.
432 All submasters forward this packet onto the networks over which they are master.
433 If a master receives a packet it sent out initially,
442 R. Gusella and S. Zatti, \fIClock Synchronization in a Local Area Network\fP,
446 \fIAn Election Algorithm for a Distributed Clock Synchronization Program\fP,