Primary root direct synchronization system for optimizing performance in shared media networks

By receiving and processing three sets of synchronization/sequential message pairs in a multi-node network, directly measuring the rate ratio of the master clock and the non-master clock, solving the problem of Pdelay measurement difficulties and achieving accurate clock synchronization and stability.

CN118921142APending Publication Date: 2024-11-08ANALOG DEVICES INT UNLTD CO
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410561448.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2024-05-07
Filing Date
2024-05-08
Publication Date
2024-11-08

AI Technical Summary

Technical Problem

In a multi-node network, it is difficult to accurately measure Pdelay values, resulting in incorrect neighbor rate ratio calculations, affecting clock synchronization.

Method used

By receiving three sets of synchronous/sequential message pairs, the rate ratio between the master and non-master clocks is directly measured, the midpoint value is calculated using inlet and outlet timestamp increments, the phase value of the master clock is fixed, and the PI controller is adjusted The non-master clock is synchronized.

Benefits of technology

Accurate clock synchronization in multi-node broadcast network is achieved, reducing the dependence of Pdelay measurements, and improving synchronization accuracy and stability.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118921142A_ABST
    Figure CN118921142A_ABST
Patent Text Reader

Abstract

The invention relates to a master root direct synchronization system for optimizing performance in a shared media network. A method of synchronizing a non-master clock with a master clock in a network is provided. These aspects include receiving first, second, and third pairs of information, each pair of information including synchronization information with an estimated time at which the synchronization information is transmitted and subsequent information with an actual time at which the synchronization information is transmitted. These aspects include, in response to a second pair of information, setting a neighbor rate ratio between the master clock and the non-master clock to a midpoint value of non-master clock control based on the ingress timestamp delta and the egress timestamp delta. These aspects include, in response to a third pair of information, fixing a phase value of the master clock by setting an expected master clock time value to a current timestamp of the master clock without modifying the midpoint value. These aspects include adjusting the non-master clock in response to at least the midpoint value.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] Priority citation

[0002] This application claims priority to U.S. Provisional Application No. 63 / 500,850, filed on May 8, 2023, and is hereby incorporated by reference in its entirety into this application. Technical Field

[0003] The present disclosure relates generally to networks and, more particularly, to a grandmaster direct synchronization system for optimizing performance in a shared media network. Background Art

[0004] 802.1 Active Standard (802.1AS), also known as the Institute of Electrical and Electronics Engineers (IEEE) 802.1AS-2020 standard or generalized Precision Time Protocol (gPTP), is a protocol designed to synchronize clocks within a network. 802.1AS is an extension of the Precision Time Protocol (PTP) defined in IEEE 1588. In gPTP, the synchronization process involves exchanging several types of messages, including Pdelay_Req, Pdelay_Resp, and Pdelay_Resp_Follow_Up, which are used to measure the propagation delay (Pdelay) on a link.

[0005] In point-to-point links, Pdelay measurements can be performed without problems because only two devices are involved and the propagation delay can be measured accurately.

[0006] However, in multi-point links such as multi-node networks, multiple devices share the same physical medium and the communication is broadcast-based. Therefore, accurately measuring Pdelay between two devices is challenging because multiple devices can receive and process Pdelay_Req and Pdelay_Resp messages. This makes it difficult to determine which device is the source of the Pdelay_Resp message and may result in the calculation of incorrect Pdelay values.

[0007] The neighbor rate ratio is calculated to compensate for the frequency drift between the master and non-master clocks. The ratio between two time intervals given by two different clocks. The first time interval is the time difference between the two frames transmitted by the sender, and the second time interval is the time difference between the two frames received by the receiver. Therefore, in order to evaluate the frequency drift between the sender and receiver clocks, these time intervals must be the same when there is no drift between the two clocks.

[0008] Since the neighbor rate ratio is calculated based on the Pdelay value, inaccurate Pdelay measurement will lead to incorrect neighbor rate ratio. The neighbor rate ratio is important for gPTP to perform clock synchronization. Summary of the invention

[0009] The following is a simplified summary of one or more aspects in order to provide a basic understanding of these aspects. The content of the present invention is not an extensive overview of all aspects considered, and is neither intended to identify the key or critical elements of all aspects, nor to delineate the scope of any or all aspects. Its sole purpose is to present some concepts of one or more aspects in a simplified form as a prelude to a more detailed description later.

[0010] According to various aspects of the present disclosure, a computer-implemented method is provided for synchronizing a non-master clock at a first node in a multi-node broadcast network to a master clock at a second node. The method includes receiving first, second, and third sync / subsequent (sync / subsequent) message pairs. Each sync / subsequent message pair includes a sync message having an estimated time at which the sync message is sent and a subsequent message having an actual time at which the sync message is sent. The method also includes, in response to the second sync / subsequent message pair, setting a neighbor rate ratio between the master clock and the non-master clock to a midpoint value controlled by the non-master clock based on an inlet timestamp increment and an outlet timestamp increment. The method also includes, in response to the third sync / subsequent message pair, fixing the phase value of the master clock by setting the expected master clock time value to the current timestamp of the master clock without modifying the midpoint value. The method also includes adjusting the master clock to synchronize with the non-master clock in response to at least the midpoint value being set to the neighbor rate ratio.

[0011] According to other aspects of the present disclosure, a system for synchronizing a non-master clock at a first node in a multi-node broadcast network to a master clock at a second node is provided. The system includes a synchronization processor having a frame receiver, the frame receiver being configured to receive frames from a master clock and a non-master clock, and generating first, second, and third sync / subsequent (sync / subsequent) message pairs. Each sync / subsequent message pair includes a sync message having an estimated time at which the sync message is sent and a subsequent message having an actual time at which the sync message is sent. The synchronization processor is further configured to set the neighbor rate ratio between the master clock and the non-master clock to a midpoint value controlled by the non-master clock based on an inlet timestamp increment and an outlet timestamp increment in response to the second sync / subsequent message pair. The synchronization processor is also configured to fix the phase value of the master clock by setting the expected master clock time value to the current timestamp of the master clock without modifying the midpoint value in response to the third sync / subsequent message pair. The system also includes a pi controller configured to adjust the master clock to synchronize with the non-master clock in response to at least the midpoint value being set to the neighbor rate ratio.

[0012] To accomplish the above and related ends, the one or more aspects comprise the features fully described and particularly pointed out in the following claims. The following description and the accompanying drawings set forth in detail certain illustrative features of the one or more aspects described above. However, these features are indicative of only a few of the various ways in which the principles of the various aspects may be employed, and this description is intended to include all such aspects and their equivalents. BRIEF DESCRIPTION OF THE DRAWINGS

[0013] The following will be attached Figure 1 The disclosed aspects are described together with the accompanying drawings, wherein like names represent like elements, wherein dashed lines may represent optional elements, and wherein:

[0014] Figure 1 An exemplary multi-node network having a master clock and at least one non-master clock synchronized with the master clock according to an exemplary aspect.

[0015] Figure 2 is another example multi-node network having a master clock and at least one non-master clock synchronized with the master clock according to an example aspect.

