A convergence function for clock synchronization protocols

E. Luit, J. Martin
{"title":"A convergence function for clock synchronization protocols","authors":"E. Luit, J. Martin","doi":"10.1109/WPDRTS.1994.365656","DOIUrl":null,"url":null,"abstract":"A distributed fault-tolerant Convergence Function (CF) is proposed to resynchronize clocks with high precision. The CF can be used in conjunction with drift corrections which significantly increases the period between resynchronizations. This is important when clock drifts are large, because clock synchronization overhead then becomes intolerable. Clock differences are disseminated by a reliable message protocol after the clock valves are exchanged. All correct clocks then have identical copies of a matrix of clock differences. Matrix elements of correct clocks satisfy several relations. A subset of clocks that satisfy these relations defines an average clock. The influence of incorrect clocks on the average clock is shown to be bounded. The resynchronization is precise if clock reading errors are small, including uncertainties in transmission delays. Incorrect clocks may run too slow or too fast, exhibit omission failures or report inconsistent values.<<ETX>>","PeriodicalId":275053,"journal":{"name":"Second Workshop on Parallel and Distributed Real-Time Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Second Workshop on Parallel and Distributed Real-Time Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WPDRTS.1994.365656","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

A distributed fault-tolerant Convergence Function (CF) is proposed to resynchronize clocks with high precision. The CF can be used in conjunction with drift corrections which significantly increases the period between resynchronizations. This is important when clock drifts are large, because clock synchronization overhead then becomes intolerable. Clock differences are disseminated by a reliable message protocol after the clock valves are exchanged. All correct clocks then have identical copies of a matrix of clock differences. Matrix elements of correct clocks satisfy several relations. A subset of clocks that satisfy these relations defines an average clock. The influence of incorrect clocks on the average clock is shown to be bounded. The resynchronization is precise if clock reading errors are small, including uncertainties in transmission delays. Incorrect clocks may run too slow or too fast, exhibit omission failures or report inconsistent values.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
时钟同步协议的收敛功能
提出了一种分布式容错收敛函数(CF)来实现高精度的时钟重同步。CF可以与漂移校正一起使用,这大大增加了重新同步之间的周期。当时钟漂移很大时,这一点很重要,因为时钟同步开销将变得无法忍受。在交换时钟阀之后,时钟差异通过可靠的消息协议进行传播。所有正确的时钟都有时钟差异矩阵的相同副本。正确时钟的矩阵元素满足几种关系。满足这些关系的时钟子集定义了平均时钟。错误时钟对平均时钟的影响是有限的。如果时钟读取误差很小,包括传输延迟的不确定性,则重新同步是精确的。不正确的时钟可能运行太慢或太快,显示遗漏失败或报告不一致的值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Real-time optimization of distributed load balancing Issues in integrating reusable Ada 9X objects into distributed real-time systems Use of concurrency enhancement in off-line schedule construction The advanced distributed ramp metering system (ARMS) Real-time issues in distributed multimedia systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1