System and method to dynamically redistribute timing and synchronization in a packet switched network
Systems, methods, apparatuses, and computer program products for dynamically redistributing timing and synchronization in a packet switched network are provided. One method includes creating, by a slave node, a peer list comprising an identifier of at least one peer slave node that shares a same master node as the slave node or that has a certain predefined affinity with the slave node. The method may also include announcing a holdover time of the slave node to the at least one peer slave node, and, when a predefined event occurs, announcing to the at least one peer slave node that the slave node is taking on a mini-master role for at least the announced holdover time.
1. A method, comprising:
creating, by a slave node, a peer list comprising an identifier of at least one peer slave node that shares a same master node as the slave node or that has a certain predefined affinity with the slave node;
announcing a holdover time of the slave node to the at least one peer slave node; and
when a predefined event occurs, announcing to the at least one peer slave node that the slave node is taking on a mini-master role for at least the announced holdover time.
2. The method according to claim 1 , wherein the predefined event comprises determining that the slave node has lost communication with its master node or when the delay and jitter in the communication path with the master node has degraded below a certain threshold.
3. The method according to claim 1 , further comprising receiving synchronization messages from at least one subordinate slave node that decide to synchronize with the slave node taking on the mini-master role.
4. The method according to claim 1 , further comprising:
when the slave node receives an announcement from another slave node indicating that said another slave node is taking on a mini-master role with a better holdover time, immediately stopping, by the slave node, the sending of its own mini-master announcements.
5. The method according to claim 3 , further comprising relinquishing the mini-master role when the predefined event ends, and notifying the at least one subordinate slave node to try to re-establish communication with the master node or to synchronize with another mini-master node.
6. The method according to claim 3 , further comprising, when the pre-defined event ends, deciding to become a boundary clock to continuously serve the at least one subordinate slave node.
7. An apparatus, comprising:
at least one processor; and
at least one memory including computer program code,
the at least one memory and computer program code configured, with the at least one processor, to cause the apparatus at least to
create a peer list comprising an identifier of at least one peer slave node that shares a same master node as the apparatus or that has a certain predefined affinity with the apparatus;
announce a holdover time of the apparatus to the at least one peer slave node; and
when a predefined event occurs, announce to the at least one peer slave node that the apparatus is taking on a mini-master role for at least the announced holdover time.
8. The apparatus according to claim 7 , wherein the predefined event comprises determining that the apparatus has lost communication with its master node or when the delay and jitter in the communication path with the master node has degraded below a certain threshold.
9. The apparatus according to claim 7 , wherein the at least one memory and the computer program code are further configured, with the at least one processor, to cause the apparatus at least to receive synchronization messages from at least one subordinate slave node that decide to synchronize with the apparatus taking on the mini-master role.
10. The apparatus according to claim 7 , wherein, when the apparatus receives an announcement from another slave node indicating that said another slave node is taking on a mini-master role with a better holdover time, the at least one memory and the computer program code are further configured, with the at least one processor, to cause the apparatus at least to immediately stop the sending of its own mini-master announcements.
11. The apparatus according to claim 9 , wherein the at least one memory and the computer program code are further configured, with the at least one processor, to cause the apparatus at least to relinquish the mini-master role when the predefined event ends, and to notify the at least one subordinate slave node to try to re-establish communication with the master node or to synchronize with another mini-master node.
12. The apparatus according to claim 9 , wherein the at least one memory and the computer program code are further configured, with the at least one processor, to cause the apparatus at least to, when the pre-defined event ends, decide to become a boundary clock to continuously serve the at least one subordinate slave node.
13. A computer program, embodied on a non-transitory computer readable medium, the computer program configured to control a processor to perform a process, comprising:
creating, by a slave node, a peer list comprising an identifier of at least one peer slave node that shares a same master node as the slave node or that has a certain predefined affinity with the slave node;
announcing a holdover time of the slave node to the at least one peer slave node; and
when a predefined event occurs, announcing to the at least one peer slave node that the slave node is taking on a mini-master role for at least the announced holdover time.