[0016] Figure 3 is an example synchronization (sync) processor according to example aspects.

[0017] Figure 4 is a sample package based on example aspects.

[0018] Figure 5 A customized version of the generic Precision Time Protocol (gPTP) developed for Ethernet to the Edge Bus (E2B) based on example aspects that does not support latency measurement and includes a custom rate ratio algorithm.

[0019] Figure 6-8

[0013] Synchronizing a non-master clock at a first node to a master clock at a second node in a multi-node broadcast network according to example aspects. DETAILED DESCRIPTION

[0020] The present disclosure relates to a taproot direct synchronization system for optimizing performance in a shared media network.

[0021] In one aspect, the present disclosure uses three sync / follow-up (sync / follow-up) message pairs to achieve synchronization between a master clock (also known as a master root clock) located at one node of a multi-node network and a local clock (also known as a non-master clock) located at another node of the multi-node network. Each sync / follow-up message pair includes a sync message having an estimated time at which the sync message is sent and a follow-up message having an actual time at which the sync message is sent. The first two sync / follow-up message pairs are received by a synchronization processor for directly calculating a neighbor rate ratio between a master clock located at one node of the multi-node network and a non-master clock located at another node. The calculated neighbor rate ratio is then provided to a proportional integral (pi) controller to control the frequency and / or phase of the non-master clock, thereby synchronizing the non-master clock with the master clock.

[0022] In one aspect, the present disclosure includes directly measuring the neighbor rate ratio between the master clock and the non-master clock when receiving the second sync / track pair. During this time, the local timer is set to the midpoint to measure the precise clock ratio between the master clock and the local clock. This process can be configured to average multiple sync / track pairs to improve accuracy. After the neighbor rate ratio is calculated, the neighbor rate ratio is used to replace the current midpoint in the local timer, and the third pair received sets the initial lock general precision time protocol (gPTP) time.

[0023] In 10Base-T1S, it is not possible to measure the neighbor rate ratio between the local clock and the neighbor device as dictated by the 802.1AS specification. Therefore, the present disclosure includes an algorithm that calculates the rate ratio and produces accurate measurements in three sync / track pairs.

[0024] After the initial sync / track pair, the entry and exit deltas cannot be calculated until the second pair is received. Once syncEgressTimestampDelta and syncIngressTimestampDelta contain value data, the midpoint value of the proportional-integral (pi) controller can be calculated. The nominal midpoint of the timer is currently set to 0xA0000000. In other respects, other values ​​(besides 0xA0000000) may be used.

[0025] Since it is difficult to fix both the phase and frequency of the timer without resorting to complex calculations, the apparatus and method sets the frequency (speed) to the calculated addend_midpoint and the phase (current timer timestamp) to the desired primary root time to minimize the error. However, this may result in an initial phase inaccuracy that worsens as the time difference between the sync message and subsequent messages increases.

[0026] On the third pair, the present apparatus and method assumes that the measurement error is entirely due to phase error and adjusts the time value without modifying addend_midpoint. After this final update, the pi controller can begin fine-tuning the error at the reception of each sync / subsequent pair.

[0027] On the other hand, the third pair is not used and the phase of the non-master clock is calculated mathematically.

[0028] The present disclosure includes devices and methods configured to bypass Pdelay measurements to lock directly to a primary root controller, and functionality to avoid additional mathematical logic by performing a three-step synchronization, where the rate ratio frequency is first fixed, and upon receiving the third synchronization / subsequently, the phase is fixed.

[0029] In other words, the apparatus and method solves problems encountered by existing solutions by directly measuring the rate ratio between the primary root and the endpoint when receiving the second sync / subsequent pair. During this time, the local timer is set to the midpoint so that the exact clock ratio between the gm and the local clock or xtal can be measured. This process can be configured to average multiple pairs for increased accuracy. After the rate ratio is calculated, it replaces the current midpoint in the local timer and receiving the third pair will set the initial lock gPTP time.

[0030] In some implementations, the current devices and methods skip the Pdelay measurement and directly measure the rate ratio to the primary root, reducing the number of messages that need to be transmitted in the bus compared to previous solutions, which is particularly good for base10-t1 because the bandwidth is only 10Mbps. It is important to note that base10-t1 is also a shared medium. Therefore, having a large number of messages periodically in the network mainly affects latency.

[0031] refer to Figure 1 , according to an example aspect, an example multi-node network 100 is shown having a master clock and at least one non-master clock synchronized with the master clock.

[0032] The multi-node network 100 includes nodes 110 , 120 , 130 , 140 , 150 , 160 , 170 , each of which represents a different node in the multi-node network 100 .

[0033] In one aspect, the multi-node network 100 includes a first network node 110 and a second network node 120, as well as other network nodes 130, 140, 150, 160, 170, which may also perform processing similar to the second network node 120 described herein.

[0034] The first network node 110 comprises a master clock 111 , also referred to as a master grandmaster clock.

[0035] The second network node 120 includes a non-master clock 121, also referred to as a non-master root clock, which is configured to be synchronized with the master clock 111 included in the first network node 110. As used herein, "configured to be synchronized with the master clock" refers to the process of adjusting clock parameters including but not limited to the frequency and / or phase of the non-master clock to correspond to the frequency and / or phase of the master clock, i.e., adjusting the non-master clock frequency and / or phase to minimize the error between the non-master clock frequency and / or phase and the master clock frequency and / or phase.

[0036] The other network nodes 130 , 140 , 150 , 160 , 170 comprise respective non-master clocks 131 , 141 , 151 , 161 , 171 which are configured to synchronize with the master clock comprised in the first network node 110 .

[0037] Synchronization of the second network node 120, and optionally any other network nodes 130, 140, 150, 160, 170 with the master clock 111 may be achieved using the three-sync (sync) / subsequent message pair method disclosed herein.

[0038] In one aspect, the multi-node network 100 uses generalized precision time protocol (gPTP) time. In one aspect, a proportional integral (pi) controller is used to adjust the parameters (e.g., frequency and / or phase) of the non-master clocks 111, 121, 131, 141, 151, 161, 171 to match the master clock, thereby synchronizing with the master clock. In another aspect, other time protocols and controller types can be used.

[0039] In one aspect, other devices may be included in each of the network nodes 110, 120, 130, 140, 150, 160, 170, such as complete and / or partial subsystems, hardware, controllers, peripherals (keyboards, keyboards, mice, trackballs, gesture recognition systems, eye tracking systems, automatic speech recognition (ASR) systems, motors, lights, speakers, displays, etc.), etc.

[0040] refer to Figure 2 , according to an example aspect, another example multi-node network 200 is shown having a master clock and at least one non-master clock synchronized with the master clock. The multi-node network 200 includes network nodes 210, 220, 230, 240, 250, 260, 270, wherein each network node represents a different network node in the multi-node network 200. In one aspect, the nodes 210-270 are remote from each other.

