Inventor(s)

Abstract

The precision time protocol (PTP) best master clock algorithm (BMCA) ranks grandmaster candidates only by advertised clock attributes and reacts to a degraded path only after announce messages are lost or lock fails. This disclosure describes an alternate BMCA in which real-time network telemetry drives grandmaster selection before synchronization fails. In a first method, a slave node runs active operations, administration, and maintenance (OAM) sessions toward every candidate grandmaster, scores each path from measured loss, delay variation, and delay, and raises the local priority of a grandmaster whose path has degraded; a hysteresis threshold and holddown timer govern failover and reversion. In a second method, each node in a multi-hop chain measures its upstream link and adds a local penalty to a cumulative penalty carried in a type-length-value (TLV) extension of the announce message, which the slave applies to that grandmaster's local priority. Both methods yield a make-before-break switchover.

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.

Share

COinS