Show simple item record

dc.contributor.advisorLynch, Nancy A.en_US
dc.contributor.advisorAwerbuch, Baruchen_US
dc.contributor.authorPatt, Boazen_US
dc.date.accessioned2023-03-29T15:26:49Z
dc.date.available2023-03-29T15:26:49Z
dc.date.issued1994-10
dc.identifier.urihttps://hdl.handle.net/1721.1/149819
dc.description.abstractWe consider the problem of clock synchronization in a system with uncertain message delays and clocks with bounded drift. To analyze this classical problem, we introduce the concept of synchronization graphs, and show that the tightest achievable synchronen_US
dc.relation.ispartofseriesMIT-LCS-TR-680
dc.titleA Theory of Clock Synchronizationen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record