[0041] The multi-node network 200 can be installed on and correspond to a vehicle 299. For example, a master control unit (MCU) network node 210 with a master clock 211 can be the master controller of the vehicle 299, and a group of network nodes 101 (including network nodes 220, 230, 230, 240, 250, 260, 270) can correspond to vehicle systems such as steering 220, acceleration 230, braking 240, stability 250, audio (telephone, music, etc.) 260, lighting 270, etc., and have corresponding non-master clocks 221, 231, 241, 251, 261, 271, all synchronized with the master clock.

[0042] Therefore, network nodes 220, 230, 240, 250, 260, 270 are remote from MCU network node 210 and can be local nodes of one or more vehicle subsystems. However, it should be understood that various aspects of the present disclosure are not limited to vehicles and can be applied to any type of system with a multi-node network, which includes a master clock at one network node and at least one non-master clock at another network node, wherein the non-master clock is configured to be synchronized with the master clock. Examples of other projects to which the present disclosure can be applied include, but are not limited to, robotic systems, monitoring systems, facility access systems, building management systems (BMS), etc. For example, in the case of a robotic system, a network node can represent a motor for controlling movement, an arm of a robot, a sensor (motion, speed, etc.), and the like.

[0043] Each MCU network node 210 and / or network nodes 220, 230, 240, 250, 260, 270 may include one or more memories 1X1 with instructions, either alone or in combination (i.e., MCU network node 210 includes one or more memories 212, network node 220 includes one or more memories 222, network node 230 includes one or more memories 232, network node 240 includes one or more memories 242, and so on). Each of the MCU 210 network node and / or network node 201 may include one or more processors 1Y2 (i.e., MCU network node 210 includes one or more processors 213, network node 220 includes one or more processors 223, network node 230 includes one or more processors 233, network node 240 includes one or more processors 243, and so on). Where Y is an integer equal to or greater than 1, each coupled to at least one of the one or more 1X1 memories, and configurable to execute instructions. In various aspects, the MCU network node 210 is hierarchically superior to one or more processors 213, 223, and 233, and provides instructions to one or more processors 213, 223, and 233. In various aspects, only the MCU network node 210 includes one or more memories and one or more processors, and provides signals for controlling network nodes 220, 230, 240, 250, 260, 270. In other aspects, the MCU network node 210 and one or more but not more than all of the network nodes 220, 230, 240, 250, 260, 270 include one or more memories and one or more processors, wherein the MCU network node 210 provides signals for controlling at least some of the network nodes 220, 230, 240, 250, 260, 270.

[0044] As used herein, a processor, at least one processor, and / or one or more processors configured to perform or operable to perform multiple actions, either individually or in combination, means at least two different processors capable of performing different, overlapping, or non-overlapping subsets of multiple actions, or a single processor capable of performing all multiple actions. In a non-illustrative example of multiple processors in which multiple processors are capable of performing different actions in combination, a description of a processor, at least one processor, and / or one or more processors configured or operable to perform operations X, Y, and Z includes at least a first processor configured or operable to perform a first subset of X, Y, and Z (e.g., perform X) and a second processor configured or operable to perform a second subset of X, Y, and Z (e.g., perform Y and Z). Alternatively, the first processor, the second processor, and the third processor may be configured or operable to perform each of the actions X, Y, and Z, respectively. It should be understood that any combination of one or more processors may be configured or operable to perform any one or any combination of multiple actions.

[0045] In various aspects, the MCU network node 210 and / or the network node 201 may include one or more peripheral devices 1X4 (i.e., the MCU network node 210 includes the peripheral device 214, the network node 220 includes the peripheral device 224, the network node 230 includes the peripheral device 234, the network node 140 includes the peripheral device 244, etc.). For example, the MCU network node 210 may include one or more input devices as the peripheral device 214. As a further example, the network node 101 may include one or more motors, lights, speakers, displays, etc. as the peripheral devices 224, 234 and / or 244.

[0046] The MCU network node 210 is connected to the network nodes 220, 230, 240, 250, 260, 270 via one or more wires 299. For example, but not limited to, any of the following cable types may be used: coaxial; twisted pair; and fiber optic cabling. In current local area networks, twisted pair cabling is the most popular type of cabling, but the use of fiber optic cabling is increasing, especially in high-performance networks.

[0047] refer to Figure 3 According to an example aspect, an example synchronization (synchronization) processor 300 is provided.

[0048] The synchronization processor 300 includes a frame processor 310 for processing input frames to extract timing information (time stamp, etc.) therefrom.

[0049] The synchronization processor 300 includes one or more processors (eg, processor 211), which are configured to output the following signals based on the input frame: time error; syncEventEgressDelta; syncEventIngressDelta; primary domain / backup domain. The calculation methods of these signals are as follows.

[0050] The sync processor 300 will decode the synchronization information of two simultaneous clocks operating in two different domains as long as they share the same time base. The state machine that calculates the syncEventEgresTimestamp data will be modeled using a simplified state machine. In one aspect, the difference between the time the sync message is received by the module (syncEventIngressTimestamp) and the local clock calculated at the GM (called syncEventEgresTimestamp) is calculated. Note that when pdelay is disabled, a register map field meanLinkDelay can be added to syncEventEgresTimestamp to account for the cable delay between the endpoint and the first connected node.

[0051] syncEventEgresTimestamp calculation

[0052] One-step mode

[0053] The syncEventEgresTimestamp of the PTP instance that sends the synchronization message is the sum of the correctionField field and the originTimestamp field of the synchronization message.

[0054] Two-step mode

[0055] The syncEventEgresTimestamp of the PTP instance sending the Sync / FollowUp message is the sum of the correctionField in the FollowUp message and the associated Sync message, plus the preciseOriginTimestamp field of the FollowUp message.

[0056] The Time Error field contains the difference between the calculated Sync Event Exit Timestamp and the Sync Event Entry Timestamp captured when the corresponding Sync Message was received using the local timer.

[0057] timeError(x)=syncEventEgressTimestamp(x)+linkMeanDela-syncEventIgressTimestamp(x)

[0058] The exit delta corresponds to the time difference between the last calculated sync event exit timestamps.

[0059] syncEventEgressDelta(x)=syncEventEgressTimestamp(x)-syncEventEgressTimestamp(x-1)

[0060] The entry delta corresponds to the time difference of the synchronization clock between the last received synchronization messages.

[0061] syncEventIngressDelta(x)=syncEventIngressTimestamp(x)-syncEventIngressTimestamp(x-1)

[0062] Reference Figure 4 , an example package 400 is shown according to example aspects.

[0063] The data packet 400 includes a header 410, an original timestamp, and a time length value (TLV) of a subsequent message. The original timestamp and / or the subsequent message can be used in any synchronization message and subsequent message. For example, in one aspect, the original timestamp can be used in the synchronization message as an estimated time when the synchronization message is sent, and the precision timestamp in the subsequent message can be used for the actual time when the synchronization message is sent.

[0064] refer to Figure 5 , in terms of examples, a customized version of the gPTP 500 example developed for E2B is shown that does not support Pdelay measurement and includes a custom rate ratio algorithm.

[0065] The customized version of gPTP 500 includes a synchronization processor 300, a redundancy selector 510, a multiplexer 520, a rate ratio algorithm 530, and a pi controller 540.

