| 词条 | Clock synchronization |
| 释义 |
TerminologyIn serial communication, clock synchronization can refer to clock recovery which achieves frequency synchronization, as opposed to full phase synchronization. Such clock synchronization is used in synchronization in telecommunications and automatic baud rate detection.[2] Plesiochronous or isochronous operation refers to a system with frequency synchronization and loose constraints on phase synchronization. Synchronous operation implies a tighter synchronization based on time perhaps in addition to frequency. ProblemsAs a result of the difficulties managing time at smaller scale, there are problems associated with clock skew that take on more complexity in distributed computing in which several computers will need to realize the same global time. For instance, in Unix systems the make command is used to compile new or modified code and seeks to avoid recompiling unchanged code. The make command uses the clock of the machine it runs on to determine which source files need to be recompiled. If the sources reside on a separate file server and the two machines have unsynchronized clocks, the make program might not produce the correct results.[3] SolutionsIn a system with central server, the synchronization solution is trivial; the server will dictate the system time. Cristian's algorithm and the Berkeley algorithm are potential solutions to the clock synchronization problem in this environment. In a distributed system the problem takes on more complexity because a global time is not easily known. The most used clock synchronization solution on the Internet is the Network Time Protocol (NTP) which is a layered client-server architecture based on UDP message passing. Lamport timestamps and vector clocks are concepts of the logical clock in distributed systems. In a wireless network, the problem becomes even more challenging due to the possibility of collision of the synchronization packets on the wireless medium and the higher drift rate of clocks on the low-cost wireless devices.[4][5] Berkeley algorithmThe Berkeley algorithm is suitable for systems where a radio clock is not present, this system has no way of making sure of the actual time other than by maintaining a global average time as the global time. A time server will periodically fetch the time from all the time clients, average the results, and then report back to the clients the adjustment that needs be made to their local clocks to achieve the average. This algorithm highlights the fact that internal clocks may vary not only in the time they contain but also in the clock rate. Clock-sampling mutual network synchronizationClock-sampling mutual network synchronization (CS-MNS) is suitable for distributed and mobile applications. It has been shown to be scalable over mesh networks that include indirectly-linked non-adjacent nodes, and is compatible with IEEE 802.11 and similar standards. It can be accurate to the order of few microseconds, but requires direct physical wireless connectivity with negligible link delay (less than 1 microsecond) on links between adjacent nodes, limiting the distance between neighboring nodes to a few hundred meters.[6] Cristian's algorithmCristian's algorithm relies on the existence of a time server.[7] The time server maintains its clock by using a radio clock or other accurate time source, then all other computers in the system stay synchronized with it. A time client will maintain its clock by making a procedure call to the time server. Variations of this algorithm make more precise time calculations by factoring in network radio propagation time. Global Positioning SystemThe Global Positioning System can also be used for clock synchronization. The accuracy of GPS time signals is ±10 ns[8] and is second only to the atomic clocks upon which they are based. Inter-range instrumentation group time codesIRIG timecode are standard formats for transferring timing information. Atomic frequency standards and GPS receivers designed for precision timing are often equipped with an IRIG output. The standards were created by the TeleCommunications Working Group of the U.S. military's Inter-Range Instrumentation Group (IRIG), the standards body of the Range Commanders Council. Work on these standards started in October 1956, and the original standards were accepted in 1960.[9]Network Time ProtocolNetwork Time Protocol (NTP) is a highly robust protocol, widely deployed throughout the Internet. Well tested over the years, it is generally regarded as the state of the art in distributed time synchronization protocols for unreliable networks. It can reduce synchronization offsets to times of the order of a few milliseconds over the public Internet, and to sub-millisecond levels over local area networks. A simplified version of the NTP protocol, SNTP, can also be used as a pure single-shot stateless master-slave synchronization protocol, but lacks the sophisticated features of NTP, and thus has much lower performance and reliability levels. Precision Time ProtocolPrecision Time Protocol (PTP) is a master/slave protocol for delivery of highly accurate time over local area networks Reference broadcast synchronizationThe Reference Broadcast Time Synchronization (RBS) algorithm is often used in wireless networks and sensor networks. In this scheme, an initiator broadcasts a reference message to urge the receivers to adjust their clocks. Reference Broadcast Infrastructure SynchronizationThe Reference Broadcast Infrastructure Synchronization (RBIS)[10] protocol is a master/slave synchronization protocol based on the receiver/receiver synchronization paradigm, as RBS. It is specifically tailored to be used in IEEE 802.11 Wi-Fi networks configured in infrastructure mode (i.e., coordinated by an access point). The protocol does not require any modification to the access point. Synchronous EthernetSynchronous Ethernet uses Ethernet in a synchronous manner such that when combined with synchronization protocols such as Precision Time Protocol in the case of the White Rabbit Project, sub-nanosecond synchronization accuracy may be achieved. Synchronization in Ad-hoc Wireless NetworksSynchronization is achieved in ad-hoc wireless networks through sending synchronization messages in a multi-hop manner and each node progressively synchronizing with the node that is the immediate sender of a synchronization message. A prominent example is the Flooding Time Synchronization Protocol (FTSP),[4] which achieves highly accurate synchronization in the order of a few microseconds. Another protocol, Harmonia,[5] is able to achieve synchronization even when the device firmware cannot be modified and is the fastest known synchronization protocol in ad-hoc wireless networks. See also{{Portal|Time}}
References1. ^{{Citation| last1 = Tanenbaum| first1 = Andrew S.| author1link = Andrew S. Tanenbaum| last2 = van Steen| first2 = Maarten| title = Distributed Systems : Principles and Paradigms| publisher = Prentice Hall| year = 2002| isbn = 0-13-088893-1}} 2. ^{{citation |url=http://heather.cs.ucdavis.edu/~matloff/Networks/Serial/Serial.pdf |title=Transmission on a Serial Line |access-date=2018-04-17 |author=Norman Matloff |date=September 3, 2001}} 3. ^{{cite web |url=http://www.dsn.jhu.edu/~platania/index_files/clock_sync.pdf |page=11 |title=Clock Synchronization |author=Marco Platania |date=2018-06-03}} 4. ^1 {{Cite journal|last=Maróti|first=Miklós|last2=Kusy|first2=Branislav|last3=Simon|first3=Gyula|last4=Lédeczi|first4=Ákos|date=2004|title=The Flooding Time Synchronization Protocol|url=http://doi.acm.org/10.1145/1031495.1031501|journal=Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems|series=SenSys '04|location=New York, NY, USA|publisher=ACM|volume=|pages=39–49|doi=10.1145/1031495.1031501|isbn=1581138792|via=}} 5. ^1 {{Cite journal|last=Koo|first=Jinkyu|last2=Panta|first2=Rajesh K.|last3=Bagchi|first3=Saurabh|last4=Montestruque|first4=Luis|date=2009|title=A Tale of Two Synchronizing Clocks|url=http://doi.acm.org/10.1145/1644038.1644062|journal=Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems|series=SenSys '09|location=New York, NY, USA|publisher=ACM|pages=239–252|doi=10.1145/1644038.1644062|isbn=9781605585192}} 6. ^{{Citation |last1=Rentel |first1=Carlos H. |last2=Kunz |first2=Thomas |title=A clock-sampling mutual network synchronization algorithm for wireless ad hoc networks |journal=IEEE Wireless Communications and Networking Conference |volume=1 |date=March 2005 |pages=638–644 |url=http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1424575 |publisher=IEEE Press |doi=10.1109/WCNC.2005.1424575}} 7. ^{{Citation| last=Cristian| first=F.| title=Probabilistic clock synchronization| journal=Distributed Computing| volume=3| issue=3| year=1989| pages=146–158| url=http://www.springerlink.com/content/j5250h34013874jv/| publisher=Springer| doi=10.1007/BF01784024}} 8. ^{{cite web |url=http://tf.nist.gov/time/commonviewgps.htm |title=Common View GPS Time Transfer |publisher=nist.gov |accessdate=2011-07-23 |archiveurl=https://web.archive.org/web/20121028043917/http://tf.nist.gov/time/commonviewgps.htm |archivedate=2012-10-28}} 9. ^http://literature.rockwellautomation.com/idc/groups/literature/documents/wp/enet-wp030_-en-e.pdf 10. ^{{Citation| last1=Cena| first1=G.| last2=Scanzio| first2=S.| last3=Valenzano| first3=A.| last4=Zunino| first4=C.| title=Implementation and Evaluation of the Reference Broadcast Infrastructure Synchronization Protocol| journal=IEEE Transactions on Industrial Informatics| volume=11| issue=3| date=June 2015| pages=801–811| url=http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7018946&isnumber=7116638| publisher=IEEE Press| doi=10.1109/TII.2015.2396003}} External links
3 : Synchronization|Clocks|Distributed computing problems |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。