Fault-tolerant self-stabilizing distributed clock synchronization protocol for arbitrary digraphs
展开▼
机译:任意有向图的容错自稳定分布式时钟同步协议
展开▼
页面导航
摘要
著录项
相似文献
摘要
A self-stabilizing network in the form of an arbitrary, non-partitioned digraph includes K nodes having a synchronizer executing a protocol. K−1 monitors of each node may receive a Sync message transmitted from a directly connected node. When the Sync message is received, the logical clock value for the receiving node is set to between 0 and a communication latency value (γ) if the clock value is less than a minimum event-response delay (D). A new Sync message is also transmitted to any directly connected nodes if the clock value is greater than or equal to both D and a graph threshold (TS). When the Sync message is not received the synchronizer increments the clock value if the clock value is less than a resynchronization period (P), and resets the clock value and transmits a new Sync message to all directly connected nodes when the clock value equals or exceeds P.
展开▼
机译:呈任意,未分区图的形式的自稳定网络包括K个节点,这些节点具有执行协议的同步器。每个节点的K-1监视器可以接收从直接连接的节点发送的同步消息。当接收到Sync消息时,如果时钟值小于最小事件响应延迟(D),则将接收节点的逻辑时钟值设置在0和通信延迟值(γ)之间。如果时钟值大于或等于D和图形阈值(T S Sub>),则新的Sync消息也会发送到任何直接连接的节点。当未接收到同步消息时,如果时钟值小于重新同步周期(P),则同步器将使时钟值递增,并在时钟值等于或超过时钟值时重置时钟值并将新的同步消息发送到所有直接连接的节点P.
展开▼