[0066] The operation of the synchronization processor 300 is as described above. The redundancy selector 510 is configured to receive the output of the synchronization processor 300 and select appropriate messages for transmission, so as to transmit the first, second and third message pairs.

[0067] The multiplexer 520 is configured to output a first sync / subsequent message pair 521 , a second sync / subsequent message pair 522 , and a third sync / subsequent message pair 523 in response to a signal from the redundancy selector 510 .

[0068] The rate ratio algorithm 530 is configured to calculate a rate ratio between a master clock and a non-master clock.

[0069] The pi controller 540 is configured to adjust the non-master clock 121 in response to using the rate ratio as a midpoint for clock control as described herein.

[0070] refer to Figure 6-8 , an example method 600 is shown for synchronizing a non-master clock at a first node in a multi-node broadcast network to a master clock at a second node according to an example aspect. For example, the actions of method 600 can be performed by one or any combination of respective one or more processors 213 and 223, for example, based on stored instructions including instructions for rate ratios in one or any combination of respective one or more memories 212 and 222. It should be understood that although method 600 is described with respect to communication between an MCU network node 110 and a network node 120, method 600 can be applied to the MCU network node 110 and any other node 130 and / or 140 and / or 150 and / or 160 and / or 170. In one aspect, method 600 can be performed by system 500, wherein synchronization processor 300 represents processor 223

[0071] At block 605, the method 600 includes receiving a first 521, a second 522, and a third sync / subsequent message pair 523. Each sync / subsequent message pair 521, 522, 523 includes a sync message having an estimated time at which the sync message was sent and a subsequent message having an actual time at which the sync message was sent. These estimated times and actual times may be times indicated in the original timestamps or times derived from the original timestamps.

[0072] At block 610 , method 600 includes, in response to the second sync / follow-up message pair 522 , setting a neighbor rate ratio between master clock 111 and non-master clock 211 to a midpoint value for non-master clock control based on the ingress timestamp increment and the egress timestamp increment.

[0073] The ingress timestamp increment and egress timestamp increment are calculated as follows:

[0074] syncEventEgressDelta(x)=syncEventEgressTimestamp(x)-syncEventEgressTimestamp(x-1); and

[0075] syncEventIngressDelta(x)=syncEventIngressTimestamp(x)-syncEventIngressTimestamp(x-1).

[0076] addend_midpoint is calculated as follows:

[0077] addend_midpoint=(syncEgressTimestampDelta*nominal) / midpointsyncIngressTimestampDelta.

[0078] The neighbor rate ratio is set to addend_midpoint.

[0079] At block 615 , the method 600 includes, in response to the third sync / follow-up message pair 523 , fixing the phase value of the master clock 111 by setting the expected master clock time value to the current timestamp of the master clock 111 without modifying the midpoint value (addend_midpoint).

[0080] At block 620 , the method 600 includes adjusting synchronization of the non-master clock 121 with the master clock 111 in response to at least the midpoint value.

[0081] refer to Figure 7-8 , further steps of a method 600 for synchronizing a non-master clock 121 at a first node 120 to a master clock 111 at a second node 110 in a multi-node broadcast network 100 are shown according to example aspects.

[0082] At block 705, the method 600 includes, in response to the first sync / follow-up message 521 pair, fixing the rate to frequency to a predetermined value. In one aspect, the predetermined value may be a MAC address as described above.

[0083] At block 710, method 600 includes fixing the rate ratio to a predetermined value that is independent of the respective master clock timestamp and the respective non-master clock timestamp of the first sync / subsequent message pair 521. The nominal midpoint is currently set to 0xA0000000, but other values ​​may be used.

[0084] In one aspect, block 710 may include block 710A.

[0085] At block 710A, the method 600 includes calculating a rate ratio based on an average value determined from respective master clock timestamps and respective non-master timestamps of the first sync / subsequent message pair 521 and the second sync message pair 522 .

[0086] At block 715, method 600 includes adding the egress timestamp increment to the nominal midpoint to obtain a sum, and dividing the sum by the ingress timestamp increment. The calculation method of addend_midpoint may be as follows:

[0087] addend_midpoint=(syncEgressTimestampDelta*nominal) / midpointsyncIngressTimestampDelta

[0088] At block 720, the method 600 includes calculating the egress timestamp as the sum of the corrected field and the original timestamp field of the second sync / follow-up message pair 522. Thus, the values ​​of these fields are simply summed.

[0089] At block 725, the method 600 includes calculating the egress timestamp as the sum of the corrected fields of the first 521 and second sync / subsequent message pairs 522, and the original timestamp field of the second sync / subsequent message pair 522. Thus, the values ​​of these fields are simply summed.

[0090] At block 730, method 600 includes selectively calculating, in response to the value of the flag, an exit timestamp as: the sum of a correction field and an original timestamp field of the second synchronization / subsequent synchronization message pair 52, or the sum of multiple correction fields of multiple pairs of first 521 and second synchronization / subsequent message pairs 522 and the original timestamp field of the second synchronization / subsequent message pair 522.

[0091] At block 735 , the method 600 includes disabling the Pdelay data when synchronizing the non-master clock to the master clock.

[0092] In one aspect, block 730 may include block 730A.

[0093] At block 735A, method 600 includes adding an average link delay field to the egress timestamp to account for a cable delay between a node containing a master clock and another node containing a non-master clock.

[0094] In one aspect, block 735A may include block 735A1.

[0095] At block 735A1 , method 600 includes calculating a time error between the master clock and the non-master clock based on a sum of the value of the egress timestamp and the value of the average link delay field minus the value of the ingress timestamp.

[0096] At block 740 , the method 600 includes generating, by the sync processor 300 having the frame receiver 310 configured to receive frames from the master clock 111 and the non-master clock 121 , the first 521 , second 522 , and third sync / subsequent message pairs 523 .

[0097] At block 745, the method 600 includes providing the first sync / subsequent message pair 521 and the second sync / subsequent message pair 522 to the neighbor rate ratio algorithm 530, and providing the third sync / subsequent message pair 523 to the pi controller 540 configured to control the non-master clock phase.

[0098] Architecture

[0099] The IEEE 802.1AS-2021 standard, also known as the generalized Precision Time Protocol (gPTP), is a protocol for achieving network precise time synchronization for Ethernet networks. The protocol is an evolution of the original Precision Time Protocol (PTP), which was designed for local area networks (LANs) and has now been extended to support wide area networks (WANs). gPTP provides several key features such as transparent clocks, boundary clocks, and time-aware bridging that can help network operators achieve high levels of time accuracy, reliability, and interoperability. For E2B, a customized version of gPTP can be implemented that does not support Pdelay measurements but includes a customized ratio algorithm.

[0100] Rate Ratio Algorithm

[0101] In T1S, it is not possible to measure the neighbor rate ratio between the local clock and the neighbor device as dictated by the 802.1AS specification. Therefore, a custom algorithm is provided to calculate the rate ratio directly to the primary root and produce accurate measurements across three sync / follow pairs.

