In some embodiments, for a first tier of nodes having long links, a coordinator selects a master reference node. For a group of nodes within a second tier of nodes, the coordinator selects a local reference node. The coordinator adjusts, during a plurality of cycles, a local reference clock of the local reference node based on a clock difference between the local reference clock and a master reference clock of the master reference node. For each node of the group of nodes within the second tier of nodes, the coordinator adjusts, during the plurality of cycles, its corresponding clock based on a corresponding clock difference between its corresponding clock and the local reference clock, where adjustments to the local reference clock are applied during each of the plurality of cycles using guardrails that are not applied when adjusting clocks of the group of nodes within the second tier of nodes.
In some embodiments, for a first tier of nodes having long links, a coordinator selects a master reference node. For a group of nodes within a second tier of nodes, the coordinator selects a local reference node. The coordinator adjusts, during a plurality of cycles, a local reference clock of the local reference node based on a clock difference between the local reference clock and a master reference clock of the master reference node. For each node of the group of nodes within the second tier of nodes, the coordinator adjusts, during the plurality of cycles, its corresponding clock based on a corresponding clock difference between its corresponding clock and the local reference clock, where adjustments to the local reference clock are applied during each of the plurality of cycles using guardrails that are not applied when adjusting clocks of the group of nodes within the second tier of nodes.
A bump-on-the-wire (BOTW) associated with a sender host receives a data packet destined for a receiver host, where the data packet was transmitted by the sender host, where the sender bump-on-the-wire is at a position on a data path between the sender host and a receiver host, and where the sender host, the receiver host, the sender bump-on-the-wire, and a receiver bump-on-the-wire are clock-synchronized with respect to one another. The sender BOTW records a sender timestamp of the data packet. The sender BOTW receives, from a receiver bump-on-the-wire associated with the receiver host, a receiver timestamp of the data packet along with auxiliary information. The sender BOTW determines a congestion metric based on the sender timestamp, the receiver timestamp, and the auxiliary information, and transmits, to the sender host, a congestion signal based on the congestion metric.
A bump-on-the-wire (BOTW) associated with a sender host receives a data packet destined for a receiver host, where the data packet was transmitted by the sender host, where the sender bump-on-the-wire is at a position on a data path between the sender host and a receiver host, and where the sender host, the receiver host, the sender bump-on-the-wire, and a receiver bump-on-the-wire are clock-synchronized with respect to one another. The sender BOTW records a sender timestamp of the data packet. The sender BOTW receives, from a receiver bump-on-the-wire associated with the receiver host, a receiver timestamp of the data packet along with auxiliary information. The sender BOTW determines a congestion metric based on the sender timestamp, the receiver timestamp, and the auxiliary information, and transmits, to the sender host, a congestion signal based on the congestion metric.
Network traffic is monitored to coordinate control of data flows. Data flows between sender hosts and a receiver host are identified. A first data flow and a second data flow have respective priorities. Delay thresholds are assigned to the first data flow and second data flow based on their respective priorities. One-way delays of data packets of the first and second data flows are monitored relative to the assigned delay thresholds. Responsive to determining that the one-way delay of the first data flow's data packets exceed a first delay threshold, transmissions of the first data flow's data packets are paused for a first amount of time. Responsive to determining that the one-way delay of the second data flow's data packets exceed a second delay threshold, transmissions of the second data flow's packets are paused for a second amount of time that exceeds the first amount of time.
Systems and methods are disclosed herein for syntonizing machines in a network. A coordinator accesses probe records for probes transmitted at different times between pairs of machines in the mesh network. For different pairs of machines, the coordinator estimates the drift between the pair of machines based on the transit times of probes transmitted between the pair of machines as indicated by the probe records. For different loops of at least three machines in the mesh network, the coordinator calculates a loop drift error based on a sum of the estimated drifts between pairs of machines around the loop and adjusts the estimated absolute drifts of the machines based on the loop drift errors. Here, the absolute drift is defined relative to a drift of a reference machine.
H04L 7/033 - Speed or phase control by the received code signals, the signals containing no special synchronisation information using the transitions of the received signal to control the phase of the synchronising-signal- generating means, e.g. using a phase-locked loop
G06N 20/10 - Machine learning using kernel methods, e.g. support vector machines [SVM]
H03L 7/087 - Details of the phase-locked loop concerning mainly the frequency- or phase-detection arrangement including the filtering or amplification of its output signal using at least two phase detectors or a frequency and phase detector in the loop
7.
Quantized pause for a traffic control mechanism robust to underlying network conditions
An application determines conditions of the network between a sender host and a receiver host. The application determines, from the conditions, a length of pause to apply. The application transmits the traffic until the length of pause is completely applied to the network using a series of quantized pauses. When the length of pause exceeds a threshold, the application instructs the sender host to pause the traffic for a first amount of time, and where the length of pause does not exceed the threshold, the application instructs the sender host to pause the traffic for a second smaller amount of time. The application detects a new set of conditions of the network between the first node and the second node, and applies a new series of quantized pauses to transmission of the traffic based on a new length of pause determined from the new set of conditions.
An application determines conditions of the network between a sender host and a receiver host. The application determines, from the conditions, a length of pause to apply. The application transmits the traffic until the length of pause is completely applied to the network using a series of quantized pauses. When the length of pause exceeds a threshold, the application instructs the sender host to pause the traffic for a first amount of time, and where the length of pause does not exceed the threshold, the application instructs the sender host to pause the traffic for a second smaller amount of time. The application detects a new set of conditions of the network between the first node and the second node, and applies a new series of quantized pauses to transmission of the traffic based on a new length of pause determined from the new set of conditions.
A regular buffer and a shadow buffer are maintained at a receiver host. Responsive to receiving a data flow from a sender host that is clock-synchronized with the receiver host using a common reference clock, a first indication of data of the data flow is stored to the regular buffer, the shadow buffer is transitioned from an idle state to an active state, and a counter of the shadow buffer is incremented that indicates a unit of data traffic received. A dynamic drain rate is determined based on a number of units of the data removed from the regular buffer per unit of time while the shadow buffer is in the active state, where the shadow buffer reverts to an idle state responsive to a break in the receiver host receiving the data flow. Dwell time is calculated as a function of the counter of the shadow buffer and the dynamic drain rate, and a congestion signal for the data flow is determined based on the dwell time.
Systems and methods are disclosed herein for syntonizing machines in a network. A coordinator accesses probe records for probes transmitted at different times between pairs of machines in the mesh network. For different pairs of machines, the coordinator estimates the drift between the pair of machines based on the transit times of probes transmitted between the pair of machines as indicated by the probe records. For different loops of at least three machines in the mesh network, the coordinator calculates a loop drift error based on a sum of the estimated drifts between pairs of machines around the loop and adjusts the estimated absolute drifts of the machines based on the loop drift errors. Here, the absolute drift is defined relative to a drift of a reference machine.
H04L 7/033 - Speed or phase control by the received code signals, the signals containing no special synchronisation information using the transitions of the received signal to control the phase of the synchronising-signal- generating means, e.g. using a phase-locked loop
G06N 20/10 - Machine learning using kernel methods, e.g. support vector machines [SVM]
H03L 7/087 - Details of the phase-locked loop concerning mainly the frequency- or phase-detection arrangement including the filtering or amplification of its output signal using at least two phase detectors or a frequency and phase detector in the loop
11.
Deploying shadow buffer in context of clock-synchronized edge-based network functions
A regular buffer and a shadow buffer are maintained at a receiver host. Responsive to receiving a data flow from a sender host that is clock-synchronized with the receiver host using a common reference clock, a first indication of data of the data flow is stored to the regular buffer, the shadow buffer is transitioned from an idle state to an active state, and a counter of the shadow buffer is incremented that indicates a unit of data traffic received. A dynamic drain rate is determined based on a number of units of the data removed from the regular buffer per unit of time while the shadow buffer is in the active state, where the shadow buffer reverts to an idle state responsive to a break in the receiver host receiving the data flow. Dwell time is calculated as a function of the counter of the shadow buffer and the dynamic drain rate, and a congestion signal for the data flow is determined based on the dwell time.
A device determines whether virtual resources are co-located on a physical resource. The device computes a plurality of distance matrices, each distance matrix of the plurality of distance matrices computed using a different raw input signal. The device combines the plurality of distance matrices into a combined distance matrix. The device determines, using the combined distance matrix, subsets of the virtual resources that are using shared physical hardware. The device outputs indicia of the subsets.
A device determines whether virtual resources are co-located on a physical resource. The determination is performed by aggregating a plurality of timestamps into a data structure, each timestamp of the plurality of timestamps corresponding to one of a sent time or a receive time of a network packet exchanged between two of the virtual resources, the data structure representing one or more raw signals of distance between sets of the virtual resources that exchanged network packets, the virtual resources synchronized to a common reference clock. The device determines, using the data structure, subsets of sets of virtual resources that are using shared physical hardware. The device outputs indicia of the subsets.
A regular buffer and a shadow buffer are maintained at a receiver host. Responsive to receiving a data flow from a sender host that is clock-synchronized with the receiver host using a common reference clock, a first indication of data of the data flow is stored to the regular buffer, the shadow buffer is transitioned from an idle state to an active state, and a counter of the shadow buffer is incremented that indicates a unit of data traffic received.
09 - Scientific and electric apparatus and instruments
42 - Scientific, technological and industrial services, research and design
Goods & Services
Downloadable computer software for creating and comparing timestamps with dynamic bounds being customizable parameters; downloadable computer software providing application programming interfaces (APIs) for use in other computer software, namely, function libraries for time measurement and computation of derived values, for creating and comparing timestamps with dynamic bounds being customizable parameters; downloadable computer software for building of scalable, time-sensitive, latency-critical applications using time-as-a-service application programming interface (API) Software as a service (SAAS) services featuring software for creating and comparing timestamps with dynamic bounds being customizable parameters; Software as a service (SAAS) services featuring software providing application programming interfaces (APIs) for use in other computer software, namely, online non-downloadable software for time measurement and computation of derived values, for creating and comparing timestamps with dynamic bounds being customizable parameters; Software as a service (SAAS) services featuring software for building of scalable, time-sensitive, latency-critical applications using time-as-a-service application programming interface (API)
Network traffic is monitored to coordinate control of data flows and detect anomalies. For a data flow transmitted between sender and receiver hosts, pre-defined amounts of sent and received network traffic of the data flow is recorded. The data flow is monitored, based on time stamps of data packets in the network traffic, for an anomaly. Responsive to determining that no anomaly is detected, the recorded sent and received network traffic is overwritten with newly sent and newly received network traffic, respectively. Responsive to determining that an anomaly is detected, the data flow is paused, which causes the sender host to store the recorded sent network traffic to a first buffer and causes the receiver host the store the recorded received network traffic to a second buffer.
Network traffic is monitored to coordinate control of data flows. Data flows between sender hosts and a receiver host are identified. A first data flow and a second data flow have respective priorities. Delay thresholds are assigned to the first data flow and second data flow based on their respective priorities. One-way delays of data packets of the first and second data flows are monitored relative to the assigned delay thresholds. Responsive to determining that the one-way delay of the first data flow's data packets exceed a first delay threshold, transmissions of the first data flow's data packets are paused for a first amount of time. Responsive to determining that the one-way delay of the second data flow's data packets exceed a second delay threshold, transmissions of the second data flow's packets are paused for a second amount of time that exceeds the first amount of time.
Network traffic is monitored to coordinate control of data flows and detect anomalies. For a data flow transmitted between sender and receiver hosts, pre-defmed amounts of sent and received network traffic of the data flow is recorded. The data flow is monitored, based on time stamps of data packets in the network traffic, for an anomaly. Responsive to determining that no anomaly is detected, the recorded sent and received network traffic is overwritten with newly sent and newly received network traffic, respectively. Responsive to determining that an anomaly is detected, the data flow is paused, which causes the sender host to store the recorded sent network traffic to a first buffer and causes the receiver host the store the recorded received network traffic to a second buffer.
Systems and methods are disclosed herein for syntonizing machines in a network. A coordinator accesses probe records for probes transmitted at different times between pairs of machines in the mesh network. For different pairs of machines, the coordinator estimates the drift between the pair of machines based on the transit times of probes transmitted between the pair of machines as indicated by the probe records. For different loops of at least three machines in the mesh network, the coordinator calculates a loop drift error based on a sum of the estimated drifts between pairs of machines around the loop and adjusts the estimated absolute drifts of the machines based on the loop drift errors. Here, the absolute drift is defined relative to a drift of a reference machine.
H04L 7/033 - Speed or phase control by the received code signals, the signals containing no special synchronisation information using the transitions of the received signal to control the phase of the synchronising-signal- generating means, e.g. using a phase-locked loop
G06N 20/10 - Machine learning using kernel methods, e.g. support vector machines [SVM]
H03L 7/087 - Details of the phase-locked loop concerning mainly the frequency- or phase-detection arrangement including the filtering or amplification of its output signal using at least two phase detectors or a frequency and phase detector in the loop
20.
Time-triggered distribution of messages from a region of networked machines to multiple destinations using gateway-based time perimeters
Systems and methods are disclosed herein for performing a time-triggered distribution of messages from a region of networked machines to multiple destinations. In an embodiment, the system runs a software-based synchronization process to synchronize each of a plurality of gateways with a reference clock, wherein each gateway is a machine on a perimeter of the region of networked machines and is connected to transmit messages to multiple destinations. The gateways receive messages from within the region of networked machines for distribution to multiple destinations outside the region of networked machines according to a distribution schedule based on absolute time relative to the reference clock. The gateways perform the distribution of received messages, wherein each gateway determines absolute time based on that gateway's synchronization with the reference clock.
09 - Scientific and electric apparatus and instruments
42 - Scientific, technological and industrial services, research and design
Goods & Services
Downloadable computer software for monitoring, correcting,
updating, and synchronizing times relative to a reference
clock across multiple machines; downloadable computer
software for discovery, latency/delay measurement,
monitoring, telemetry, and congestion management of computer
and communication networks; downloadable computer software
for dynamic packet-level, flow-level, and application-level
prioritization, flow and control of computer and
communication networks; downloadable computer software for
establishing accurate, multi-tiered time perimeters to
enforce precise order of execution (FIFO) of incoming data
and simultaneous publishing / release of outgoing data to
clusters of machines; downloadable computer software for
building of scalable, time-sensitive, latency-critical
applications using time-as-a-service API; downloadable
computer software for creating an accurate common timeline
among clusters of machines to monitor, diagnose and improve
performance of distributed applications; downloadable
computer software for reliable, on-time (user specified) and
guaranteed delivery of data on commodity computer and
communication networks; downloadable computer software for
identifying underperforming resources on commodity computer
and communication networks and boosting their performance. Provision of online, non-downloadable computer software for
monitoring, correcting, updating, and synchronizing times
relative to a reference clock across multiple machines;
provision of online, non-downloadable computer software for
discovery, latency/delay measurement, monitoring, telemetry,
and congestion management of computer and communication
networks; provision of online, non-downloadable computer
software for dynamic packet-level, flow-level, and
application-level prioritization, flow and control of
computer and communication networks; provision of online,
non-downloadable computer software for establishing
accurate, multi-tiered time perimeters to enforce precise
order of execution (FIFO) of incoming data and simultaneous
publishing / release of outgoing data to clusters of
machines; provision of online, non-downloadable computer
software for building of scalable, time-sensitive,
latency-critical applications using time-as-a-service API;
provision of online, non-downloadable computer software for
creating an accurate common timeline among clusters of
machines to monitor, diagnose and improve performance of
distributed applications; provision of online,
non-downloadable computer software for reliable, on-time
(user specified) and guaranteed delivery of data on
commodity computer and communication networks; provision of
online, non-downloadable computer software for identifying
underperforming resources on commodity computer and
communication networks and boosting their performance;
managed cloud services featuring the foregoing software;
provision of time-as-a-service APIs for use by others.
09 - Scientific and electric apparatus and instruments
42 - Scientific, technological and industrial services, research and design
Goods & Services
(1) Downloadable computer software for monitoring, correcting, updating, and synchronizing times relative to a reference clock across multiple machines; downloadable computer software for discovery, latency and delay measurement, monitoring, telemetry, and congestion management of computer and communication networks; downloadable computer software for dynamic packet-level, flow-level, and application-level prioritization, flow and control of computer and communication networks; downloadable computer software for establishing accurate, multi-tiered time perimeters to enforce precise First-In-First-Out order of execution of incoming data and simultaneous publishing and release of outgoing data to clusters of machines; downloadable computer software for building of scalable, time-sensitive, latency-critical applications using time-as-a-service Application Programming Interface; downloadable computer software for creating an accurate common timeline among clusters of machines to monitor, diagnose and improve performance of distributed applications; downloadable computer software for reliable and guaranteed delivery of data on commodity computer and communication networks; downloadable computer software for identifying underperforming resources on commodity computer and communication networks and boosting their performance. (1) Provision of online, non-downloadable computer software for monitoring, correcting, updating, and synchronizing times relative to a reference clock across multiple machines; provision of online, non downloadable computer software for discovery, latency and delay measurement, monitoring, telemetry, and congestion management of computer and communication networks; provision of online, non-downloadable computer software for dynamic packet-level, flow-level, and application-level prioritization, flow and control of computer and communication networks; provision of online, non-downloadable computer software for establishing accurate, multi-tiered time perimeters to enforce precise First-In-First-Out order of execution of incoming data and simultaneous publishing and release of outgoing data to clusters of machines; provision of online, non-downloadable computer software for building of scalable, time-sensitive, latency-critical applications using time-as-a-service Application Programming Interface; provision of online, non downloadable computer software for creating an accurate common timeline among clusters of machines to monitor, diagnose and improve performance of distributed applications; provision of online, non downloadable computer software for reliable and guaranteed delivery of data on commodity computer and communication networks; provision of online, non-downloadable computer software for identifying underperforming resources on commodity computer and communication networks and boosting their performance; managed cloud services featuring the foregoing software; provision of time-as-a-service Application Programming Interfaces for use by others.
09 - Scientific and electric apparatus and instruments
42 - Scientific, technological and industrial services, research and design
Goods & Services
downloadable computer software for monitoring, correcting, updating, and synchronizing times relative to a reference clock across multiple machines; downloadable computer software for discovery, latency and delay measurement, monitoring, telemetry, and congestion management of computer and communication networks; downloadable computer software for dynamic packet-level, flow-level, and application-level prioritization, flow and control of computer and communication networks; downloadable computer software for establishing accurate, multi-tiered time perimeters to enforce precise order of execution, first in first out (FIFO), of incoming data and simultaneous publishing and release of outgoing data to clusters of machines; downloadable computer software for building of scalable, time-sensitive, latency-critical applications using time-as-a-service application programming interface (API); downloadable computer software for creating an accurate common timeline among clusters of machines to monitor, diagnose and improve performance of distributed applications; downloadable computer software for reliable, on-time, user specified, and guaranteed delivery of data on commodity computer and communication networks; downloadable computer software for identifying underperforming resources on commodity computer and communication networks and boosting their performance provision of online, non-downloadable computer software for monitoring, correcting, updating, and synchronizing times relative to a reference clock across multiple machines; provision of online, non-downloadable computer software for discovery, latency and delay measurement, monitoring, telemetry, and congestion management of computer and communication networks; provision of online, non-downloadable computer software for dynamic packet-level, flow-level, and application-level prioritization, flow and control of computer and communication networks; provision of online, non-downloadable computer software for establishing accurate, multi-tiered time perimeters to enforce precise order of execution, first in first out (FIFO), of incoming data and simultaneous publishing and release of outgoing data to clusters of machines; provision of online, non-downloadable computer software for building of scalable, time-sensitive, latency-critical applications using time-as-a-service application programming interface (API); provision of online, non-downloadable computer software for creating an accurate common timeline among clusters of machines to monitor, diagnose and improve performance of distributed applications; provision of online, non-downloadable computer software for reliable, on-time, user specified, and guaranteed delivery of data on commodity computer and communication networks; provision of online, non-downloadable computer software for identifying underperforming resources on commodity computer and communication networks and boosting their performance; managed cloud services featuring the foregoing software; provision of time-as-a-service application programming interface (API) for use by others
09 - Scientific and electric apparatus and instruments
42 - Scientific, technological and industrial services, research and design
Goods & Services
downloadable computer software for monitoring, correcting, updating, and synchronizing times relative to a reference clock across multiple machines; downloadable computer software for discovery, latency and delay measurement, monitoring, telemetry, and congestion management of computer and communication networks; downloadable computer software for dynamic packet-level, flow-level, and application-level prioritization, flow and control of computer and communication networks; downloadable computer software for establishing accurate, multi-tiered time perimeters to enforce precise order of execution, first in first out (FIFO), of incoming data and simultaneous publishing and release of outgoing data to clusters of machines; downloadable computer software for building of scalable, time-sensitive, latency-critical applications using time-as-a-service application programming interface (API); downloadable computer software for creating an accurate common timeline among clusters of machines to monitor, diagnose and improve performance of distributed applications; downloadable computer software for reliable, on-time, user specified, and guaranteed delivery of data on commodity computer and communication networks; downloadable computer software for identifying underperforming resources on commodity computer and communication networks and boosting their performance provision of online, non-downloadable computer software for monitoring, correcting, updating, and synchronizing times relative to a reference clock across multiple machines; provision of online, non-downloadable computer software for discovery, latency and delay measurement, monitoring, telemetry, and congestion management of computer and communication networks; provision of online, non-downloadable computer software for dynamic packet-level, flow-level, and application-level prioritization, flow and control of computer and communication networks; provision of online, non-downloadable computer software for establishing accurate, multi-tiered time perimeters to enforce precise order of execution, first in first out (FIFO), of incoming data and simultaneous publishing and release of outgoing data to clusters of machines; provision of online, non-downloadable computer software for building of scalable, time-sensitive, latency-critical applications using time-as-a-service application programming interface (API); provision of online, non-downloadable computer software for creating an accurate common timeline among clusters of machines to monitor, diagnose and improve performance of distributed applications; provision of online, non-downloadable computer software for reliable, on-time, user specified, and guaranteed delivery of data on commodity computer and communication networks; provision of online, non-downloadable computer software for identifying underperforming resources on commodity computer and communication networks and boosting their performance; managed cloud services featuring the foregoing software; provision of time-as-a-service application programming interface (API) for use by others
25.
Clock syntonization using network effect and/or adaptive stochastic control
Systems and methods are disclosed herein for syntonizing machines in a network. A coordinator accesses probe records for probes transmitted at different times between pairs of machines in the mesh network. For different pairs of machines, the coordinator estimates the drift between the pair of machines based on the transit times of probes transmitted between the pair of machines as indicated by the probe records. For different loops of at least three machines in the mesh network, the coordinator calculates a loop drift error based on a sum of the estimated drifts between pairs of machines around the loop and adjusts the estimated absolute drifts of the machines based on the loop drift errors. Here, the absolute drift is defined relative to a drift of a reference machine.
H04L 7/00 - Arrangements for synchronising receiver with transmitter
H04L 7/033 - Speed or phase control by the received code signals, the signals containing no special synchronisation information using the transitions of the received signal to control the phase of the synchronising-signal- generating means, e.g. using a phase-locked loop
G06N 20/10 - Machine learning using kernel methods, e.g. support vector machines [SVM]
H03L 7/087 - Details of the phase-locked loop concerning mainly the frequency- or phase-detection arrangement including the filtering or amplification of its output signal using at least two phase detectors or a frequency and phase detector in the loop
26.
Time-based processing of messages arriving from multiple gateways using gateway-based time perimeters
Systems and methods are disclosed herein for performing a time-ordered operation on messages transmitted from multiple sources to a region of networked machines. In an embodiment, the system runs a software-based synchronization process to synchronize each of a plurality of gateways with a reference clock, where each gateway is a machine on a perimeter of the region of networked machines and is connected to receive messages from multiple sources. The system receives messages that enter the region through one of the gateways, where the gateway timestamps the message. The system then performs the time-ordered operation on the received messages in an order based on an absolute time of entry into the region, where the absolute time of entry is relative to the reference clock and is determined based on the timestamp from the gateway.
G06F 15/16 - Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
H04L 7/00 - Arrangements for synchronising receiver with transmitter
Systems and methods are disclosed herein for performing a time-triggered distribution of messages from a region of networked machines to multiple destinations. In an embodiment, the system runs a software-based synchronization process to synchronize each of a plurality of gateways with a reference clock, wherein each gateway is a machine on a perimeter of the region of networked machines and is connected to transmit messages to multiple destinations. The gateways receive messages from within the region of networked machines for distribution to multiple destinations outside the region of networked machines according to a distribution schedule based on absolute time relative to the reference clock. The gateways perform the distribution of received messages, wherein each gateway determines absolute time based on that gateway's synchronization with the reference clock.
Systems and methods are disclosed herein for syntonizing machines in a network. A coordinator accesses probe records for probes transmitted at different times between pairs of machines in the mesh network. For different pairs of machines, the coordinator estimates the drift between the pair of machines based on the transit times of probes transmitted between the pair of machines as indicated by the probe records. For different loops of at least three machines in the mesh network, the coordinator calculates a loop drift error based on a sum of the estimated drifts between pairs of machines around the loop and adjusts the estimated absolute drifts of the machines based on the loop drift errors. Here, the absolute drift is defined relative to a drift of a reference machine.
H04L 7/00 - Arrangements for synchronising receiver with transmitter
H04L 7/033 - Speed or phase control by the received code signals, the signals containing no special synchronisation information using the transitions of the received signal to control the phase of the synchronising-signal- generating means, e.g. using a phase-locked loop
G06N 20/10 - Machine learning using kernel methods, e.g. support vector machines [SVM]
H03L 7/087 - Details of the phase-locked loop concerning mainly the frequency- or phase-detection arrangement including the filtering or amplification of its output signal using at least two phase detectors or a frequency and phase detector in the loop
29.
Clock syntonization using network effect and/or adaptive stochastic control
Systems and methods are disclosed herein for syntonizing machines in a network. A coordinator accesses probe records for probes transmitted at different times between pairs of machines in the mesh network. For different pairs of machines, the coordinator estimates the drift between the pair of machines based on the transit times of probes transmitted between the pair of machines as indicated by the probe records. For different loops of at least three machines in the mesh network, the coordinator calculates a loop drift error based on a sum of the estimated drifts between pairs of machines around the loop and adjusts the estimated absolute drifts of the machines based on the loop drift errors. Here, the absolute drift is defined relative to a drift of a reference machine.
H04L 7/00 - Arrangements for synchronising receiver with transmitter
H04L 7/033 - Speed or phase control by the received code signals, the signals containing no special synchronisation information using the transitions of the received signal to control the phase of the synchronising-signal- generating means, e.g. using a phase-locked loop
G06N 20/10 - Machine learning using kernel methods, e.g. support vector machines [SVM]
H03L 7/087 - Details of the phase-locked loop concerning mainly the frequency- or phase-detection arrangement including the filtering or amplification of its output signal using at least two phase detectors or a frequency and phase detector in the loop
