Skip to main content
Log in

Reaching self-stabilising distributed synchronisation with COTS Ethernet components: the WALDEN approach

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

For reaching deterministic self-stabilising distributed synchronisation with commercial-off-the-shelf (COTS) Ethernet, this paper explores the Wire-Adapted Linker-Decoupled EtherNet (WALDEN) architecture with the integration of several mass-produced COTS products. Upon this architecture, basic strategies of distributed synchronisation are discussed. Self-stabilising algorithms are presented and formally analysed. Besides, a prototype system is realised with COTS switches, PHY chips, and low-end ARM series under the WALDEN architecture with a minimum hardware modification. The experimental result shows that a sub-microsecond synchronisation precision can be achieved with this prototype implementation even in the presence of low-quality switch with non-queuing delay-jitters of several microseconds. Among existing solutions, this work features in considering the distributed synchronisation, backward-compatibility, and self-stabilisation problems as a whole.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

Notes

  1. For simplicity, we assume the state-timer and the local clock in a node share the same hardware frequency source, which can be easily implemented by configuring the clock-trees of common embedded systems. And as COTS external crystal oscillators could support for \(\rho <10^{-4}\), the difference between \(1+\rho\) and \((1-\rho )^{-1}\) is ignored in computation and analysis.

  2. SIGs which arrive at the same time can be ordered by unique node numbers.

  3. Later arrived SIGs from the same MES node in a round should be ignored in the WS nodes to resist babbling-idiot ES nodes.

  4. As shown later, the nonfaulty nodes would be synchronised at the end of the first round.

  5. For CES nodes, they behave like MES nodes except for they never dispatching SIG.

  6. The dispatching instants of a broadcasted SIG in a nonfaulty node are assumed identical.

  7. In concrete computations, these static edge propagation delays on receiving and dispatching a SIG in an ES node should often be estimated respectively.

  8. For dynamic local delays, this assumption can be supported by slightly adjusting the state-timer according to local delay measurements in actual implementation.

  9. To reduce overall estimation errors, concrete algorithms should select a short path between the S-nodes of two SRs in computing region reference differences.

  10. This can also be supported by slightly adjusting the state-timer according to local delay measurements in actual implementation.

  11. To be heuristic, we prefer simpleness to tightness in the premises of the lemmata and theorems. Tighter bounds could be derived with more detailed models.

  12. We do not use the dependent properties in proving this assumption.

References

Download references

Acknowledgements

The author would like to thank the reviewers for their valuable and constructive comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shaolin Yu.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yu, S., Zhu, J. & Yang, J. Reaching self-stabilising distributed synchronisation with COTS Ethernet components: the WALDEN approach. Real-Time Syst 57, 347–386 (2021). https://doi.org/10.1007/s11241-020-09356-x

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11241-020-09356-x

Keywords

Navigation