[0102] After the initial sync / subsequent pair, delta cannot be calculated until the second pair is received. Once syncEgressTimestampDelta and syncIngressTimestampDelta contain value data, the addend_midpoint value for the pi controller can be calculated. The nominal midpoint is currently set to 0xA0000000. Otherwise, addend_midpoint may be calculated as follows:

[0103] addend_midpoint=(syncEgressTimestampDelta*nominal) / midpointsyncIngressTimestampDelta

[0104] The addend_midpoint value of the pi controller is the configuration value of the 1588 timer under PTP. The addend_midpoint value represents the nominal frequency of the timer. After reset, addend_midpoint is set to 0xA0000000, but this is setting an incorrect frequency. Therefore, after calculation, a frequency is chosen that is closer to the expected frequency of the pi cycle value 0. Afterwards, it is left to the pi controller to correct any error remaining from the initial calculation.

[0105] Since it is difficult to fix both the phase and frequency of the timer without resorting to complex calculations, the present disclosure chooses to set the frequency (speed) to the calculated addend_midpoint and the phase (current timer timestamp) to the expected main root time to minimize the area. However, this results in an inaccurate initial phase, which worsens as the time difference between the synchronization message and subsequent messages increases. On the third pair, the present disclosure assumes that the measurement error is entirely due to phase error and adjusts the time value without modifying addend_midpoint. After this final update, the pi controller can begin to fine-tune the error at each pair of receivers.

[0106] Proportional-Integral Controller

[0107] The timer tracks the time error between the primary root syncEgressTimestamp and the local clock syncIngressTimestamp, which was previously calculated as time_error using the pi controller.

[0108] The coefficients of the controller need to be tuned for the current sync interval to maintain the same sync characteristics. The two most common intervals are 31.25 and 125ms, so the user will be able to program the coefficients for these two intervals directly through the register map. For any other interval, the block will automatically scale for 31.25ms. Interval values ​​from 0 (1 second) to -5 (31.25 milliseconds) will be supported. Other interval values ​​will be supported if possible. The pi controller will lock up if the time_error signal (syncIgressTimestamp - syncEgressTimestamp) is less than a configurable value in the register map (in nanoseconds). The user will need to adjust the threshold based on their system characteristics. The value will be set to 80ns*(num_nodes)*2. Tsystem will default to 7 nodes, which is 1100us. The system will unlock at any point where the previous condition is not met on the same pair of processing steps. However, the system will only lock up after the condition has been met a configurable number of times, which defaults to 1. The exception is the first time the previous condition is met after startup, at which point the signal will be set to lock on the first pair regardless of the previous configuration. To speed up the lock time, the user can configure a different set of coefficients for the first configurable number of frames after startup. These coefficients can be tuned to offer speed over accuracy.

[0109] Algorithm restart

[0110] In a nominal system, the adaptation loop will track the error and try to correct it bit by bit, and the initial rate ratio adi algorithm will never run again. However, if the measured time error is too large, the apparatus and method of the present disclosure will understand that something serious has happened, such as a change in GM, and will restart the adaptation as if it came from startup. This is not something that is desired to happen because it will produce a discontinuity in the timer output. This function will only be executed if the measured time_error signal is greater than the relock threshold set in nanoseconds in the register map. The default relock threshold will default to 50 seconds.

[0111] 802.1 modules are components of networked systems that require precise timing and synchronization. In the context of the IEEE 802.1 protocol, the module provides a comprehensive set of tools to ensure that the module's clock is synchronized with the rest of the network and that time-sensitive applications operate correctly even in the face of hardware or software failures.

[0112] Another feature of the 802.1 module is the PI (Proportional Integral) controller, which is used to maintain synchronization between the node's local clock and the master root clock. The PI controller works by comparing the current time of the local clock with the time received from the master root and adjusting the frequency of the local clock accordingly. There are two parts to the PI controller: the P (Proportional) part and the I (Integral) part. The P section is responsible for adjusting the frequency of the clock based on the current error between the local time and the master root time, while the I section is responsible for reducing the long-term error by accumulating the error over time. In order to configure the PI controller and achieve the best performance of the PI controller, the 802.1 module provides fast and slow coefficients for the P and I sections of the controller. The fast coefficient is used at the beginning of the synchronization process to provide a fast response to sudden changes in error, while the slow coefficient is used for slower adjustments to provide better long-term stability. To ensure that the PI controller responds appropriately to changes in synchronization, the module provides a field for setting the number of frames in which the selected coefficient will use the fast coefficient, called num_fast_adjust_frames. By using the fast and slow coefficients and carefully choosing appropriate values, the 802.1 module can achieve both fast and accurate synchronization and good long-term stability.

[0113] Additionally, the 802.1 module is designed to support multi-point networks. In such networks, it is not possible to measure latency, which is typically used to measure the propagation delay between two clocks. To overcome this limitation, the module uses a custom rate ratio algorithm that estimates the propagation delay based on the frequency difference between the primary root and the local clock. The algorithm works by calculating the ratio of the frequency of the primary root clock to the frequency of the local clock and adjusting the local clock accordingly. By using this approach, the module can achieve accurate synchronization even in complex network topologies where Pdelay measurements are not possible.

[0114] Overall, the 802.1 module provides a comprehensive set of tools for managing clock synchronization in complex network systems. Its capabilities include managing lock flags, configuring PI controllers, supporting redundancy, and monitoring the synchronization process, and can be used in any time-sensitive application. It supports multi-point networks and custom rate ratio algorithms, ensuring accurate synchronization even in challenging network topologies where Pdelay measurements are not possible.

[0115] These and other variations of the present disclosure will be readily contemplated by those of ordinary skill in the art in view of the teachings of the present disclosure provided herein.

[0116] Aspects of the present disclosure include one or any combination of the following clauses.

[0117] Clause 1. A method for synchronizing a non-master clock at a first node to a master clock at a second node in a multi-node broadcast network, the method comprising: receiving first, second and third synchronization / subsequent message pairs, each synchronization / subsequent message pair including a synchronization message having an estimated time at which the synchronization message is sent and a subsequent message having an actual time at which the synchronization message is sent, wherein the method further comprises: in response to the second synchronization / subsequent message pair, setting the neighbor rate ratio between the master clock and the non-master clock to a midpoint value controlled by the non-master clock based on an inlet timestamp increment and an outlet timestamp increment; in response to the third synchronization / subsequent message pair, fixing the phase value of the master clock by setting the expected master clock time value to the current timestamp of the master clock without modifying the midpoint value; and synchronizing the non-master clock with the master clock in response to at least the midpoint value.

[0118] Clause 2. A method according to clause 1, wherein the method further comprises fixing the rate-to-frequency to a predetermined value in response to a first sync / subsequent message pair.

[0119] Clause 3. A method according to any of the above clauses, further comprising fixing the rate ratio to a predetermined value within a given interval independent of the corresponding master clock timestamp and the corresponding non-master clock timestamp of the first synchronization / subsequent message pair.

