Table of Contents
Advertisement
15
PTP
15.1
Functional principle
Similar to NTP, PTP synchronization messages can also be exchanged between the
nodes involved. PTP defines the nodes involved as masters or slaves. NTP, on the other
hand, defines the nodes as servers and clients.
These messages consist of master sync, master follow-up, master delay response and
slave delay request. In addition, an algorithm is used to determine the best master in the
network, the so-called "Best Master Clock Algorithm" (BMCA). The clock determined by
the BMCA is also called a grandmaster clock and serves as a reference clock.
Several slaves can synchronize with a master in the network. For this purpose, the mas-
ter sends synchronization messages that the slaves use to correct their local clock. The
master and slave generate exact time stamps in order to determine the network latency,
which is required for the synchronization.
To calculate the slave offset, four time stamps are recorded between the master and
slave. These are usually called t
Figure 17: PTP time stamp (t
Two run-times are then calculated with these four time stamps. From the master to the
slave and from the slave to the master.
52
1
- t
)
1
4
���������������������� �������������������� = ��
���������������������� �������������������� = ��
MasterSlave difference + SlaveMaster difference
������ − �������� =
Manual
to t
; see Figure 17: PTP time stamp (t
4
2
Issue 1.4
- t
).
1
4
− ��
2
1
− ��
4
3
ibaClock
Advertisement
Table of Contents