[0120] Clause 4. A method according to any of the preceding clauses, wherein the rate ratio is calculated based on an average value determined from the corresponding master clock timestamps and the corresponding non-master timestamps of the first sync / subsequent message pair and the second sync message pair.

[0121] Clause 5. A method according to any of the above clauses, further comprising adding the egress timestamp increment to the nominal midpoint to obtain a sum, and dividing the sum by the ingress timestamp increment.

[0122] Clause 6. A method according to any of the above clauses, further comprising calculating the egress timestamp as the sum of a correction field and an original timestamp field of the second sync / subsequent message pair.

[0123] Clause 7. A method according to any of the above clauses, further comprising calculating the egress timestamp as the sum of multiple corrected fields of multiple pairs of first and second sync / subsequent message pairs, and an original timestamp field of the second sync / subsequent message pair.

[0124] Clause 8. The method according to any of the above clauses further includes selectively calculating the exit timestamp in response to a flag value as: the sum of a correction field and an original timestamp field of a second synchronization / subsequent synchronization message pair, or the sum of multiple correction fields of multiple pairs of first and second synchronization / subsequent synchronization message pairs and the original timestamp field of the second synchronization / subsequent synchronization message pair.

[0125] Clause 9. A method according to any of the preceding clauses, further comprising disabling Pdelay data when synchronizing a non-master clock to a master clock.

[0126] Clause 10. A method according to any of the preceding clauses, further comprising adding an average link delay field to the egress timestamp to compensate for a cable delay between a node containing a master clock and another node containing a non-master clock.

[0127] Clause 11. A method according to any of the above clauses, further comprising calculating a time error between the master clock and the non-master clock based on the sum of the value of the egress timestamp and the value of the link delay field minus the value of the ingress timestamp.

[0128] Clause 12. A method according to any of the preceding clauses, further comprising generating first, second and third sync / subsequent message pairs by a sync processor having a frame receiver configured to receive frames from a master clock and a non-master clock.

[0129] Clause 13. The method according to any of the above clauses further comprises: providing a first synchronization / subsequent message pair and a second synchronization / subsequent message pair to an adjacent rate ratio algorithm; and providing a third synchronization / subsequent message pair to a pi controller configured to control a non-master clock phase.

[0130] Clause 14. A system for synchronizing a non-master clock of a first node in a multi-node broadcast network to a master clock of a second node, the system comprising: a synchronization processor, whose frame receiver is configured to receive frames from a master clock and a non-master clock, and generate first, second and third synchronization / subsequent message pairs, each synchronization / subsequent message pair including a synchronization message having an estimated time at which the synchronization message is sent and a subsequent message having an actual time at which the synchronization message is sent, wherein the synchronization processor is further configured to: in response to the second synchronization / subsequent message pair, set the neighbor rate ratio between the master clock and the non-master clock to a midpoint value for non-master clock control based on an inlet timestamp increment and an outlet timestamp increment; in response to the third synchronization / subsequent message pair, fix the phase value of the master clock by setting the expected master clock time value to the current timestamp of the master clock without modifying the midpoint value; and a pi controller configured to adjust the non-master clock to synchronize with the master clock in response to at least the midpoint value.

[0131] Clause 15. A system according to clause 14, wherein the synchronization processor fixes the rate ratio frequency to a predetermined value in response to the first sync / subsequent message pair.

[0132] Clause 16. A system according to any of the preceding clauses, wherein the rate ratio is fixed to a predetermined value within a given interval independent of the corresponding master clock timestamp and the corresponding non-master clock timestamp of the first sync / subsequent message pair.

[0133] Clause 17. A system according to any of the preceding clauses, wherein the rate ratio is calculated based on an average value determined from respective master clock timestamps and respective non-master timestamps of both the first sync / subsequent message pair and the second sync / subsequent message pair.

[0134] Clause 18. A system according to any of the above clauses, further comprising adding the egress timestamp increment to the nominal midpoint to obtain a sum, and dividing the sum by the ingress timestamp increment.

[0135] Clause 19. A system according to any of the preceding clauses, further comprising calculating an egress timestamp as the sum of a correction field and an original timestamp field of a second sync / subsequent message pair.

[0136] Clause 20. A system according to any of the above clauses, further comprising calculating an egress timestamp as a sum of a plurality of corrected fields of a plurality of pairs of first and second sync / subsequent message pairs and an original timestamp field of the second sync / subsequent message pair.

[0137] Clause 21. A system according to any of the above clauses, further comprising selectively calculating the exit timestamp in response to a flag value as: the sum of a correction field and an original timestamp field of a second synchronization / subsequent message pair, or the sum of multiple correction fields of multiple pairs of first and second synchronization / subsequent message pairs and the original timestamp field of the second synchronization / subsequent message pair.

[0138] Clause 22. A system according to any of the above clauses, further comprising disabling Pdelay data when synchronizing a non-master clock to a master clock.

[0139] Clause 23. A system according to any of the above clauses, further comprising adding an average link delay field in the egress timestamp to compensate for cable delay between a node containing a master clock and another node containing a non-master clock.

[0140] Clause 24. A system according to any of the above clauses, further comprising calculating a time error between the master clock and the non-master clock based on the sum of the value of the egress timestamp and the value of the link delay field minus the value of the ingress timestamp.

[0141] Clause 25. A system according to any of the preceding clauses, further comprising generating the first, second and third sync / subsequent message pairs by a sync processor having a frame receiver configured to receive frames from the master clock and the non-master clock.

[0142] Clause 26. A system according to any of the above clauses, further comprising: providing a first synchronization / subsequent message pair and a second synchronization / subsequent message pair to an adjacent rate ratio algorithm; and providing a third synchronization / subsequent message pair to a pi controller configured to control a non-master clock phase.

[0143] Various aspects of the present disclosure may be implemented as systems, methods and / or computer program products at any possible level of integration technical detail. The computer program product may include a computer-readable storage medium (or media) having computer-readable program instructions for causing a processor to execute various aspects of the present disclosure.

[0144] A computer-readable storage medium may be a tangible device that can retain and store instructions for use by an instruction execution device. A computer-readable storage medium may be, for example but not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination thereof. A non-exhaustive list of more specific examples of computer-readable storage media includes the following: a portable computer floppy disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a static random access memory (SRAM), a portable compact disk read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanical encoding device having instructions recorded thereon, and any suitable combination of the above devices. The computer-readable storage medium used herein should not be interpreted as a transient signal itself, such as a radio wave or other freely propagating electromagnetic wave, an electromagnetic wave propagated through a waveguide or other transmission medium (e.g., a light pulse through a fiber optic cable), or an electrical signal transmitted through a wire.

[0145] The computer-readable program instructions described herein can be downloaded from a computer-readable storage medium to a respective computing / processing device, or downloaded to an external computer or external storage device via a network, such as the Internet, a local area network, a wide area network, and / or a wireless network. The network may include copper transmission cables, optical transmission fibers, wireless transmissions, routers, firewalls, switches, gateway computers, and / or edge servers. The network adapter card or network interface in each computing / processing device receives the computer-readable program instructions from the network and forwards the computer-readable program instructions to be stored in a computer-readable storage medium in the respective computing / processing device.

[0146] Computer readable program instructions for performing operations of the present disclosure may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages, including object-oriented programming languages ​​and conventional procedural programming languages.

[0147] Various aspects of the present disclosure are described herein with reference to flowchart illustrations and / or block diagrams of methods, devices (systems) and computer program products. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer-readable program instructions.

[0148] These computer-readable program instructions may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device to produce a machine, so that the instructions executed by the computer processor or other programmable data processing device may create a method for implementing the functions / behaviors specified in the flowchart and / or block diagram blocks. These computer-readable program instructions may also be stored in a computer-readable storage medium, which may instruct a computer, a programmable data processing device, and / or other device to operate in a specific manner, so that the computer-readable storage medium having instructions stored therein includes an article of manufacture including instructions for implementing the functions / behaviors specified in the flowchart and / or block diagram blocks.

[0149] Computer-readable program instructions may also be loaded onto a computer, other programmable data processing device, or other device to cause a series of operational steps to be performed on the computer, other programmable device, or other device to produce a computer-implemented process, so that the instructions executed on the computer, other programmable device, or other device implement the functions / behaviors specified in the flowchart and / or block diagram blocks.

[0150] In various aspects, a computer-implemented method and a computer program product configured to manage a network node of a system without MCU intervention are provided. The computer program product includes one or more non-transitory computer-readable media having instructions stored thereon, which, when executed by one or more processors, cause the one or more processors, alone or in combination, to perform the methods described herein.

[0151] The flowcharts and block diagrams in the figures illustrate the possible implementation architectures, functions and operations of the systems, methods and computer program products according to various aspects of the present disclosure. In this regard, each block in the flowchart or block diagram may represent a module, segment or portion of an instruction, which includes one or more executable instructions for implementing a specified logical function. In some alternative implementations, the functions described in the blocks may not occur in the order described in the figure. For example, two blocks shown in succession may actually be executed substantially simultaneously, or the blocks may sometimes be executed in reverse order, depending on the functions involved. It will also be noted that each block in the block diagram and / or flowchart illustration, as well as the combination of blocks in the block diagram and / or flowchart illustration, can be implemented by a system based on special purpose hardware that performs a specified function or action or performs a combination of special purpose hardware and computer instructions.

[0152] It should be noted that all specifications, dimensions and relationships (e.g., the number of elements, operations, steps, etc.) outlined herein are provided for exemplary and teaching purposes only. This information can be varied considerably without departing from the spirit of the present disclosure or the scope of the appended claims. The description is intended for only one non-limiting example, and therefore, they should be interpreted as such. In the foregoing description, the exemplary aspects have been described with reference to a specific arrangement of components. Various modifications and changes may be made to these aspects without departing from the scope of the appended claims. Therefore, the description and drawings should be regarded as illustrative, not restrictive.

[0153] Note that through the numerous examples provided herein, interactions may be described in terms of two, three, four, or more electronic components. However, this is done for purposes of clarity and example only. It should be recognized that the system may be incorporated in any appropriate manner. In similar design schemes, any of the components, modules, and elements shown in the FIGURES may be combined into a variety of possible configurations, all of which are clearly within the broad scope of this specification. In some cases, it may be easier to describe one or more functions of a given set of processes by referencing only a limited number of electrical components. It is worth noting that the FIGURES and the circuits they teach are easily expanded to accommodate a large number of components, as well as more complex / complex arrangements and configurations. Therefore, the examples provided should not limit the scope or inhibit the broad teaching of circuits that may be applied to countless other architectures.

[0154] It should also be noted that in this specification, references to various features (e.g., elements, structures, modules, components, steps, operations, features, etc.) included in "one aspect", "example aspect", "an aspect", "another aspect", "certain aspects", "various aspects", "other aspects", "optional aspects", etc.) are intended to indicate that any such features are included in one or more aspects of the present disclosure, but may or may not be combined in the same aspect.

[0155] It is intended that the following use of " / ", "and / or", and "at least one of", for example, the case of "A / B", "A and B", and "at least one of A and B", is intended to cover the selection of the first listed option (A), or the selection of the second listed option (B), or the selection of both options (A and B). As a further example, the case of "A, B, C and / or" and "at least one of A, B, C", such wording is intended to cover the first option (A), or the selection of the second listed option (B), or the selection of the third listed option (C), or the selection of the first and second listed options (A and B), or the selection of the first and third listed options (A and C), or the selection of the second and third listed options (B and C), or the selection of all three options (A and B and C). This may be extended for many of the items listed, as will be readily apparent to one of ordinary skill in the present and related arts.

[0156] It should also be noted that the functions associated with the circuit architecture are merely illustrative of some possible circuit architecture functions that may be performed by or within the systems shown in the FIGURES. Some of these operations may be deleted or removed where appropriate, or these operations may be modified or changed to a considerable extent without departing from the scope of the present disclosure. In addition, the timing of these operations may vary considerably. The foregoing operational flows are provided for purposes of example and discussion. The aspects described herein provide substantial flexibility in that any suitable arrangements, time sequences, configurations, and timing mechanisms may be provided without departing from the teachings of the present disclosure.

[0157] Numerous other variations, substitutions, changes, alterations, and modifications may be ascertained by those skilled in the art, and it is intended that this disclosure include all such variations, substitutions, changes, alterations, and modifications within the scope of the appended claims.

[0158] Note that all optional features of the above-described devices and systems may also be implemented with respect to the methods or processes described herein, and that specific features in the examples may be used anywhere in one or more aspects.

[0159] The methods "for" in these examples (above) may include (but are not limited to) using any suitable components discussed herein, as well as any suitable software, circuits, hubs, computer code, logic, algorithms, hardware, controllers, interfaces, links, buses, communication paths, etc.

[0160] Note that for the examples provided above, as well as many of the other examples provided herein, interactions may be described in terms of two, three, or four network elements. However, this is done for clarity and example purposes only. In some cases, it may be easier to describe one or more functions of a given set of flows by referencing only a limited number of network elements. It is worth noting that the topologies illustrated and described with reference to the attached FIGURES (and their teachings) are readily extensible and can accommodate a large number of components, as well as more complex / complex arrangements and configurations. Therefore, the examples provided should not limit the scope of the topologies shown or inhibit the broad teachings that are potentially applicable to countless other architectures.

[0161] It is also important to note that the steps in the preceding flow charts illustrate only some of the possible signaling scenarios and patterns that may be performed or executed in the communication system shown in FIGURES. Some of these steps may be deleted or removed where appropriate, or the steps may be modified or changed without departing from the scope of the present disclosure. In addition, many of these operations are described as being performed concurrently or in parallel with one or more additional operations. However, the execution time of these operations may vary significantly. The preceding operational flows are provided for purposes of example and discussion. The communication system shown in FIGURES provides substantial flexibility, wherein any suitable arrangements, time sequences, configurations, and timing mechanisms may be provided without departing from the teachings of the present disclosure.

[0162] Although the present disclosure has been described in detail with reference to specific arrangements and configurations, these example configurations and arrangements may be significantly changed without departing from the scope of the present disclosure. For example, although the present disclosure has been described with reference to a specific communication exchange, the aspects described herein may be applicable to other architectures.

[0163] Numerous other variations, substitutions, changes, alterations, and modifications may be ascertained by those skilled in the art, and it is intended that the present disclosure encompass all such variations, substitutions, changes, alterations, and modifications within the scope of the appended claims. To assist the United States Patent and Trademark Office (USPTO) and any reader of any patent issued on this application in interpreting the claims appended hereto, applicants wish to note that applicants: (a) do not intend any of the appended claims to invoke 35 U.S.C. § 142, paragraph 6(6) as it existed on the date of filing this application, unless the words "means for" or "step for" are specifically used in a particular claim; and (b) do not intend, by any statement in the specification, to limit the present disclosure in any manner not otherwise reflected in the appended claims.

Claims

1. A computer-implemented method for synchronizing a non-master clock at a first node with a master clock at a second node in a multi-node broadcast network, the method comprising: receiving first, second, and third sync / follow-up message pairs, each message pair comprising a sync message having an estimated time at which the sync message was sent and a follow-up message having an actual time at which the sync message was sent; Wherein the method further comprises: responsive to a second sync / follow-up message pair, setting a neighbor rate ratio between the master clock and the non-master clock to a midpoint value controlled by the non-master clock based on an ingress timestamp increment and an egress timestamp increment; In response to a third sync / follow-up message pair, fixing the phase value of the master clock by setting the expected master clock time value to the current timestamp of the master clock without modifying the midpoint value; and In response to at least the midpoint value being set to the neighbor rate ratio, the non-master clock is adjusted to synchronize with the master clock. 2 . The method of claim 1 , further comprising fixing the rate ratio to a predetermined value in response to the first pair of synchronization messages.

3. The method of claim 2, further comprising fixing the rate ratio to a predetermined value during a given interval independent of the corresponding master clock timestamp and the corresponding non-master clock timestamp of the first sync / subsequent message pair.

4. The method of claim 1, further comprising calculating a rate ratio based on an average value determined from respective master clock timestamps and respective non-master timestamps of both the first sync / subsequent message pair and the second sync message pair.

5. The method of claim 1 further comprising adding the egress timestamp increment to the nominal midpoint to obtain a sum and dividing the sum by the ingress timestamp increment.

6. The method of claim 1, further comprising calculating an egress timestamp as the sum of a corrected field and an original timestamp field of a second sync / follow-up message pair.

7. The method of claim 1, further comprising calculating an egress timestamp as a sum of a plurality of correction fields in a plurality of pairs of first and second sync / subsequent message pairs and an original timestamp field of the second sync / subsequent message pair.

8. The method of claim 1 , further comprising selectively calculating the egress timestamp in response to a value of the flag as: the sum of the Corrected field and the Original Timestamp field of the second Sync / Subsequent message pair, or The sum of the plurality of correction fields in the plurality of pairs of the first and second sync / subsequent message pairs and the original timestamp field of the second sync / subsequent message pair.

9. The method of claim 1, further comprising disabling Pdelay data when synchronizing a non-master clock to a master clock.

10. The method of claim 9, further comprising adding an average link delay field to the egress timestamp to compensate for a cable delay between a node containing a master clock and another node containing a non-master clock.

11. The method of claim 10, further comprising calculating a time error between the master clock and the non-master clock based on a sum of a value of the egress timestamp and a value of the link delay field minus a value of the ingress timestamp.

12. The method of claim 1, further comprising generating the first, second, and third sync / subsequent message pairs by a sync processor having a frame receiver configured to receive frames from a master clock and a non-master clock.

13. The method according to claim 1, further comprising: providing the first sync / subsequent message pair and the second sync / subsequent message pair to a neighbor rate ratio algorithm; and A third Sync / Follow-up message pair is provided to a pi controller configured to control the non-master clock phase.

14. A system for synchronizing a non-master clock at a first node with a master clock at a second node in a multi-node broadcast network, the system comprising: a synchronization processor having a frame receiver configured to receive frames from a master clock and a non-master clock and generate first, second, and third sync / follow-up message pairs, each message pair including a sync message having an estimated time at which the sync message was sent and a follow-up message having an actual time at which the sync message was sent; The synchronization processor is further configured as follows: responsive to a second sync / follow-up message pair, setting a neighbor rate ratio between the master clock and the non-master clock to a midpoint value controlled by the non-master clock based on an ingress timestamp increment and an egress timestamp increment; In response to a third sync / follow-up message pair, fixing the phase value of the master clock by setting the expected master clock time value to the current timestamp of the master clock without modifying the midpoint value; and The pi controller is configured to adjust the non-master clock to be synchronized with the master clock in response to at least the midpoint value being set to a neighbor rate ratio.

15. The system of claim 14, wherein the sync processor fixes the rate ratio to a predetermined value in response to the first sync / subsequent message pair.

16. The system of claim 15, wherein the rate ratio is fixed to a predetermined value during a given interval independent of the corresponding master clock timestamp and the corresponding non-master clock timestamp of the first sync / subsequent message pair.

17. The system of claim 14, wherein the rate ratio is calculated based on an average value determined from respective master clock timestamps and respective non-master timestamps of both the first sync / subsequent message pair and the second sync / subsequent message pair.

18. The system of claim 14, further comprising adding the egress timestamp increment to the nominal midpoint to obtain a sum, and dividing the sum by the ingress timestamp increment.

19. The system of claim 14, further comprising calculating an egress timestamp as a sum of a correction field and an original timestamp field of a second sync / follow-up message pair.

20. The system of claim 14, further comprising calculating an egress timestamp as a sum of a plurality of corrected fields in a plurality of first and second sync / subsequent message pairs and an original timestamp field of the second sync / subsequent message pair.

21. The system of claim 14, further comprising selectively calculating the egress timestamp in response to the value of the flag as: the sum of the Corrected field and the Original Timestamp field of the second Sync / Subsequent message pair, or The sum of the plurality of correction fields in the plurality of pairs of the first and second sync / subsequent message pairs and the original timestamp field of the second sync / subsequent message pair.

22. The system of claim 14, further comprising disabling Pdelay data when synchronizing a non-master clock to a master clock.

23. The system of claim 22, further comprising adding an average link delay field to the egress timestamp to compensate for a cable delay between a node containing a master clock and another node containing a non-master clock.

24. The system of claim 23, further comprising calculating a time error between the master clock and the non-master clock based on a sum of a value of the egress timestamp and a value of the link delay field minus a value of the ingress timestamp.

25. The system of claim 23, further comprising generating the first, second, and third sync / subsequent message pairs by a sync processor having a frame receiver configured to receive frames from the master clock and the non-master clock.

26. The system of claim 23, further comprising: providing the first sync / subsequent message pair and the second sync / subsequent message pair to a neighbor rate ratio algorithm; and A third Sync / Follow-up message pair is provided to a pi controller configured to control the non-master clock phase.